Partial match retrieval of multidimensional data

A precise analysis of partial match retrieval of multidimensional data is presented. The structures considered here are multidimensional search trees (<italic>k</italic>-d-trees) and digital tries (<italic>k</italic>-d-tries), as well as structures designed for efficient retrieval of information stored on external devices. The methods used include a detailed study of a differential system around a regular singular point in conjunction with suitable contour integration techniques for the analysis of <italic>k</italic>-d-trees, and properties of the Mellin integral transform for <italic>k</italic>-d-tries and extendible cell algorithms.

[1]  Witold Litwin,et al.  Virtual Hashing: A Dynamically Changing Hashing , 1978, VLDB.

[2]  P. Flajolet,et al.  Some Uses of the Mellin Integral Transform in the Analysis of Algorithms , 1985 .

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

[4]  P. Flajolet,et al.  Algebraic Methods for Trie Statistics , 1985 .

[5]  J. Ian Munro,et al.  Sorting and Searching in Multisets , 1976, SIAM J. Comput..

[6]  Philippe Flajolet,et al.  Tree structures for partial match retrieval , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Philippe Flajolet,et al.  The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..

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

[9]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[10]  Per-Åke Larson,et al.  Dynamic hashing , 1978, BIT.

[11]  Journal of the Association for Computing Machinery , 1961, Nature.

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

[13]  A. Odlyzko.  Periodic oscillations of coefficients of power series that satisfy functional equations , 1982 .

[14]  Rangasami L. Kashyap,et al.  Analysis of the Multiple-Attribute-Tree Data-Base Organization , 1977, IEEE Transactions on Software Engineering.

[15]  Alfonso F. Cardenas,et al.  Doubly-Chained Tree Data Base Organisation-Analysis and Design Strategies , 1977, Comput. J..

[16]  Markku Tamminen,et al.  The extendible cell method for closest point problems , 1982, BIT.

[17]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[18]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[19]  Kotagiri Ramamohanarao,et al.  Partial-match retrieval for dynamic files , 1982, BIT.