ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Integrating the UB-Tree into a Database System Kernel
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
B-Trees are a data structure for organizing and managing very large data volumes on peripheral computer stores. B-Trees were developed in 1969 by R. Bayer and E. McCreight; they have superb properties with respect to performance and scalability in multiuser environments.The relational database model was developed by E.F. Codd also in 1969. Its revolutionary design is based on the mathematical theories of relations, relational algebra, and predicate logic.During the 1970s it turned out (project System R at IBM) that B-Trees and relational database systems form a perfect symbiosis; therefore, all relational database systems are based on B-Trees today. Since the first commercial introduction of relational database systems in the 1980s they have grown into a multibillion dollar commercial success. The talk will also discuss UB-Trees, a new multidimensional variant of B-Trees for the next generation of databases.