Partial match queries in relaxed multidimensional search trees

Partial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is aK-tuple of values. The components of a key are called thecoordinates orattributes of the key. In a partial match query we specify the value ofs attributes, 0<s<K, and leave the remainingK —s attributes unspecified. The goal is to retrieve all the records in the database that match the specified attributes. In this paper we present several results about the average performance and variance of partial matches in relaxedK-dimensional trees (search trees and digital tries). These data structures are variants of the well knownK d-trees andK d-tries. In relaxed trees the sequence of attributes used to guide a query is explicitly stored at the nodes of the tree and randomly generated and, in general, will be different for different search paths. In the standard variants, the sequence of attributes that guides a query examines the attributes in a cyclic fashion, fixed and identical for all search paths. We show that the probabilistic analysis of the relaxed multidimensional trees is very similar to that of standardK d-trees andK d-tries, and also to the analysis of quadtrees. In fact, besides the average cost and variance of partial match in relaxedK d-trees andK d-tries, we also obtain the variance of partial matches in two-dimensional quadtrees. We also compute the average cost of partial matches in other relaxed multidimensional digital tries, namely, relaxedK d-Patricia and relaxedK d-digital search trees.

[1]  Helmut Prodinger,et al.  Multidimensional Digital Searching-Alternative Data Structures , 1994, Random Struct. Algorithms.

[2]  Conrado Martínez,et al.  Randomized K-Dimensional Binary Search Trees , 1998, ISAAC.

[3]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[6]  Gaston H. Gonnet,et al.  Analytic variations on quadtrees , 2005, Algorithmica.

[7]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[8]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals , 1995, Theor. Comput. Sci..

[9]  Philippe Flajolet,et al.  Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations , 1989, WADS.

[10]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[11]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[12]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[13]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[14]  Philippe Flajolet,et al.  Partial match retrieval of multidimensional data , 1986, JACM.

[15]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[16]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[17]  Salvador Roura.  An Improved Master Theorem for Divide-and-Conquer Recurrences , 1997, ICALP.

[18]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[19]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[20]  Werner Schachinger.  The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie , 1995, Random Struct. Algorithms.

[21]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[22]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[23]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[24]  Walter A. Burkhard,et al.  Hashing and trie algorithms for partial match retrieval , 1976, TODS.

[25]  Helmut Prodinger,et al.  Multidimensional Digital Searching and Some New Parameters in Tries , 1993, Int. J. Found. Comput. Sci..