DocumentCode
2557404
Title
Query Predicate Preprocessing in Wireless Sensor Networks
Author
Min Meng ; Hui Xu ; Byeong-Soo Jeong ; Sungyoung Lee
Author_Institution
Kyung Hee Univ., Suwon
fYear
2007
fDate
26-28 April 2007
Firstpage
937
Lastpage
940
Abstract
With the developments of related techniques in telecommunication and computer sciences, wireless sensor networks have been used more and more widely. While sensor nodes in wireless sensor networks have very limited memory spaces and power. In this paper, we propose a new method to preprocess the query predicates. The size of the relational table can be further reduced using the aggregated query predicates. The reduced relational table can be stored on the sensor nodes. This may cause false positive but definitely no false negative. When the required data are sent back to the sink, we can do join operation between the real query predicate and the relational table again, and eliminate the redundant data.
Keywords
query processing; relational databases; telecommunication computing; telecommunication network routing; trees (mathematics); wireless sensor networks; aggregated query predicate preprocessing; relational table; routing tree; wireless sensor network; Computer networks; Computerized monitoring; Electronic mail; Energy efficiency; Medical services; Pervasive computing; Power engineering computing; Routing; Telecommunication computing; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia and Ubiquitous Engineering, 2007. MUE '07. International Conference on
Conference_Location
Seoul
Print_ISBN
0-7695-2777-9
Type
conf
DOI
10.1109/MUE.2007.179
Filename
4197395
Link To Document