Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
The analysis of multidimensional searching in quad-trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Journal of Algorithms - Analysis of algorithms
On the average performance of orthogonal range search in multidimensional data structures
Journal of Algorithms - Analysis of algorithms
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Randomized K-Dimensional Binary Search Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Expected worst-case partial match in random quadtries
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Concentration of Size and Path Length of Tries
Combinatorics, Probability and Computing
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
On the cost of searching signature trees
Information Processing Letters
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
Phase changes in random point quadtrees
ACM Transactions on Algorithms (TALG)
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Algorithms (TALG)
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Partial match queries in random quadtrees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Rank selection in multidimensional data
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.01 |
A precise analysis of partial match retrieval of multidimensional data is presented. The structures considered here are multidimensional search trees (k-d-trees) and digital tries (k-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 k-d-trees, and properties of the Mellin integral transform for k-d-tries and extendible cell algorithms.