An effective kNN search protocol in wireless broadcast environments

Authors:
Shu-Yu Fu;Chuan-Ming Liu
Affiliations:
National Taipei University of Technology, Taipei, Taiwan;National Taipei University of Technology, Taipei, Taiwan
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 12
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods

ACM Computing Surveys (CSUR)
Efficient algorithms for scheduling data broadcast

Wireless Networks
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
Query Processing in Broadcasted Spatial Index Trees

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Broadcasting and blocking large data sets with an index tree

Broadcasting and blocking large data sets with an index tree
Energy efficient exact kNN search in wireless broadcast environments

Proceedings of the 12th annual ACM international workshop on Geographic information systems
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services

The VLDB Journal — The International Journal on Very Large Data Bases
Broadcasting and querying multi-dimensional index trees in a multi-channel environment

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data broadcasting provides an effective way to disseminate information in a wireless mobile environment. How to provide the service of k nearest neighbors (kNN) search using data broadcasting is studied in this paper. Given a data set D and a query point p, the kNN search finds k data points in D closest to p. By assuming that the data is indexed by an R-tree, we propose an efficient protocol for kNN search on the broadcast R-tree in terms of the tuning time which is the amount of time spent listening to the broadcast, latency which is time elapsed between issuing and termination of the query, and memory usage on the clients. We last validate the proposed protocol by experiments and present our findings.