Supporting historic queries in sensor networks with flash storage |
| |
| Affiliation: | 1. Google, Mountain View, CA, United States;2. Department of Informatics and Telecommunications, University of Athens, Athens, Greece;3. Department of Informatics, Athens University of Economics and Business, Athens, Greece;1. College of Computer Science, South‐Central University for Nationalities, Wuhan, China;2. School of Computer Science and Technology, Huazhong University of Science Technology, Wuhan, China;3. Department of Accountancy, National Cheng Kung University, Taiwan, ROC;4. College of Information and Engineering, Chang Jung Christian University, Taiwan, ROC;5. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong |
| |
| Abstract: | Many recent sensor devices are being equipped with flash memories due to their unique advantages: non-volatile storage, small size, shock-resistance, fast read access and power efficiency. The ability of storing large amounts of data in sensor devices necessitates the need for efficient indexing structures to locate required information.The challenge with flash memories is that they are unsuitable for maintaining dynamic data structures because of their specific read, write and wear constraints; this combined with very limited data memory on sensor devices prohibits the direct application of most existing indexing methods.In this paper we propose a suite of index structures and algorithms which permit us to efficiently support several types of historical online queries on flash-equipped sensor devices: temporally constrained aggregate queries, historical online sampling queries and pattern matching queries. We have implemented our methods using nesC and have run extensive experiments in TOSSIM, the simulation environment of TinyOS. Our experimental evaluation using trace-driven real world data sets demonstrates the efficiency of our indexing algorithms. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
