Indexing multiversion databases

Authors:
Khaled Jouini;Geneviève Jomier
Affiliations:
Université Paris Dauphine, Paris, France;Université Paris Dauphine, Paris, France
Venue:
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Year:
2007

Citing 6
Cited 8

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

Data & Knowledge Engineering
Cost models for overlapping and multiversion structures

ACM Transactions on Database Systems (TODS)
Indexing Valid Time Databases via B+-Trees

IEEE Transactions on Knowledge and Data Engineering
Object and File Management in the EXODUS Extensible Database System

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Consistency of Versions in Object-Oriented Databases

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The BT-tree: A Branched and Temporal Access Method

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases

Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Transaction time indexing with version compression

Proceedings of the VLDB Endowment
Avoiding version redundancy for high performance reads in temporal databases

Proceedings of the 4th international workshop on Data management on new hardware
Multiversion join index for multiversion data warehouse

Information and Software Technology
Transactions on the multiversion B+-tree

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Indexing multiversion data warehouse: from ROWID-Based multiversion join index to bitmap-based multiversion join index

ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Data structures for multiversion data warehouse

ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Making updates disk-I/O friendly using SSDs

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient management of multiversion data with branched evolution is crucial for many applications. It requires database designers aware of tradeoffs among index structures and policies. This paper defines a framework and an analysis method for understanding the behavior of different indexing policies. Given data and query characteristics the analysis allows determining the most suitable index structure. The analysis is validated by an experimental study.