loading...
Query Predicate Preprocessing in Wireless Sensor Networks
Seoul, Korea April 26-April 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MUE.2007.1792007 International Conference on Mult ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Min Meng, Kyung Hee University, Suwon, South Korea
Hui Xu, Kyung Hee University, Suwon, South Korea
Byeong-Soo Jeong, Kyung Hee University, Suwon, South Korea
Sungyoung Lee, Kyung Hee University, Suwon, South Korea
Xiaobo Fan, Renmin University of China, 100872, Beijing, China
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.
Citation:
Min Meng, Hui Xu, Byeong-Soo Jeong, Sungyoung Lee, Xiaobo Fan, "Query Predicate Preprocessing in Wireless Sensor Networks," mue, pp.937-940, 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.