Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates
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
Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Efficient Monitoring of Moving Mobile Device Range Queries using Dynamic Safe Regions
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
| Hi-index | 0.00 |
In recent years, the research community has introduced various methods for processing spatio-temporal queries in road networks. In this paper, we present a novel type of spatio-temporal queries, named the continuous min-max distance bounded query (or CM2DBQ for short). Given a moving query object q, a minimal distance dm, and a maximal distance dM, a CM2DBQ retrieves the bounded objects whose road distances to q are within the range [dm, dM] at each time instant. The CM2DBQ is indeed an important query with many real applications. We address the problem of processing the CM2DBQ and propose two algorithms, named the Continuous Within Query-based (CWQ-based) algorithm and the CM2DBQ algorithm, to efficiently determine the bounded objects at each time instant. Extensive experiments using real road network dataset demonstrate the efficiency of the proposed algorithms.