PBFilter

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

PBFilter: indexing flash-resident data through partitioned summaries

Full text

Pdf (197 KB)

Source

Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents

Napa Valley, California, USA

POSTER SESSION: Poster session 1 database table of contents

Pages 1333-1334

Year of Publication: 2008

ISBN:978-1-59593-991-3

Authors

Shaoyi Yin	INRIA, Le Chesnay and Univ. of Versailles, Versailles, France; Renmin Univ. of China, Beijing, China
Philippe Pucheral	INRIA, Univ. of Versailles, Le Chesnay, France
Xiaofeng Meng	Renmin University of China, Beijing, China

Sponsors

ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 106, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458263 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Nicolas Anciaux , Mehdi Benzine , Luc Bouganim , Kévin Jacquemin , Philippe Pucheral , Shaoyi Yin, Restoring the Patient Control over Her Medical History, Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems, p.132-137, June 17-19, 2008 [doi>10.1109/CBMS.2008.101]
	2	Bityutskiy, A.-B., JFFS3 Design Issues. Tech. report, Nov. 2005.
	3	Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, v.13 n.7, p.422-426, July 1970 [doi>10.1145/362686.362692]
	4	Gye-Jeong Kim , Seung-Cheon Baek , Hyun-Sook Lee , Han-Deok Lee , Moon Jeung Joe, LGeDBMS: a small DBMS for embedded system with flash memory, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	5	Sang-Won Lee , Bongki Moon, Design of flash-based DBMS: an in-page logging approach, Proceedings of the 2007 ACM SIGMOD international conference on Management of data, June 11-14, 2007, Beijing, China [doi>10.1145/1247480.1247488]
	6	Suman Nath , Aman Kansal, FlashDB: dynamic self-tuning database for NAND flash, Proceedings of the 6th international conference on Information processing in sensor networks, April 25-27, 2007, Cambridge, Massachusetts, USA [doi>10.1145/1236360.1236412]
	7	Wu, C., Chang, L., and Kuo, T. An Efficient B-Tree Layer for Flash-Memory Storage Systems. Int. Conf. on Real-Time and Embedded Computing Systems and Applications (RTCSA), 2003.
	8	Yin, S., Pucheral, P., Meng X. PBFilter: Indexing Flash-Resident Data through Partitioned Summaries. Tech. Rep. RR-6548. INRIA. 2008.