Abstract | ||
---|---|---|
The iceberg join query is an important type of query which explores the relationships among the sensing data in wireless sensor network. It outputs the joined tuples whose aggregated results are above some threshold constraint. As the number of above-threshold results is often very small compared to the amount of sensing data, the iceberg join query is a challenging query in the resource-constraint sensor network. In this paper, we propose a new algorithm called SRJA for the iceberg join processing in the wireless sensor network. SRJA is output sensitive, and by "pushing" the iceberg constraint into the joining regions, it filters out large number of unsatisfied tuples, saving lots of tuple transmissions. Experiments based on simulations verify the performance efficiency of our algorithm. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/DBTA.2010.5659011 | DBTA |
Keywords | Field | DocType |
wireless sensor networks,base stations,correlation,distributed databases,distributed algorithms,wireless sensor network,sensor network,sensors,sea ice | Data mining,Base station,Wireless,Performance efficiency,Tuple,Computer science,Distributed algorithm,Iceberg,Distributed database,Wireless sensor network,Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | null |
ISBN | Citations | PageRank |
978-1-4244-6977-2 | 2 | 0.36 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
yongxuan lai | 1 | 112 | 20.24 |
林子雨 | 2 | 129 | 10.80 |
Xing Gao | 3 | 15 | 8.37 |