PBFilter: indexing flash-resident data through partitioned summaries

Authors:
Shaoyi Yin;Philippe Pucheral;Xiaofeng Meng
Affiliations:
INRIA, Le Chesnay and Univ. of Versailles, Versailles, France/ Renmin Univ. of China, Beijing, China;INRIA, Univ. of Versailles, Le Chesnay, France;Renmin University of China, Beijing, China
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 5
Cited 2

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
LGeDBMS: a small DBMS for embedded system with flash memory

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
FlashDB: dynamic self-tuning database for NAND flash

Proceedings of the 6th international conference on Information processing in sensor networks
Design of flash-based DBMS: an in-page logging approach

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Restoring the Patient Control over Her Medical History

CBMS '08 Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems

Log-compact R-tree: an efficient spatial index for SSD

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Report on the first international workshop on flash-based database systems (FlashDB 2011)

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

NAND Flash has become the most popular persistent data storage medium for mobile and embedded devices. The hardware characteristics of NAND Flash (e.g. page granularity for read/write with a block-erase-before-rewrite constraint, limited number of erase cycles) preclude in-place updates. In this paper, we propose a new indexing scheme, called PBFilter, designed from the outset to exploit the peculiarities of NAND Flash.