Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Layered Temporal DBMS: Concepts and Techniques
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Access Methods for Bi-Temporal Databases
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
M-IVTT: An Index for Bitemporal Databases
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Light-Weight Indexing of General Bitemporal Data
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Efficient Temporal Join Processing Using Indices
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An efficient method for indexing now-relative bitemporal data
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
The POINT approach to represent now in bitemporal databases
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
By supporting all three dimensions (i.e., key, valid and transaction time) efficiently, bitemporal databases can be applied to various application domains. Although there exist a number of previous research works, none of proposed access methods supports bitemporal databases efficiently. Concretely, update operations dramatically increase the storage cost and querying operations still bear high costs. Specially, now-related data exacerbate these problems in bitemporal databases. Recently, some notable access methods based on B-/R-tree families have been proposed to address such problems. Among them, multiversion approaches have become very promising for bitemporal databases. However, the query performance is still far away from the maturity, and none of proposed solutions have dealt with it radically. In this paper, we introduce a novel and hybrid multiversion access method, called bitemporal B+-tree (BiB+-tree), to overcome weaknesses of the previous solutions and efficiently support the storage and retrieval of bitemporal data. The BiB+-tree indexes data based on the B+-tree access method, clusters data based on both the transaction time and key (multiversion and B+-tree approach, respectively), and manages valid time dimensions based on the R*-tree. Experimental results with large bitemporal datasets establish theoretical analyses as well as the practical value of our proposed BiB+-tree.