Indexing temporal data using existing B+ -trees

DOI10.1016/0169-023X(95)00034-PMaRDI QIDQ3122478zbMATH OpenOpenAlexWikidataFDO

Authors Cheng Hian Goh, Hongjun Lu, Beng Chin Ooi, Kian-Lee Tan

Publication date 27 February 1997

Published in Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-023x(95)00034-p

zbMATH Keywords

\(B^{+}\)-treeIndexing techniquesRelational databaseSpatial selectionTemporal database

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Overlapping B+-trees: An implementation of a transaction time access method
• Study and application of temporal index technology
• The interval B-tree
• scientific article; zbMATH DE number 1106347
• Temporal Grid File: A file structure for interval data

Cited in

(11)

• Study and application of temporal index technology
• The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases
• Using temporal hierarchies to efficiently maintain large temporal databases
• An adaptive split policy for the Time Split B-Tree
• Overlapping B+-trees: An implementation of a transaction time access method
• A study and applications of temporal quasi-order data structure
• Algorithms and Computation
• scientific article; zbMATH DE number 4185070 (Why is no real title available?)
• A storage structure for temporal databases
• A modular history-oriented access structure for bitemporal relational databases
• The interval B-tree

This page was built for publication: Indexing temporal data using existing B+ -trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122478)