Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
On finding minimum routes in a network with turn penalties
Communications of the ACM
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Search K Nearest Neighbors on Air
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Techniques for Efficient Road-Network-Based Tracking of Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Proceedings of the 2006 ACM symposium on Applied computing
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Sequenced spatio-temporal aggregation in road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Indexing in-network trajectory flows
The VLDB Journal — The International Journal on Very Large Data Bases
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
A generic data model for moving objects
Geoinformatica
Spatial keyword querying of geo-tagged web content
Proceedings of the 7th International Workshop on Ranking in Databases
| Hi-index | 0.00 |
Advances in wireless communications, positioning technologies, and consumer electronics combine to enable a range of applications that use a mobile user's geo-spatial location to deliver on-line, location-enhanced services, often referred to as location-based services. This paper assumes that the service users are constrained to a transportation network, and it delves into the modeling of such networks, points of interest, and the service users with the objective of supporting location-based services. In particular, the paper presents a framework that encompasses two interrelated models--a two-dimensional, spatial representation and a multi-graph presentation. The former, high-fidelity model may be used for the positioning of content and users in the infrastructure (e.g., using map matching). The latter type of model is recognized as an ideal basis for a variety of query processing tasks, e.g., route and distance computations. Together, the two models capture central aspects of the problem domain needed in order to support the different types of queries that underlie location-based services. Notably, the framework is capable of capturing roads with lanes, lane shift and u-turn regulations, and turn restrictions. As part of the framework, the paper constructively demonstrates how it is possible map instances of the semantically rich two-dimensional model to instances of the graph model that preserve the topology of the two-dimensional model instances. In doing so, the paper demonstrates how a wealth of previously proposed query processing techniques based on graphs are applicable even in the context of complex transportation networks. The paper also presents means of compacting graphs while preserving aspects of the graphs that are important for the intended applications.