Self-adjusting binary search trees
Journal of the ACM (JACM)
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
External hashing with limited internal storage
Journal of the ACM (JACM)
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Text compression
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
An adaptive overflow technique for B-trees (extended abstract)
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Self-adjusting multi-way search trees
Information Processing Letters
On efficient unsuccessful search
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An efficient implementation of trie structures
Software—Practice & Experience
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing deletion in B+-trees
ACM SIGMOD Record
Overview of the second text retrieval conference (TREC-2)
TREC-2 Proceedings of the second conference on Text retrieval conference
The MG retrieval system: compressing for space and speed
Communications of the ACM
P-trees: storage efficient multiway trees
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Dynamic dictionary matching in external memory
Information and Computation
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Database Systems (TODS)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
SIAM Journal on Computing
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Reducing the space requirement of suffix trees
Software—Practice & Experience
Sampling from databases using B+-trees
Proceedings of the ninth international conference on Information and knowledge management
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A Cost Model for the Internal Organization of B+-Tree Nodes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Self-adjusting trees in practice for large text collections
Software—Practice & Experience
B+ retake: sustaining high volume inserts into large data pages
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Database Systems: The Complete Book
Database Systems: The Complete Book
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
An empirical comparison of B-trees, compact B-trees and multiway trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Limit laws for the height in PATRICIA tries
Journal of Algorithms - Analysis of algorithms
Multikey, Extensible Hashing for Relational Databases
IEEE Software
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Static Optimality Theorem for External Memory String Access
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Self-Adjusting k-ary Search Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
IEEE Transactions on Knowledge and Data Engineering
External memory data structures
Handbook of massive data sets
Overcoming the Memory Bottleneck in Suffix Tree Construction
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
A comparison of cache aware and cache oblivious static search trees using program instrumentation
Experimental algorithmics
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Journal of the ACM (JACM)
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
Operating System Concepts
ACM Computing Surveys (CSUR)
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
File searching using variable length keys
IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
Optimal self-adjusting trees for dynamic string data in secondary storage
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Obtaining provably good performance from suffix trees in secondary storage
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
A wide range of applications require that large quantities of data be maintained in sort order on disk. The B-tree, and its variants, are an efficient general-purpose disk-based data structure that is almost universally used for this task. The B-trie has the potential to be a competitive alternative for the storage of data where strings are used as keys, but has not previously been thoroughly described or tested. We propose new algorithms for the insertion, deletion, and equality search of variable-length strings in a disk-resident B-trie, as well as novel splitting strategies which are a critical element of a practical implementation. We experimentally compare the B-trie against variants of B-tree on several large sets of strings with a range of characteristics. Our results demonstrate that, although the B-trie uses more memory, it is faster, more scalable, and requires less disk space.