Overlapping B+-trees: An implementation of a transaction time access method

DOI10.1016/S0169-023X(98)00046-9MaRDI QIDQ4239944zbMATH OpenFDO

Authors Theodoros Tzouramanis, Y. Manolopoulos, Nikos A. Lorentzos

Publication date 28 April 1999

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

Full work available at URL https://doi.org/10.1016/S0169-023X(98)00046-9

zbMATH Keywords

access methodsalgorithmsindexingtemporal databasestime and space performancetransaction time

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases
• Indexing temporal data using existing B+ -trees
• The interval B-tree
• An adaptive split policy for the Time Split B-Tree

Cited in

(7)

• User-friendly temporal queries on historical knowledge bases
• The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases
• Overlapping linear quadtrees and spatio-temporal query processing
• Indexing temporal data using existing B+ -trees
• An adaptive split policy for the Time Split B-Tree
• A modular history-oriented access structure for bitemporal relational databases
• The interval B-tree

This page was built for publication: Overlapping B+-trees: An implementation of a transaction time access method

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