Computational geometry: an introduction
Computational geometry: an introduction
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 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
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A critical evaluation of location based services and their potential
Journal of Location Based Services
Towards the next generation of location-based services
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Hi-index | 0.00 |
Location-based services (LBS) constitute an emerging application domain involving spatio-temporal databases. In this paper, i) we propose a classification of LBS, depending on whether the user (query object) and the data objects are moving or not and ii) we provide algorithms for the efficient support of real applications, for every class. We also survey recent work in query processing for the proposed LBS algorithms and sketch open issues for future research.