The performance of multiversion concurrency control algorithms
ACM Transactions on Computer Systems (TOCS)
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Database Systems Concepts
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
The Implementation of POSTGRES
IEEE Transactions on Knowledge and Data Engineering
On Mixing Queries and Transactions via Multiversion Locking
Proceedings of the Eighth International Conference on Data Engineering
Postgres-R(SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Evaluating and repairing write performance on flash devices
Proceedings of the Fifth International Workshop on Data Management on New Hardware
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
Fast updates on read-optimized databases using multi-core CPUs
Proceedings of the VLDB Endowment
bLSM: a general purpose log structured merge tree
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
SI-CV: snapshot isolation with co-located versions
TPCTC'11 Proceedings of the Third TPC Technology conference on Topics in Performance Evaluation, Measurement and Characterization
Append storage in multi-version databases on flash
BNCOD'13 Proceedings of the 29th British National conference on Big Data
NoFTL: database systems on FTL-less flash storage
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Append-/Log-based Storage Managers (LbSM) for database systems represent a good match for the characteristics and behaviour of Flash technology. LbSM alleviate random writes reducing the impact of Flash read/write asymmetry, increasing endurance and performance. A recently proposed combination of Multi-Versioning database approaches and LbSM called SIAS [9] offers further benefits: it substantially lowers the write rate due to tuple version append granularity and therefore improves the performance. In SIAS a page contains versions of tuples of the same table. Once appended such a page is immutable. The only allowable operations are reads (lookups, scans, version visibility checks) in tuple version granularity. Optimising for them offers an essential performance increase. In the present work-in-progress paper we propose two types of read optimisations: Multi-Version Index and Ordered Log Storage. Benefits of Ordered Log Storage: (i) Read efficiency due to the use of parallel read streams; (ii) Write efficiency since larger amounts of data are appended sequentially; (iii) fast garbage collection: read multiple sorted runs, filter dead tuples and write one single, large (combined) sorted run. (iv) possible cache-efficiency optimisations (for large scans) Benefits of Multi-Version Indexing: (i) index only visibility checks; (ii) postponing of index reorganisations; (iii) no invalid tuple bits in the index (in-place updates); (iv) pre-filtering of invisible tuple versions; (v) facilitate easy identification of tuple versions to be garbage collected. Benefits of the combination of both approaches: (i) Index and ordered access; (ii) Facilitate range searches in sorted runs; (iii) on the fly garbage collection (checking of one bit).