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)
Combining fuzzy information: an overview
ACM SIGMOD Record
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
In-Route Nearest Neighbor Queries
Geoinformatica
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Location-Dependent Skyline Query
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
In location-based services, every query object usually has multiple attributes including its location in road networks. However, when making a decision to choose an object, there is probably no such an object that is best in every attribute. To have a balance among all the attributes, a monotone aggregation function can be used, in which every attribute is an independent variable of the function. To find k objects which have the minimal (maximal) values of the function is a typical combining top-k problem. In this paper, we address this problem in road network environment. To answer such a query more efficiently, we propose a novel algorithm called ATC (Access with Topology Changed). By making use of road networks' locality, the algorithm changes the networks' topology and reduces the number of data access. Extensive experiments show that our algorithm can obviously outperform existing algorithms that solve the combining top-k problem.