ACM Home Page
Please provide us with feedback. Feedback
Efficient indexing data structures for flash-based sensor devices
Full text PdfPdf (1.45 MB)
Source ACM Transactions on Storage (TOS) archive
Volume 2 ,  Issue 4  (November 2006) table of contents
Pages: 468 - 503  
Year of Publication: 2006
ISSN:1553-3077
Authors
Song Lin  University of California, Riverside, CA
Demetrios Zeinalipour-Yazti  University of Cyprus, Nicosia, Cyprus
Vana Kalogeraki  University of California, Riverside, CA
Dimitrios Gunopulos  University of California, Riverside, CA
Walid A. Najjar  University of California, Riverside, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 307,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: 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/1210596.1210601
What is a DOI?

ABSTRACT

Flash memory is the most prevalent storage medium found on modern wireless sensor devices (WSDs). In this article we present two external memory index structures for the efficient retrieval of records stored on the local flash memory of a WSD. Our index structures, MicroHash and MicroGF (micro grid files), exploit the asymmetric read/write and wear characteristics of flash memory in order to offer high-performance indexing and searching capabilities in the presence of a low-energy budget, which is typical for the devices under discussion. Both structures organize data and index pages on the flash media using a sorted by timestamp file organization. A key idea behind these index structures is that expensive random access deletions are completely eliminated. MicroHash enables equality searches by value in constant time and equality searches by timestamp in logarithmic time at a small cost of storing index pages on the flash media. Similarly, MicroGF enables spatial equality and proximity searches in constant time. We have implemented these index structures in nesC, the programming language of the TinyOS operating system. Our trace-driven experimentation with several real datasets reveals that our index structures offer excellent search performance at a small cost of constructing and maintaining the index.


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
ATMO 2005. Live from Earth and Mars project. University of Washington, Seattle. http://www-k12.atmos.washington.edu/k12/grayskies/.
 
2
Banerjee, A., Mitra, A., Najjar, W., Zeinalipour-Yazti, D., Kalogeraki, V., and Gunopulos, D. 2005. Rise co-s : High performance sensor storage and co-processing architecture. In Proceedings of the 2nd Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks.
 
3
Crossbow. 2005. Crossbow Technology, Inc. http://www.xbow.com/.
4
5
6
 
7
8
9
10
 
11
Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., and Shenker, S. 2003. Difs: A distributed index for features in sensor networks. In Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications.
12
13
 
14
Jensen, C., Lahrmann, H., Pakalnis, S., and Runge, J. 2005. The infati data. Time Center.
15
16
 
17
Litwin, W. 1980. Linear hashing: A new tool for file and table addressing. In 6th International Conference on Very Large Data Bases. 212--223.
 
18
19
20
 
21
Neema, S., Mitra, A., Banerjee, A., Najjar, W., Zeinalipour-Yazti, D., Gunopulos, D., and Kalogeraki, V. 2005. Nodes: A novel system design for embedded sensor networks. In Proceedings of the Internatonal IEEE Conference on Information Processing in Sensor Networks (IPSN).
22
23
 
24
Polastre, J. 2003. Design and implementation of wireless sensor networks for habitat monitoring. Master's Thesis. University of California, Berkeley.
 
25
26
27
 
28
Sandisk 2006. Sandisk flash memory cards---Wear leveling. http://sandisk.com/pdf/oem/WPaperWearLevelv1.0.pdf.
 
29
30
31
32
 
33
 
34
 
35
Whang, K. and Krishnamurthy, R. 1985. Multilevel grid files. Res. Rep. RC11516, IBM, Yorktown Heights, New York.
 
36
Woodhouse, D. 2006. Jffs: The journalling flash file system. http://sources.redhat.com/jffs2/jffs2.pdf.
 
37
Wookey. 2006. Yaffs - A filesystem designed for nand flash. In Linux Conference of Tutorials. Leeds, UK.
 
38
Wu, C., Chang, L., and Kuo, T. 2003a. An efficient b-tree layer for flash memory storage systems. In the 9th International Conference on Real-Time and Embedded Computing Systems and Applications.
39
40
 
41
Yao, Y. and Gehrke, J. 2003. Query processing in sensor networks. In Conference on Innovative Data Systems Research.
 
42
Zeinalipour-Yazti, D., Lin, S., Kalogeraki, V., Gunopulos, D., and Najjar, W. 2005. Microhash: An efficient index structure for flash-based sensor devices. In Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST). 31--44.
 
43
Zeinalipour-Yazti, D., Neema, S., Gunopulos, D., Kalogeraki, V., and Najjar, W. 2005. Data acquision in sensor networks with large memories. In 1st IEEE International Workshop on Networking Meets Databases (NetDB).
44


Collaborative Colleagues:
Song Lin: colleagues
Demetrios Zeinalipour-Yazti: colleagues
Vana Kalogeraki: colleagues
Dimitrios Gunopulos: colleagues
Walid A. Najjar: colleagues