On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
IEEE Transactions on Computers
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Personalization of Queries in Database Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Personalized Queries under a Generalized Preference Model
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Flexible time management in data stream systems
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient Continuous Skyline Computation
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
RTSTREAM: Real-Time Query Processing for Data Streams
ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
Branch-and-bound processing of ranked queries
Information Systems
Introduction to Information Retrieval
Introduction to Information Retrieval
| Hi-index | 0.00 |
Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of any priorities concerning delivery of results in mission-critical mobile applications. Query prioritization could be assigned either explicitly after users' preferences or implicitly by the processing engine itself to better regulate system load. In this work, we specifically examine priority-based evaluation of ranked continuous range queries against locations of moving objects streaming into a central processor. We define a versatile model with alternative scoring functions for deciding evaluation strategies adaptable to the relative importance of queries and the current distribution of objects. We also propose a processing mechanism enhanced with ranked priorities, which exploits shared computation and enables critical requests to receive response more frequently than less demanding ones. A comprehensive experimental study with performance results offers concrete evidence that such a scheme is capable of efficiently handling numerous moving queries of varying priorities and spatial extents with minimal system overhead.