Result: The BTR-tree: Path-defined version-range splitting in a branched and temporal structure

Title:
The BTR-tree: Path-defined version-range splitting in a branched and temporal structure
Authors:
LINAN JIANG, SALZBERG, Betty, LOMET, David, BARRENA, Manuel
Source:
Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)Lecture notes in computer science. :28-45
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Subject Terms:
Documentation, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Arbre recherche, Search tree, Arbol investigación, Base donnée temporelle, Temporal databases, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Espace temps, Space time, Espacio tiempo, Méthode arborescente, Tree structured method, Método arborescente, Ramification, Branching, Ramificación, Redondance, Redundancy, Redundancia, Structure donnée, Data structure, Estructura datos, Temps accès, Access time, Tiempo acceso, Traçabilité, Traceability, Rastreabilidad
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Oracle Corp., 400 Oracle Parkway, Redwood Shores, CA 94065, United States
College of Computer Science Northeastern Univerity, Boston, MA 02115, United States
Microsoft Research One Microsoft Way, Building 9, Redmond, WA 98052, United States
Universidad de Extremadura, Cáceres, Spain
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15672852
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15672852
Database:
PASCAL Archive

Further Information

There are applications which require the support of temporal data with branched time evolution, called branched-and-temporal data. In a branched-and-temporal database, both historic versions and current versions are allowed to be updated. We present an access method, the BTR-Tree, for branched-and-temporal databases with reasonable space and access time tradeoff. It is an index structure based on the BT-Tree [5]. The BT-Tree always splits at a current version whenever a data page or an index page is full. The BTR-Tree is able to split at a previous version while still keeping the posting property that only one parent page needs to be updated. The splitting policy of the BTR-Tree is designed to reduce data redundancy in the structure introduced by branching. Performance results show that the BTR-Tree has better space efficiency and similar query efficiency than the BT-Tree, with no overhead in search and posting algorithm complexity.