Abstract
In this paper, we examine the complexity of multi-dimensional range searching in non-replicating index structures. Such nonreplicating structures achieve low storage costs and fast update times due to lack of multiple copies. We first obtain a lower bound for range searching in non-replicating structures. Assuming a simple tree structure model of an index, we prove that the worst-case time for a query retrieving t out of n data items is Ω(n/b)(d-1)/d + t/b), where d is the data dimensionality and b is the capacity of index nodes. We then propose a new index structure, called the O-tree, that achieves this query time in dynamic environments. Updates are supported in O(logb n) amortized time and exact match queries in O(logb n) worst-case time. This structure improves the query time of the best known non-replicating structure, the divided k-d tree, and is optimal for both queries and updates in non-replicating tree structures.
Work supported in part by research grants NSF/ARPA/NASA IRI-9411330 and NSF CCR-9505807.
Work done when the author was at University of California, Santa Barbara
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. L. Bentley. Multi-dimensional binary search trees used for associative searching. Communications of the ACM, 18:509–517, 1975.
S. Berchtold, D. A. Keim, and H. P. Kriegel. The X-tree: An index structure for high dimensional data. In Proc. Int. Conf. on Very Large Data Bases, pages 28–39, 1996.
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322–331, May 23–25 1990.
B. Chazelle. Lower bounds for orthogonal range searching: I. The reporting case. Journal of the ACM, 37(2):200–212, April 1990.
A. A. Diwan, S. Rane, S. Seshadri, and M. Sudarshan. Clustering techniques for minimizing external path length. Proc. Int. Conf. on Very Large Data Bases, pages 342–353, 1996.
M. W. Freeston. The BANG file: A new kind of grid file. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 260–269, 1987.
M. W. Freeston. A general solution of the n-dimensional B-tree problem. Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 80–92, May 1995.
R. Grossi and F. Italiano. Efficient splitting and merging algorithms for order-decomposable searching problems. In International Colloquium on Automata, Languages and Programming (ICALP ‘97), pages 605–615, July 1997.
A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47–57, June 1984.
J. M. Hellerstein, E. Koutsoupias, and C. H. Papadimitriou. On the analysis of indexing schemes. In Proc. ACM Symp. on Principles of Database Systems, pages 249–256, Tucson, Arizona, May 1997.
N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest-neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 369–380, May 1997.
E. Koutsoupias and D. S. Taylor. Tight bounds for 2-dimensional indexing schemes. In Proc. ACM Symp. on Principles of Database Systems, pages 52–58, Seattle, Washington, June 1998.
D. B. Lomet and B. Salzberg. The hB-tree: A multiattribute indexing method with good guaranteed performance. Proc. ACM Transactions on Database Systems, 15(4):625–658, 1990.
K. Mehlhorn. Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry. Springer-Verlag, 1984.
M. Overmars. The design of dynamic data structures. Lecture Notes in Computer Science 156, 1983.
M. Overmars and J. van Leeuwen. Worst-case optimal insertion and deletion methods for decomposable searching problems. Information Processing Letters, 12(4):168–172, 1981.
K. V. Ravi Kanth. Indexing multi-dimensional data. In Ph.D. thesis, University of California, Santa Barbara, April 1998.
J. T. Robinson. The kdb-tree: A search structure for large multi-dimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 10–18, 1981.
H. Samet. The design and analysis of spatial data structures. Addison-Wesley, 1989.
V. Samoladas and D. P. Miranker. A lower bound theorem for indexing schemes and its application to multidimensional range queries. In Proc. ACM Symp. on Principles of Database Systems, pages 44–51, Seattle, Washington, June 1998.
S. Subramanian and S. Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 378–387, 1995.
R. E. Tarjan. A class of algorithms which require non-linear time to maintain disjoint sets. Journal of Computer and System Sciences, 18:110–127, 1979.
P. M. Vaidya. Space-time tradeoffs for orthogonal range queries. SIAM Journal of Computing, 18(4):748–758, 1989.
M. van Kreveld and M. Overmars. The divided k-d tree. Algorithmica, 6:840–858, 1991.
D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. Int. Conf. on Data Engineering, pages 516–523, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravi Kanth, K.V., Singh, A. (1999). Optimal Dynamic Range Searching inNon-replicating Index Structures. In: Beeri, C., Buneman, P. (eds) Database Theory — ICDT’99. ICDT 1999. Lecture Notes in Computer Science, vol 1540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49257-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-49257-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65452-0
Online ISBN: 978-3-540-49257-3
eBook Packages: Springer Book Archive