Multidimensional binary search trees used for associative searching
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Approximating minimum cocolorings
Information Processing Letters
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Preserving order in a forest in less than logarithmic time
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
A data structure for orthogonal range queries
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
On minimum k-modal partitions of permutations
Journal of Discrete Algorithms
An experimental investigation of set intersection algorithms for text searching
Journal of Experimental Algorithmics (JEA)
Untangled Monotonic Chains and Adaptive Range Search
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Untangled monotonic chains and adaptive range search
Theoretical Computer Science
On the compression of search trees
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
We present a practical implementation of the first adaptive data structure for orthogonal range queries in 2D [Arroyuelo et al., ISAAC 2009]. The structure is static, requires only linear space for its representation, and can even be made implicit. The running time for a query is O(lg k lg n+min(k,m) lg n+m), where k is the number of noncrossing monotonic chains in which we can partition the set of points, and m is the size of the output. The space consumption of our implementation is 2n + o(n) words. The experimental results show that this structure is competitive with the state of the art. We also present an alternative construction algorithm for our structure, which in practice outperforms the original proposal by orders of magnitude.