Processing KNN Queries in Grid-Based Sensor Networks
| Autor: | Huang, Yuan-Ko |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
Computational Mathematics
Numerical Analysis Computational Theory and Mathematics spatio-temporal queries lcsh:T55.4-60.8 K-nearest neighbor queries lcsh:Industrial engineering. Management engineering spatio-temporal databases lcsh:Electronic computers. Computer science uncertainty sensor network lcsh:QA75.5-76.95 Theoretical Computer Science |
| Zdroj: | Algorithms, Vol 7, Iss 4, Pp 582-596 (2014) Algorithms Volume 7 Issue 4 Pages 582-596 |
| ISSN: | 1999-4893 |
| Popis: | Recently, developing efficient processing techniques in spatio-temporal databases has been a much discussed topic. Many applications, such as mobile information systems, traffic control system, and geographical information systems, can benefit from efficient processing of spatio-temporal queries. In this paper, we focus on processing an important type of spatio-temporal queries, the K-nearest neighbor (KNN) queries. Different from the previous research, the locations of objects are located by the sensors which are deployed in a grid-based manner. As the positioning technique used is not the GPS technique, but the sensor network technique, this results in a greater uncertainty regarding object location. With the uncertain location information of objects, we try to develop an efficient algorithm to process the KNN queries. Moreover, we design a probability model to quantify the possibility of each object being the query result. Finally, extensive experiments are conducted to demonstrate the efficiency of the proposed algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|