.png){kind=icon}
.png){kind=icon}
Return
Frequent Items Computation over Uncertain Wireless Sensor Network
.png){kind=icon}
PRE
AI
DOI：10.1109/HIS.2009.156.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There is an increasing interest in uncertain and probabilistics databases arising in application domains such as sensor networks, information retrieval, mobile object data management, information extraction, and data integration. A range of different approaches have been proposed to find the frequent items in uncertain database. But there is little work on processing such query in distributed, in-network inference, such as sensor network. In sensor network, communication is the primary problem because of limited batteries. In this paper, a synopsis with minimum amount tuples is proposed, which sufficient for answering the top-k query. And this synopsis can be dynamic maintained with new tuples been added. A novel communication efficient algorithm is presented In taking advantage of this synopsis. The test results confirm the effectiveness and efficiency of our approaches.
Keywords:
Frequent items Query
Uncertain Data
Sensor network
Distributed Processin
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
H
IF:
0
Papers:
1
Citations:
0