Maintaining order in a generalized linked list
Acta Informatica
New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
A balanced search tree with O(1) worst case update time
Acta Informatica
Introduction to algorithms
An efficient implementation of trie structures
Software—Practice & Experience
Bonsai: a compact representation of trees
Software—Practice & Experience
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
The C++ Programming Language, Third Edition
The C++ Programming Language, Third Edition
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Data Structures, Algorithms, and Applications in C++
Data Structures, Algorithms, and Applications in C++
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
GLIMPSE: a tool to search through entire file systems
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Optimised Predecessor Data Structures for Internal Memory
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Comparing integer data structures for 32- and 64-bit keys
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
A common paradigm in data structures is to combine two different kinds of data structures into one, yielding a hybrid data structure with improved resource bounds. We perform an experimental evaluation of hybrid data structures in the context of maintaining a dynamic ordered set whose items have integer or floating-point keys. Among other things we demonstrate clear speedups over library implementations of search trees, both for predecessor queries and updates. Our implementations use very little extra memory compared to search trees, and are also quite generic.