The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the encipherment of search trees and random access files
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Including Scalars in a Programming Language Based on the Relational Algebra
IEEE Transactions on Software Engineering
Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Bit-Tree: a data structure for fast file processing
Communications of the ACM
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
EAS-E: an integrated approach to application development
ACM Transactions on Database Systems (TODS)
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
A Cost Model for the Internal Organization of B+-Tree Nodes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple database language for personal computers
Communications of the ACM
The EAS-E application development system: principles and language summary
Communications of the ACM
A note on virtual memory indexes
Communications of the ACM
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Main-memory index structures with fixed-size partial keys
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving index performance through prefetching
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Inverted file search algorithms for collaborative filtering
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Multi-table search for B-tree files
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
The data management facilities of PLAIN
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A high performance, universal, key associative access method
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Experiments with B-tree reorganization
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Integrating the UB-Tree into a Database System Kernel
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Dictionary-based order-preserving string compression
The VLDB Journal — The International Journal on Very Large Data Bases
Query processing and optimization in Oracle Rdb
The VLDB Journal — The International Journal on Very Large Data Bases
Searching large text collections
Handbook of massive data sets
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
B-trees and databases, past and future
Software pioneers
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
LSH forest: self-tuning indexes for similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Database Systems (TODS)
B-tree indexes, interpolation search, and skew
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
Indexing XML documents for XPath query processing in external memory
Data & Knowledge Engineering - Special issue: ER 2003
Why off-the-shelf RDBMSs are better at XPath than you might expect
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient columnar storage in B-trees
ACM SIGMOD Record
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
DSIS - a database system with interrelational semantics
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Indexing XML data stored in a relational database
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The ND2DB attack: database content extraction using timing attacks on the indexing algorithms
WOOT '07 Proceedings of the first USENIX workshop on Offensive Technologies
On the SD-tree construction for optimal signature operations
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
The TS-tree: efficient time series search and retrieval
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
On searching compressed string collections cache-obliviously
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pathfinder meets DB2®: relational XQuery optimization techniques
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
Queue - Enterprise Flash Storage
Expert Systems with Applications: An International Journal
The C-ND tree: a multidimensional index for hybrid continuous and non-ordered discrete data spaces
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Dictionary-based order-preserving string compression for main memory column stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment
Correlation maps: a compressed access method for exploiting soft functional dependencies
Proceedings of the VLDB Endowment
Self-selecting, self-tuning, incrementally optimized indexes
Proceedings of the 13th International Conference on Extending Database Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
Computers and Electrical Engineering
Compression, indexing, and retrieval for massive string data
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
ACM Transactions on Database Systems (TODS)
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
New algorithms for join and grouping operations
Computer Science - Research and Development
On the general signature trees
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Full-text and structural XML indexing on b+-tree
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Data driven approaches to speech and language processing
Nonlinear Speech Modeling and Applications
Cache craftiness for fast multicore key-value storage
Proceedings of the 7th ACM european conference on Computer Systems
Definition, detection, and recovery of single-page failures, a fourth class of database failures
Proceedings of the VLDB Endowment
Concurrency control for adaptive indexing
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal
Proceedings of the 15th International Conference on Extending Database Technology
ACM Transactions on Database Systems (TODS)
Review: Cloud computing service composition: A systematic literature review
Expert Systems with Applications: An International Journal
| Hi-index | 0.06 |
Two modifications of B-trees are described, simple prefix B-trees and prefix B-trees. Both store only parts of keys, namely prefixes, in the index part of a B*-tree. In simple prefix B-trees those prefixes are selected carefully to minimize their length. In prefix B-trees the prefixes need not be fully stored, but are reconstructed as the tree is searched. Prefix B-trees are designed to combine some of the advantages of B-trees, digital search trees, and key compression techniques while reducing the processing overhead of compression techniques.