Abstract.
This paper presents a new data structure for multi-dimensional point data which is based on an extension of the deterministic skip list data structure projected into k dimensions. The structure is labeled the k-d Range Deterministic Skip List and it supports fast insertions, deletions, and range search. The k-d Range Deterministic Skip List is optimal (i.e. \(\Theta (\lg^{{\rm k}}n + \)t) to locate and report t of n data points in range) for k-dimensional range search, assuming that our data points are elements of a commutative semigroup with set union as the commutative and associative addition operation. A dynamic data structure is defined to be optimally balanced if the product of its worst case cost functions for k-dimensional range search, insertion, deletion, storage, and preprocessing is minimal. The k-d Range Deterministic Skip List is found to be optimally balanced based on this definition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bently, J.L. (1975) Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9): 509-517
Bently, J.L., Friedman, J.H. (1979) Data structures for range searching. ACM Computing Surveys 11(4): 397-409
Bently, J.L. (1980) Multidimensional divide-and-conquer. Communications of the ACM 23(4): 214-229
Bently, J.L., Maurer, H.A. (1980) Efficient worst-case data structures for range searching. Acta Informatica 13: 155-168
Comer, D. (1979) The ubiquitous B-tree. ACM Computing Surveys 11(2): 121-137
Edelsbrunner, H. (1981) A note on dynamic range searching. Bulletin of the EATCS 15: 34-40
Fredman, M.L. (1981) A lower bound on the complexity of orthogonal Range Queries. J. ACM 28(4): 696-705
Graham R.L., Knuth, D.E., Patashnik, O. (1991) Concrete mathematics. Addison-Wesley, Reading, MA
Johnson, T. A highly concurrent priority queue based on the B-link tree. University of Florida, Department of CIS, Electronic Technical Report # 007-91
Knuth, D.E. (1973) The art of computer programming: Volume 3 Searching and sorting. Addison-Wesley, Reading, MA, pp. 550-555
Lamoureux, M.G., Nickerson, B.G. (1996) On the equivalence of B-trees and deterministic skip lists. University of New Brunswick Technical Report, TR96-102 (available at http://www.cs.unb.ca/html/techrpts.html)
Lamoureux, M.G., Nickerson, B.G. (1995) Deterministic skip lists for K-dimensional range search. University of New Brunswick Technical Report TR95-098, Revision 1, November 1995 (available at http://www.cs.unb.ca/html/techrpts.html)
Lamoureux, M.G., Nickerson, B.G. (1995) Deterministic skip list data structures: Efficient alternatives to balanced search trees. Proceedings of the 19th Annual Mathematics and Computing Science Days (APICS ‘95), Sydney, Cape Breton, Nova Scotia, Canada
Lamoureux, M.G. (1996) A dynamic data structure for multi-dimensional range searching. MSc. Thesis, University of New Brunswick (University of New Brunswick Technical Report, TR96-105, available at http://www.cs.unb.ca/html/techrpts.html)
Lamoureux, M.G. (1995) An implementation of a range tree based on an AVL tree. University of New Brunswick Technical Report, TR95-100 (available at http://www.cs.unb.ca/html/techrpts.html)
Lueker, G.S. A data structure for orthogonal range queries. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, IEEE 78 CH1387-9 C, pp. 28-34
Lueker, G.S., Willard, D.E. (1982) A data structure for dynamic range queries. Information Processing Letters 15(5): 209-213
McCreight, E.M. (1985) Priority search trees. SIAM Journal of Computation 14(2): 257-276
Munro, J.I., Papadakis, T., Sedgewick, R. (1992) Deterministic skip lists. Proceedings of the ACM-SIAM Third Annual Symposium on Discrete Algorithms, Orlando, Florida, Jan 27-29, pp. 367-375
Nickerson, B.G. (1994) Skip list data structures for multidimensional data. Computer Science Technical Report CS TR-3262 UMIACS-TR-94-52 (available from http://www.cs.umd.edu/Library/TRs/CS-TR-3262/CS-TR-3262.ps.zip)
Papadakis, T. (1993) Skip lists and probabilistic analysis of algorithms. Ph.D. Thesis, University of Waterloo (available from http://www.cs.uwaterloo.ca/cs-archive/CS-1993/28/root2side.pdf)
Pugh, W. (1990) Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33(6): 668-676
Samet, H. (1990) The design and analysis of spatial data structures. Addison-Wesley, Reading, MA
Weiss, M.A. (1994) Data structures and algorithm analysis, 2nd edn. Benjamin/Cummings Publishing Company, Inc., Redwood City, CA
Willard, D.E., Lueker, G.S (1985) Adding range restriction capability to dynamic data structures. J. ACM 32(3): 597-617
Willard, D.E. (1985) New data structures for orthogonal range queries. SIAM Journal of Computation 14(1): 232-253.
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 17 October 1995, Published online: 19 January 2005
Rights and permissions
About this article
Cite this article
Lamoureux, M.G., Nickerson, B.G. A deterministic skip list for k-dimensional range search. Acta Informatica 41, 221–255 (2005). https://doi.org/10.1007/s00236-004-0157-8
Issue Date:
DOI: https://doi.org/10.1007/s00236-004-0157-8