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
Efficient query processing in geographic information systems
Efficient query processing in geographic information systems
Spatial indexing in binary decomposition and spatial bounding
Information Systems
Power efficient filtering of data on air
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Multidimensional access methods
ACM Computing Surveys (CSUR)
Power management techniques for mobile communication
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Location dependent query processing
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Exploiting location information for infostation-based hoarding
Proceedings of the 7th annual international conference on Mobile computing and networking
ACM Computing Surveys (CSUR)
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
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
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Power Conservative Multi-Attribute Queries on Data Broadcast
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exponential index: a parameterized distributed indexing scheme for data on air
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Broadcast-based spatial queries
Journal of Computer Science and Technology
An Energy-Efficient and Access Latency Optimized Indexing Scheme for Wireless Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
Adaptive data dissemination schemes for location-aware mobile services
Journal of Systems and Software - Special issue: Quality software
Research in mobile database query optimization and processing
Mobile Information Systems
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
IEEE Transactions on Computers
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
Evaluating uncertain location-based spatial queries
Proceedings of the 2008 ACM symposium on Applied computing
Proceedings of the 6th international conference on Mobile systems, applications, and services
Valid scope computation for location-dependent spatial query in mobile broadcast environments
Proceedings of the 17th ACM conference on Information and knowledge management
Managing uncertainty in location-based queries
Fuzzy Sets and Systems
VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries
Proceedings of the VLDB Endowment
A hybrid communication solution to distributed moving query monitoring systems
Electronic Commerce Research and Applications
Fast and memory-efficient NN search in wireless data broadcast
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Range and nearest neighbor query processing for mobile clients
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Indexing structures for content-based retrieval of large image databases: a review
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Air-Indexing on error prone communication channels
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Searching continuous nearest neighbors in road networks on the air
Information Systems
Hi-index | 0.00 |
Location-based services (LBSs), considered as a killer application in the wireless data market, provide information based on locations specified in the queries. In this paper, we examine the indexing issue for querying location-dependent data in wireless LBSs; in particular, we focus on an important class of queries, planar point queries. To address the issues of responsiveness, energy consumption, and bandwidth contention in wireless communications, an index has to minimize the search time and maintain a small storage overhead. It is shown that the traditional point-location algorithms and spatial index structures fail to achieve either objective or both. This paper proposes a new index structure, called D-tree, which indexes spatial regions based on the divisions that form the boundaries of the regions. We describe how to construct a binary D-tree index, how to process queries based on the D-tree, and how to page the binary D-tree. Moreover, two parameterized methods for partitioning the original space, called fixed grid assignment (FGA) and adaptive grid assignment (AGA), are proposed to enhance the D-tree. The performance of the D-tree is evaluated using both synthetic and real data sets. Experimental results show that the proposed D-tree outperforms the well-known indexes such as the {\rm{R^*{\hbox{-}}tree}}, and that both the FGA and AGA approaches can achieve different performance trade-offs between the index search time and storage overhead by fine-tuning their algorithmic parameters.