On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
TLDR
A generalized search algorithm for continuous k-nearest neighbors based on Hilbert Curve Index in wireless data broadcast systems is developed and a performance evaluation is conducted to compare the proposed search algorithms with an algorithm based on R-tree Air Index.Abstract:
A continuous nearest neighbor (CNN) search, which retrieves the nearest neighbors corresponding to every point in a given query line segment, is important for location-based services such as vehicular navigation and tourist guides. It is infeasible to answer a CNN search by issuing a traditional nearest neighbor query at every point of the line segment due to the large number of queries generated and the overhead on bandwidth. Algorithms have been proposed recently to support CNN search in the traditional client- server systems but not in the environment of wireless data broadcast, where uplink communication channels from mobile devices to the server are not available. In this paper, we develop a generalized search algorithm for continuous k-nearest neighbors based on Hilbert Curve Index in wireless data broadcast systems. A performance evaluation is conducted to compare the proposed search algorithms with an algorithm based on R-tree Air Index. The result shows that the Hilbert Curve Index-based algorithm is more energy efficient than the R-tree-based algorithm.read more
Citations
More filters
Journal ArticleDOI
Location-dependent query processing: Where we are and where we are heading
TL;DR: The technological context (mobile computing) and support middleware (such as moving object databases and data stream technology) are described, location-based services and location-dependent queries are defined and classified, and different query processing approaches are reviewed and compared.
Journal ArticleDOI
Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments
TL;DR: This paper proposes an air indexing framework that outperforms the existing techniques in terms of energy consumption while achieving low access latency and constitutes the first method supporting efficient processing of continuous spatial queries over moving objects.
Proceedings ArticleDOI
Continuous obstructed nearest neighbor queries in spatial databases
Yunjun Gao,Baihua Zheng +1 more
TL;DR: The authors' methods tackle the CONN retrieval by performing a single query for the entire query segment, and only process the data points and obstacles relevant to the final result, via a novel concept of control points and an efficient quadratic-based split point computation algorithm.
Journal ArticleDOI
Continuous visible nearest neighbor query processing in spatial databases
TL;DR: This paper identifies and solves a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search, and develops efficient algorithms for exact CVNN query processing.
Journal ArticleDOI
Spatial query processing in road networks for wireless data broadcast
TL;DR: This paper proposes a novel index for spatial queries in wireless broadcast environments (ISW), and efficient algorithms are designed to cope with kNN, range and RNN queries separately based on ISW.
References
More filters
Proceedings ArticleDOI
R-trees: a dynamic index structure for spatial searching
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Book
Computational Geometry: Algorithms and Applications
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Journal ArticleDOI
Ubiquitous B-Tree
TL;DR: The major variations of the B-tree are discussed, especially the B+-tree, contrasting the merits and costs of each implementation and illustrating a general purpose access method that uses a B- tree.
Book
Space-filling curves
TL;DR: The subject of space-filling curves has generated a great deal of interest in the 100 years since the first such curve was discovered by Peano as discussed by the authors, but there have been no comprehensive treatment of the subject since Siepinsky's in 1912.
Proceedings ArticleDOI
Broadcast disks: data management for asymmetric communication environments
TL;DR: This work describes a new technique called "Broadcast Disks" for structuring the broadcast in a way that provides improved performance for non-uniformly accessed data and examines several "pure" cache management policies and develops and measure implementable approximations to these policies.