Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Storage management for objects in EXODUS
Object-oriented concepts, databases, and applications
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
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
ACM Transactions on Database Systems (TODS)
Algorithms for creating indexes for very large tables without quiescing updates
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Options in physical database design
ACM SIGMOD Record
Red brick warehouse: a read-mostly RDBMS for open SMP platforms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Iterators, schedulers, and distributed-memory parallelism
Software—Practice & Experience
The data warehouse toolkit: practical techniques for building dimensional data warehouses
The data warehouse toolkit: practical techniques for building dimensional data warehouses
B-tree page size when caching is considered
ACM SIGMOD Record
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Duplicate record elimination in large data files
ACM Transactions on Database Systems (TODS)
Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Operating system support for database management
Communications of the ACM
Communications of the ACM
Interpolation search—a log logN search
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Fractal prefetching B+-Trees: optimizing both cache and disk performance
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
AlphaSort: a cache-sensitive parallel external sort
The VLDB Journal — The International Journal on Very Large Data Bases
Performance of On-Line Index Construction Algorithms
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
An Efficient Hybrid Join Algorithm: A DB2 Prototype
Proceedings of the Seventh International Conference on Data Engineering
Disk Read-Write Optimizations and Data Integrity in Transaction Systems Using Write-Ahead Logging
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Proceedings of the 17th International Conference on Data Engineering
Discovery and Application of Check Constraints in DB2
Proceedings of the 17th International Conference on Data Engineering
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
Hash Joins and Hash Teams in Microsoft SQL Server
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Safely and Efficiently Updating References During On-line Reorganization
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Object and File Management in the EXODUS Extensible Database System
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Novel Index Supporting High Volume Data Warehouse Insertion
VLDB '99 Proceedings of the 25th 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
An Incremental Join Attachment for Starburst
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Key Range Locking Strategies for Improved Concurrency
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Redo Recovery after System Crashes
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th 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
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Implementierung von Zugriffspfaden durch Bitlisten
GI - 5. Jahrestagung
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The optimization of queries in relational databases
The optimization of queries in relational databases
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Transaction support for indexed summary views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
The performance impact of I/O optimizations and disk improvements
IBM Journal of Research and Development
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
Making snapshot isolation serializable
ACM Transactions on Database Systems (TODS)
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
SIAM Journal on Computing
Super-Scalar RAM-CPU Cache Compression
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
B-tree indexes, interpolation search, and skew
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
How to wring a table dry: entropy compression of relations and querying of compressed relations
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient columnar storage in B-trees
ACM SIGMOD Record
An evaluation of buffer management strategies for relational database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Concurrency control in B+-trees databases using preparatory operations
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
An adaptive packed-memory array
ACM Transactions on Database Systems (TODS)
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Bitmap Index Design Choices and Their Performance Implications
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the performance of bitmap indices for high cardinality attributes
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Cooperative scans: dynamic bandwidth sharing in a DBMS
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
EIO: error handling is occasionally correct
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Bigtable: A Distributed Storage System for Structured Data
ACM Transactions on Computer Systems (TOCS)
Efficient online index construction for text databases
ACM Transactions on Database Systems (TODS)
Technical perspective: One size fits all: an idea whose time has come and gone
Communications of the ACM - Surviving the data deluge
Breaking the memory wall in MonetDB
Communications of the ACM - Surviving the data deluge
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
DRAM errors in the wild: a large-scale field study
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
The Real Performance Drivers behind XML Lock Protocols
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Deletion without Rebalancing in Multiway Search Trees
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Index compression using 64-bit words
Software—Practice & Experience
Organization and maintenance of large ordered indices
SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Self-selecting, self-tuning, incrementally optimized indexes
Proceedings of the 13th International Conference on Extending Database Technology
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
ARC: a self-tuning, low overhead replacement cache
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
FB-tree: a B+-tree for flash-based SSDs
Proceedings of the 15th Symposium on International Database Engineering & Applications
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
Deferred maintenance of indexes and of materialized views
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
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)
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
| Hi-index | 0.00 |
Invented about 40 years ago and called ubiquitous less than 10 years later, B-tree indexes have been used in a wide variety of computing systems from handheld devices to mainframes and server farms. Over the years, many techniques have been added to the basic design in order to improve efficiency or to add functionality. Examples include separation of updates to structure or contents, utility operations such as non-logged yet transactional index creation, and robust query processing such as graceful degradation during index-to-index navigation. This survey reviews the basics of B-trees and of B-tree indexes in databases, transactional techniques and query processing techniques related to B-trees, B-tree utilities essential for database operations, and many optimizations and improvements. It is intended both as a survey and as a reference, enabling researchers to compare index innovations with advanced B-tree techniques and enabling professionals to select features, functions, and tradeoffs most appropriate for their data management challenges.