NDLI: Read optimisations for append storage on flash

Please wait, while we are loading the content...

LDBC: benchmarks for graph and RDF data management

Cloudy: heterogeneous middleware for in time queries processing

How to exploit the device diversity and database interaction to propose a generic cost model?

Matching bounds for the all-pairs MapReduce problem

On the efficiency of multiple range query processing in multidimensional data structures

DynamicNet: an effective and efficient algorithm for supporting community evolution detection in time-evolving information networks

On-the-fly generation of multidimensional data cubes for web of things

SVMAX: a system for secure and valid manipulation of XML data

Efficiency and precision trade-offs in graph summary algorithms

Sequential pattern mining from trajectory data

Approximate high-dimensional nearest neighbor queries using R-forests

Self-managing online partitioner for databases (SMOPD): a vertical database partitioning system with a fully automatic online approach

Content-based annotation and classification framework: a general multi-purpose approach

Load balance for semantic cluster-based data integration systems

Near real-time with traditional data warehouse architectures: factors and how-to

Evaluating skyline queries over vertically partitioned tables

Top-k join queries: overcoming the curse of anti-correlation

Personalized progressive filtering of skyline queries in high dimensional spaces

A hybrid page layout integrating PAX and NSM

Querying data across different legal domains

Dynamic bitmap index recompression through workload-based optimizations

Read optimisations for append storage on flash

Verification of k-coverage on query line segments

A compact representation for efficient uncertain-information integration

Breaking skyline computation down to the metal: the skyline breaker algorithm

Read optimisations for append storage on flash

Content Provider	ACM Digital Library
Author	Petrov, Ilia Buchmann, Alejandro Gottstein, Robert
Abstract	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).
Starting Page	106
Ending Page	113
Page Count	8
File Format	PDF
ISBN	9781450320252
DOI	10.1145/2513591.2513640
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-10-09
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-Version Databases on Flash: Append Storage and Access Paths

Aspects of Append-Based Database Storage Management on Flash Memories

Read leveling for flash storage systems

Using Flash Memory as Storage for Read-Intensive Database

Revisiting Read-ahead Efficiency for Raw NAND Flash Storage in Embedded Linux

Evaluating and repairing write performance on flash devices (2009)

A NAND Flash PC Platform Read Write Cache

A read, append, prune (RAP) formalism for spatio-temporal information

Erasure Coding & Read/Write Separation in Flash Storage

Read optimisations for append storage on flash

Similar Documents

Multi-Version Databases on Flash: Append Storage and Access Paths

Aspects of Append-Based Database Storage Management on Flash Memories

Read leveling for flash storage systems

Using Flash Memory as Storage for Read-Intensive Database

Revisiting Read-ahead Efficiency for Raw NAND Flash Storage in Embedded Linux

Evaluating and repairing write performance on flash devices (2009)

A NAND Flash PC Platform Read Write Cache

A read, append, prune (RAP) formalism for spatio-temporal information

Erasure Coding & Read/Write Separation in Flash Storage

Read optimisations for append storage on flash