Adding range restriction capability to dynamic data structures
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (3) , 597-617
- https://doi.org/10.1145/3828.3839
Abstract
A database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query. A transformation is presented that enables range restrictions to be added to an arbitrary dynamic data structure on n elements, provided that the problem satisfies a certain decomposability condition and that one is willing to allow increases by a factor of O (log n ) in the worst-case time for an operation and in the space used. This is a generalization of a known transformation that works for static structures. This transformation is then used to produce a data structure for range queries in k dimensions with worst-case times of O (log k n ) for each insertion, deletion, or query operation.Keywords
This publication has 16 references indexed in Scilit:
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Quintary treesACM Transactions on Database Systems, 1980
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- Real-time solutions of the origin-crossing problemTheory of Computing Systems, 1968