Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Indexing techniques for object-oriented databases
Object-oriented concepts, databases, and applications
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
H-trees: a dynamic associative search index for OODB
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Indexing temporal data using existing B+-trees
Data & Knowledge Engineering
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Indexing the edges—a simple and yet efficient approach to high-dimensional indexing
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th 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
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
BeTrIS: an index system for MPEG-7 streams
EURASIP Journal on Applied Signal Processing
On using B+-tree for efficient processing for the boundary neighborhood problem
WSEAS TRANSACTIONS on SYSTEMS
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Survey of indexing schemes for information retrieval on flash memory based wireless sensor networks
Proceedings of the 2009 conference on Information Science, Technology and Applications
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
| Hi-index | 0.00 |
Index structures are often used to support search operations in large databases. Many advanced database application domains such as spatial databases, multimedia databases, temporal databases, and object-oriented databases, call for index structures that are specially designed and tailored for the domains. Interestingly, in each of these domains, we find methods that are based on one distinct structure --- the B-tree. Invented some thirty years ago, the B-tree has been challenged repeatedly, but has retained its competitiveness. In this paper, we first give a quick review of B-trees. We then present its adaptations to various domains. For each domain, we present representative B-tree-based structures and their search operations. We conclude that the B-tree is truly an ubiquitous structure that has stood the test of times with wide acceptance in many domains.