The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
iTopN: incremental extraction of the N most visible objects
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Journal of Computer Science and Technology
Estimating the result size of a query to velocity skewed moving objects
Information Processing Letters
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A cost model for spatio-temporal queries using the TPR-tree
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
GPAC: generic and progressive processing of mobile queries over mobile data
Proceedings of the 6th international conference on Mobile data management
Proceedings of the 6th international conference on Mobile data management
Context-based Preference Analysis Method in Ubiquitous Commerce
UDM '05 Proceedings of the International Workshop on Ubiquitous Data Management
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
Continuous Skyline Queries for Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Towards optimal continuous nearest neighbor queries in spatial databases
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
An OLAP system for network-constrained moving objects
Proceedings of the 2007 ACM symposium on Applied computing
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
IEEE Transactions on Mobile Computing
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient k-nearest-neighbor search algorthims for historical moving object trajectories
Journal of Computer Science and Technology
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
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
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient KNN processing over moving objects with uncertain velocity
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient Maintenance of Continuous Queries for Trajectories
Geoinformatica
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Predictive Join Processing between Regions and Moving Objects
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Valid scope computation for location-dependent spatial query in mobile broadcast environments
Proceedings of the 17th ACM conference on Information and knowledge management
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A query processor for prediction-based monitoring of data streams
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Continuous monitoring of nearest neighbors on land surface
Proceedings of the VLDB Endowment
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
Proceedings of the 13th International Conference on Extending Database Technology
Efficient mutual nearest neighbor query processing for moving object trajectories
Information Sciences: an International Journal
Efficient algorithms for historical continuous kNN query processing over moving object trajectories
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Continuous K-nearest neighbor queries for moving objects
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Circulartrip: an effective algorithm for continuous kNN queries
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
An improved spatio-temporal index structure for predictive queries
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Incremental approach for Continuous k-Nearest Neighbours queries on road
International Journal of Intelligent Information and Database Systems
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal — The International Journal on Very Large Data Bases
Path prediction and predictive range querying in road network databases
The VLDB Journal — The International Journal on Very Large Data Bases
A motion-aware approach for efficient evaluation of continuous queries on 3D object databases
The VLDB Journal — The International Journal on Very Large Data Bases
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient k-nearest neighbor search on moving object trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Scalable processing of continuous K-nearest neighbor queries with uncertain velocity
Expert Systems with Applications: An International Journal
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic time consistent queries over moving objects
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Approximate continuous K-nearest neighbor queries for uncertain objects in road networks
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Towards real-time processing of monitoring continuous k-nearest neighbor queries
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Exploring dynamic fan shapes for nearby traffic monitoring queries in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Closest pair queries with spatial constraints
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
GAMMA: a framework for moving object simulation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Nearest neighbor search on moving object trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Incremental rank updates for moving query points
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Dynamic range query in spatial network environments
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
BFPkNN: an efficient k-nearest-neighbor search algorithm for historical moving object trajectories
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
Continuous min-max distance bounded query in road networks
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Efficient safe-region construction for moving top-K spatial keyword queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Panda: a predictive spatio-temporal query processor
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Moving spatial keyword queries: Formulation, methods, and analysis
ACM Transactions on Database Systems (TODS)
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Hi-index | 0.00 |
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current motion of the query and the database objects, and (iii) the change that causes the expiration of the result. Due to the highly dynamic nature of several spatio-temporal applications, TP queries are important both as standalone methods, as well as building blocks of more complex operations. However, little work has been done towards their efficient processing. In this paper, we propose a general framework that covers time-parameterized variations of the most common spatial queries, namely window queries, k-nearest neighbors and spatial joins. In particular, each of these TP queries is reduced to nearest neighbor search where the distance functions are defined according to the query type. This reduction allows the application and extension of well-known branch and bound techniques to the current problem. The proposed methods can be applied with mobile queries, mobile objects or both, given a suitable indexing method. Our experimental evaluation is based on R-trees and their extensions for dynamic objects.