An adaptive split policy for the Time Split B-Tree

DOI10.1016/S0169-023X(98)00030-5MaRDI QIDQ4224372zbMATH OpenOpenAlexFDO

Authors Laura Amadesi, Fabio Grandi

Publication date 12 January 1999

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

Full work available at URL https://doi.org/10.1016/s0169-023x(98)00030-5

zbMATH Keywords

data redundancysplit policiesstorage and access structurestemporal databasetime split B-treetransaction-time

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Overlapping B+-trees: An implementation of a transaction time access method
• A storage structure for temporal databases
• 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

Cited in

(2)

• The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases
• Overlapping B+-trees: An implementation of a transaction time access method

This page was built for publication: An adaptive split policy for the Time Split B-Tree

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