Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
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
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing histogram optimality and practicality for query result size estimation
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Performance evaluation of a wireless hierarchical data dissemination system
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Experiences of developing and deploying a context-aware tourist guide: the GUIDE project
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Using semantic caching to manage location dependent data in mobile computing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
An Enhanced Technique for k-Nearest Neighbor Queries with Non-Spatial Selection Predicates
Multimedia Tools and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data Management in Location-Dependent Information Services
IEEE Pervasive Computing
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Disseminating Updates on Broadcast Disks
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Search K Nearest Neighbors on Air
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Indexed Sequential Data Broadcasting in Wireless Mobile Computing
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Performance evaluation of spatio-temporal selectivity estimation techniques
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Adaptive data dissemination schemes for location-aware mobile services
Journal of Systems and Software - Special issue: Quality software
An effective kNN search protocol in wireless broadcast environments
Proceedings of the 2007 ACM symposium on Applied computing
A power-saving protocol for exact GkNN search in wireless broadcast environments
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
An efficient data dissemination scheme for spatial query processing
Journal of Computer Science and Technology
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Fast and memory-efficient NN search in wireless data broadcast
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Energy-efficient shortest path query processing on air
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Effective low-latency k-nearest neighbor search via wireless data broadcast
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Air-Indexing on error prone communication channels
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
Hi-index | 0.00 |
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies like GPS, this opens up an exciting domain of location based services, allowing a mobile user to query for objects based on its current position. Main bottlenecks in such infrastructures are the draining of power of the mobile devices and the limited network bandwidth available. To alleviate these problems, broadcasting spatial information about relevant objects has been widely accepted as an efficient mechanism. An important class of queries for such an infrastructure is the k-nearest neighbor (kNN) queries, in which users are interested in k closest objects to their position. In this paper, we describe mechanisms to perform exact kNN search on conventional sequential-access R-trees, and optimize established kNN search algorithms. We also propose a novel use of histograms for guiding the search and derive analytical results on maximum queue size and node access count. In addition, we discuss the effects of different broadcast organizations on search performance and challenge the traditional use of Depth-First (dfs) organization. We also extend our mechanisms to support kNN search with non-spatial constraints. While we demonstrate our ideas using a broadcast index, they are equally applicable to any kind of sequential access medium like tertiary tape storage. We validate our mechanisms through an extensive experimental analysis and present our findings.