Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Optimal multiway search trees for variable size keys
Acta Informatica
Generalized binary split trees
Acta Informatica
ACM Transactions on Database Systems (TODS)
Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Analysis of new variants of coalesced hashing
ACM Transactions on Database Systems (TODS)
Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
A polynomial time generator for minimal perfect hash functions
Communications of the ACM
On search by address computation
BIT - Ellis Horwood series in artificial intelligence
A backtracking method for constructing perfect hash functions from a set of mapping functions
BIT - Ellis Horwood series in artificial intelligence
Self-adjusting binary search trees
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Height-balanced trees of order (β, γ, δ)
ACM Transactions on Database Systems (TODS)
Estimating the cost of updates in a relational database
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Data structures for quadtree approximation and compression
Communications of the ACM
A probability model for overflow sufficiency in small hash tables
Communications of the ACM
Exact balancing is not always good
Information Processing Letters
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
Finding minimal perfect hash functions
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
A note on the height of binary search trees
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Dynamic file structure for partial match retrieval based on overflow bucket sharing
IEEE Transactions on Software Engineering
Tree rebalancing in optimal time and space
Communications of the ACM
Generating binary trees of bounded height
Acta Informatica
O(1) space complexity deletion for AVL trees
Information Processing Letters
Eliminating the flag in threaded binary search trees
Information Processing Letters
The efficiency of using k-d trees for finding nearest neighbors in discrete space
Information Processing Letters
Associative searching in multiple storage units
ACM Transactions on Database Systems (TODS)
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
An amortized analysis of insertions into AVL trees
SIAM Journal on Computing
Collections of functions for perfect hashing
SIAM Journal on Computing
Fast identification of Ada and Modula-2 reserved words
Journal of Pascal, Ada & Modula-2
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Digital search trees revisited
SIAM Journal on Computing
A binary search with a parallel recovery of the bits
SIAM Journal on Computing
On the Height of Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
On the average internal path length of many search trees
Acta Informatica
Ranking and unranking of AVL-trees
SIAM Journal on Computing
Searching in trees, series-parallel and interval orders
SIAM Journal on Computing
Branching processes in the analysis of the heights of trees
Acta Informatica
The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
Two Access Methods Using Compact Binary Trees
IEEE Transactions on Software Engineering
A log log n data structure for three-sided range queries
Information Processing Letters
Binary search networks: a new method for key searching
Information Processing Letters
On the rotation distance in the lattice of binary trees
Information Processing Letters
Some average measures in m-ary search trees
Information Processing Letters
Modeling B-tree insertion activity
Information Processing Letters
SIAM Journal on Computing
Height restricted optimal binary trees
SIAM Journal on Computing
A subquadratic algorithm for constructing approximately optimal binary search trees
Journal of Algorithms
Jump interpolation search trees and symmetric binary numbers
Information Processing Letters
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
External hashing with limited internal storage
Journal of the ACM (JACM)
Communications of the ACM
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
On search times for early-insertion coalesced hashing
SIAM Journal on Computing
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Information Processing Letters
On the rotation distance of binary trees
Information Processing Letters
Generating t-ary trees in A-order
Information Processing Letters
A study of page arrangements for extendible hashing
Information Processing Letters
An ordered minimal perfect hashing scheme with single parameter
Information Processing Letters
Two algorithms for constructing a binary tree from its traversals
Information Processing Letters
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Implicit data structures for linear hashing schemes
Information Processing Letters
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
Expected behaviour of B+-trees under random insertions
Acta Informatica
Self-adjusting and split sequence hash tables
Information Processing Letters
Point representation and hashing of an interval
Information Processing Letters
Concurrency control on extendible hashing
Information Processing Letters
Last-come-first-served hashing
Journal of Algorithms
On the upper bound on the rotation distance of binary trees
Information Processing Letters
Analysis of random probing hashing
Information Processing Letters
Multidimensional Balanced Binary Trees
IEEE Transactions on Computers
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
SIAM Journal on Computing
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
The cost distribution of clustering in random probing
Journal of the ACM (JACM)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Fast hashing of variable-length text strings
Communications of the ACM
Concurrent operations on extendible hashing and its performance
Communications of the ACM
Construction of as tree from its traversals in optimal time and space
Information Processing Letters
Generating binary trees by transpositions
Journal of Algorithms
Hash table collision resolution with direct chaining
Journal of Algorithms
Analysis of the space of search trees under the random insertion algorithm
Journal of Algorithms
Near—perfect hashing of large word sets
Software—Practice & Experience
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Generating binary trees using rotations
Journal of the ACM (JACM)
The average time until bucket overflow
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Analysis of dynamic hashing with deferred splitting
ACM Transactions on Database Systems (TODS)
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS)
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Analysis of a heuristic for full trie minimization
ACM Transactions on Database Systems (TODS)
Analysis of index-sequential files with overflow chaining
ACM Transactions on Database Systems (TODS)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
On the complexity of designing optimal partial-match retrieval systems
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
File Organization: On the Selection of Random Access Index Points for Sequential Files
Journal of the ACM (JACM)
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
Efficiency of a Binary Comparison Storage Technique
Journal of the ACM (JACM)
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems
Journal of the ACM (JACM)
Big Buckets Are (Are Not) Better!
Journal of the ACM (JACM)
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
Generation of Binary Trees from Ballot Sequences
Journal of the ACM (JACM)
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Journal of the ACM (JACM)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Performance Measures for Ordered Lists in Random-Access Files
Journal of the ACM (JACM)
On the Generation of Binary Trees
Journal of the ACM (JACM)
A Note on Enumerating Binary Trees
Journal of the ACM (JACM)
External Hashing Schemes for Collections of Data Structures
Journal of the ACM (JACM)
A New Approach to the Analysis of Linear Probing Schemes
Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
On the performance of balanced hashing functions when the keys are not equiprobable
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Cost Model for the Internal Organization of B+-Tree Nodes
ACM Transactions on Programming Languages and Systems (TOPLAS)
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
File organization: implementation of a method guaranteeing retrieval in one access
Communications of the ACM
A quadtree medial axis transform
Communications of the ACM
A Monte Carlo study of Cichelli hash-function solvability
Communications of the ACM
An effective way to represent quadtrees
Communications of the ACM
Implementations for coalesced hashing
Communications of the ACM
Comparison of synonym handling and bucket organization methods
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
A linear algorithm for copying binary trees using bounded workspace
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
Communications of the ACM
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Deletion in two-dimensional quad trees
Communications of the ACM
Comments on perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
Communications of the ACM
Insertions and deletions in one-sided height-balanced trees
Communications of the ACM
A numbering system for binary trees
Communications of the ACM
Improving the access time for random access files
Communications of the ACM
Analysis of design alternatives for virtual memory indexes
Communications of the ACM
Comment on weighted increment linear search for scatter tables
Communications of the ACM
An optimal method for deletion in one-sided height-balanced trees
Communications of the ACM
A selective traversal algorithm for binary search trees
Communications of the ACM
Communications of the ACM
A comparison of tree-balancing algorithms
Communications of the ACM
Communications of the ACM
A note on virtual memory indexes
Communications of the ACM
Communications of the ACM
Communications of the ACM
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
Pagination of B*-trees with variable-length records
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Communications of the ACM
An insertion technique for one-sided height-balanced trees
Communications of the ACM
The quadratic hash method when the table size is not a prime number
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
Quadratic search for hash tables of sizes P n
Communications of the ACM
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
An improved index sequential access method using hashed overflow
Communications of the ACM
On Foster's information storage and retrieval using AVL trees
Communications of the ACM
Weighted increment linear search for scatter tables
Communications of the ACM
A note on optimal doubly-chained trees
Communications of the ACM
The reallocation of hash-coded tables
Communications of the ACM
A note on when to chain overflow items within a direct-access table
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
The use of quadratic residue research
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Communications of the ACM
General performance analysis of key-to-address transformation methods using an abstract file concept
Communications of the ACM
Comment on Brent's scatter storage algorithm
Communications of the ACM
Communications of the ACM
File structures using hashing functions
Communications of the ACM
Multi-attribute retrieval with combined indexes
Communications of the ACM
Communications of the ACM
Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Handling identifies as internal symbols in language processors
Communications of the ACM
Analysis of a file addressing method
Communications of the ACM
Technical correspondence: On B-trees re-examined
Communications of the ACM
Computer Programs for Spelling Correction
Computer Programs for Spelling Correction
Data Structure Techniques
Algorithms 2: Data Structures and Search Algorithms
Algorithms 2: Data Structures and Search Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
B+ trees and indexed sequential files: a performance comparison
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Multikey, Extensible Hashing for Relational Databases
IEEE Software
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries
GI - 10. Jahrestagung
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On a multidimensional search problem (Preliminary Version)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A letter oriented minimal perfect hashing function
ACM SIGPLAN Notices
| Hi-index | 0.00 |
How to store and to search, or retrieve, information efficiently is an important problem in computer science because searching is the most time-consuming part of many programs, and the substitution of a good search method for a bad one often leads to a substantial increase in speed. Particularly, a key search technique of finding which record has a special field as its key has been widely used in database management, compiler construction, natural language processing, and many other applications. The aim of this article is to provide a great deal of references, classified by consideration of their problems.