Abstract | ||
---|---|---|
An index in a Multi-Version DBMS (MV-DBMS) has to reflect different tuple versions of a single data item. Existing approaches follow the paradigm of logically separating the tuple version data from the data item, e.g. an index is only allowed to return at most one version of a single data item (while it may return multiple data items that match a search criteria). Hence to determine the valid (and therefore visible) tuple version of a data item, the MV-DBMS first fetches all tuple versions that match the search criteria and subsequently filters visible versions using visibility checks. This involves I/O storage accesses to tuple versions that do not have to be fetched. In this vision paper we present the Multi-Version Index (MV-IDX) approach that allows index-only visibility checks which significantly reduce the amount of I/O storage accesses as well as the index maintenance overhead. The MV-IDX achieves significantly lower response times and higher transactional throughput on OLTP workloads. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1145/2628194.2628911 | IDEAS |
Keywords | Field | DocType |
design,experimentation,systems,measurement,indexing methods,performance,personalization,active learning | Data mining,Multiple data,Visibility,Information retrieval,Tuple,Computer science,Online transaction processing,Search engine indexing,Multi-label classification,Throughput,Database,Personalization | Conference |
Citations | PageRank | References |
2 | 0.39 | 9 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Robert Gottstein | 1 | 39 | 6.76 |
Rohit Goyal | 2 | 172 | 26.92 |
Sergej Hardock | 3 | 13 | 1.30 |
Ilia Petrov | 4 | 83 | 20.20 |
Alejandro P. Buchmann | 5 | 689 | 141.82 |