TinyDB: An acquisitional query processing system for sensor networks

被引:856
作者
Madden, SR
Franklin, MJ
Hellerstein, JM
Hong, W
机构
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
[2] Univ Calif Berkeley, Berkeley, CA 94720 USA
[3] Intel Res, Berkeley, CA 94704 USA
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2005年 / 30卷 / 01期
关键词
experimentation; performance; query processing; sensor networks; data acquisition;
D O I
10.1145/1061318.1061322
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices.
引用
收藏
页码:122 / 173
页数:52
相关论文
共 59 条
[21]  
Gay D, 2003, P ACM SIGPLAN 2003 C
[22]  
Gehrke J., 2001, P ACM SIGMOD C MAN D
[23]  
Hanson MR, 1996, PLANT CELL, V8, P1
[24]  
HELLERSTEIN J, 2003, P 1 WORKSH INF PROC
[25]   Optimization techniques for queries with expensive methods [J].
Hellerstein, JM .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1998, 23 (02) :113-157
[26]  
HELLERSTEIN JM, 2000, IEEE DATA ENG B, V23, P7
[27]  
HILL J, 2000, P ASPLOS
[28]   ON THE OPTIMAL NESTING ORDER FOR COMPUTING N-RELATIONAL JOINS [J].
IBARAKI, T ;
KAMEDA, T .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (03) :482-502
[29]  
IMIELINSKI T, 1992, P VLDB VANC BC CAN
[30]  
INTANAGONWIWAT C, 2000, P MOBICOM BOST MA