Distributed, concurrent range monitoring of spatial-network constrained mobile objects

Authors:
Hua Lu;Zhiyong Huang;Christian S. Jensen;Linhao Xu
Affiliations:
School of Computing, National University of Singapore, Singapore and Department of Computer Science, Aalborg University, Denmark;School of Computing, National University of Singapore, Singapore and Institute for Infocomm Research, Singapore;Department of Computer Science, Aalborg University, Denmark;School of Computing, National University of Singapore, Singapore
Venue:
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Year:
2007

Citing 14
Cited 0

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
A Framework for Generating Network-Based Moving Objects

Geoinformatica
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

IEEE Transactions on Computers
Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes?

WISEW '02 Proceedings of the Third International Conference on Web Information Systems Engineering (Workshops) - (WISEw'02)
Nearest neighbor queries in road networks

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Indexing of network constrained moving objects

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
SINA: scalable incremental processing of continuous queries in spatio-temporal databases

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Indexing the Trajectories of Moving Objects in Networks*

Geoinformatica
A generic framework for monitoring continuous spatial queries over moving objects

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An efficient and scalable approach to CNN queries in a road network

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases

Proceedings of the 2006 ACM symposium on Applied computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects relevant in many applications are constrained to spatial networks. This paper addresses the problem of range monitoring of mobile objects in this setting, in which network distance is concerned. An architecture is proposed where the mobile clients and a central server share computation, the objective being to obtain scalability by utilizing the capabilities of the clients. The clients issue location reports to the server, which is in charge of data storing and query processing. The server associates each range monitoring query with the network-edge portions it covers. This enables incremental maintenance of each query, and it also enables shared maintenance of concurrent queries by identifying the overlaps among such queries. The mobile clients contribute to the query processing by encapsulating their host edge portion identifiers in their reports to the server. Extensive empirical studies indicate that the paper's proposal is efficient and scalable, in terms of both query load and moving-object load.