ACM Transactions on Database Systems (TODS)
Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
File organization using composite perfect hashing
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)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Implementations for coalesced hashing
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Communications of the ACM
Linearizing the Directory Growth in Order Preserving Extendible Hashing
Proceedings of the Fourth International Conference on Data Engineering
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
A more cost effective algorithm for finding perfect hash functions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
A compendium of key search references
ACM SIGIR Forum
Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Effective clustering of objects stored by linear hashing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Using space-time grid for efficient management of moving objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Multilevel Extendible Hashing: A File Structure for Very Large Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Alternating Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Time-Space Trade-Off Analysis of Morphic Trie Images
IEEE Transactions on Knowledge and Data Engineering
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
Analysis of linear hashing revisited
Nordic Journal of Computing
A Functional Programming Approach to Deductive Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Performance Evaluation of OID Mapping Techniques
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The VLDB Journal — The International Journal on Very Large Data Bases
Performance evaluation of linear hash structure model in a nested transaction environment
Journal of Systems and Software
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Reducing cache misses by application-specific re-configurable indexing
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Protected shared libraries: a new approach to modularity and sharing
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Universal hash functions for an infinite universe and hash trees
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
| Hi-index | 0.02 |
A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.