Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Ultra-low power data storage for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Capsule: an energy-optimized object storage system for memory-constrained sensor devices
Proceedings of the 4th international conference on Embedded networked sensor systems
Efficient indexing data structures for flash-based sensor devices
ACM Transactions on Storage (TOS)
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
μ-tree: an ordered index structure for NAND flash memory
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Online maintenance of very large random samples on flash storage
Proceedings of the VLDB Endowment
PowerTOSSIM z: realistic energy modelling for wireless sensor network environments
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Energy efficient sensor data logging with amnesic flash storage
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Programming storage-centric sensor networks with Squirrel
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Exploiting the Interplay between Memory and Flash Storage in Embedded Sensor Devices
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
TL-Tree: flash-optimized storage for time-series sensing data on sensor platforms
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
In this paper, we propose HybridStore, a novel efficient resource-aware data management system for flash-based sensor devices to store and query sensor data streams. HybridStore has three key features. Firstly, it takes advantage of the on-board random-accessible NOR flash in current sensor platforms to guarantee that all NAND pages used by it are fully occupied and written in a purely sequential fashion, and expensive in-place updates and out-of-place writes to an existing NAND page are completely avoided. Thus, both raw NAND flash chips and FTL-equipped (Flash Translation Layer) flash packages can be supported efficiently. Secondly, HybridStore can process typical joint queries involving both time windows and key value ranges as selection predicate extremely efficiently, even on large-scale datasets. It organizes a data stream into segments and exploits a novel index structure that consists of the inter-segment skip list, and the in-segment β-Tree and Bloom filter of each segment. Finally, HybridStore can trivially support time-based data aging without any extra overhead because no garbage collection mechanism is needed. Our implementation and evaluation with a large-scale real-world dataset in TinyOS reveals that HybridStore can achieve remarkable performance at a small cost of constructing the index.