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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
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
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Search K Nearest Neighbors on Air
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
EcoTop: an economic model for dynamic processing of top-k queries in mobile-P2P networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Monitoring reverse top-k queries over mobile devices
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Combining top-k query in road networks
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
| Hi-index | 0.00 |
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial specifications for data objects in the wireless broadcasting system. We introduce two methods for processing location based top-k queries on the broadcast stream. In the first method, the search algorithm runs on the broadcast aggregate R-tree (aR-tree). However, the aR-tree may deteriorate the search performance, especially in terms of the tuning time. With this problem in mind, we propose a novel index structure, called the bit-vector R-tree (bR-tree), which stores additional bit-vector information to facilitate processing of location based top-k queries. The search algorithm on the broadcast bR-tree is also described. Our simulation experiments demonstrate that the bR-tree method clearly outperforms the aR-tree method in terms of the tuning time, while maintaining similar or better performance in terms of the access time.