This research explores the concurrent implementation of range search operations on quadtrees using Versioning of the data structure. The proposed approach utilizes time-stamped versioned lists to maintain the state of each ...

Counting Bloom filters are highly space-efficient with a small probability of false positives. Concurrent access to a Counting bloom filter can greatly increase its insertion and query throughput.