ACM Home Page
Please provide us with feedback. Feedback
FlashDB: dynamic self-tuning database for NAND flash
Full text PdfPdf (286 KB)
Source
Information Processing In Sensor Networks archive
Proceedings of the 6th international conference on Information processing in sensor networks table of contents
Cambridge, Massachusetts, USA
SESSION: Data representations and storage table of contents
Pages: 410 - 419  
Year of Publication: 2007
ISBN:978-1-59593-638-X
Authors
Suman Nath  Microsoft Research
Aman Kansal  Microsoft Research
Sponsors
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 158,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1236360.1236412
What is a DOI?

ABSTRACT

FlashDB is a self-tuning database optimized for sensor networks using NAND flash storage. In practical systems flash is used in different packages such as on-board flash chips, compact flash cards, secure digital cards and related formats. Our experiments reveal non-trivial differences in their access costs. Furthermore, databases may be subject to different types of workloads. We show that existing databases for flash are not optimized for all types of flash devices or for all workloads and their performance is thus suboptimal in many practical systems. FlashDB uses a novel self-tuning index that dynamically adapts its storage structure to workload and underlying storage device. We formalize the self-tuning nature of an index as a two-state task system and propose a 3-competitive online algorithm that achieves the theoretical optimum. We also provide a framework to determine the optimal size of an index node that minimizes energy and latency for a given device. Finally, we propose optimizations to further improve the performance of our index. We prototype and compare different indexing schemes on multiple flash devices and workloads, and show that our indexing scheme outperforms existing schemes under all workloads and flash devices we consider.


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
AZAR, Y., FEIGE, U., AND NATH, S. On the work function algorithm for two state task systems. Tech. Rep. MSR-TR-2007-20, Microsoft Corporation, February 2007.
 
2
BLACK, D. L., AND SLEATOR, D. D. Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201, Carnegie Mellon University, 1989.
3
 
4
BURKE, J., ESTRIN, D., HANSEN, M., PARKER, A., RAMANATHAN, N., REDDY, S., AND SRIVASTAVA, M. B. Participatory sensing. In ACM Sensys Workshop on World-Sensor-Web (2006).
5
6
 
7
DIAO, Y., GANESAN, D., MATHUR, G., AND SHENOY, P. Re-thinking data management for storage-centric sensor networks. In Third Biennial Conference on Innovative Data Systems Research (CIDR), Asilomar (January 2007).
8
9
10
 
11
INTEL. Intel mote 2. http://www.intel.com/research/downloads/imote overview.pdf.
 
12
KANSAL, A., XIAO, L., AND ZHAO, F. Relevance metrics for coverage extension using community collected cell-phone camera imagery. In ACM Sensys Workshop on World-Sensor-Web: Mobile Device Centric Sensor Networks and Applications (October 2006), pp. 12--16.
 
13
14
 
15
MICROSOFT. "sql server 2005 everywhere edition". http://www.microsoft.com/sql/ctp sqlserver2005everywhereedition.mspx.
 
16
NATH, S., AND KANSAL, A. Flashdb: Dynamic self-tuning database for nand flash. Tech. Rep. MSR-TR-2006-168, Microsoft Corporation, 2006.
 
17
18
 
19
SAMSUNG. Samsung K9K1G08R0B 128M x 8 bit NAND Flash Memeory.
 
20
 
21
WU, C.-H., CHANG, L.-P., AND KUO, T.-W. An efficient b-tree layer for flash-memory storage systems. In RTCSA (2003).
 
22
23

CITED BY  16