The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Computers
Proceedings of the 17th International Conference on Data Engineering
Probabilistic Optimization of Top N Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Sampling-Based Estimator for Top-k Query
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
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
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Joining ranked inputs in practice
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Continuous monitoring of skyline query over highly dynamic moving objects
MobiDE '07 Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access
Efficient top-k aggregation of ranked inputs
ACM Transactions on Database Systems (TODS)
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficiently answering top-k typicality queries on large databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
Categorical skylines for streaming data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Proceedings of the second international conference on Distributed event-based systems
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
CAM conscious integrated answering of frequent elements and top-k queries over data streams
Proceedings of the 4th international workshop on Data management on new hardware
Consistent Top-k Queries over Time
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Energy-Efficient Evaluation of Multiple Skyline Queries over a Wireless Sensor Network
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Dominant and K Nearest Probabilistic Skylines
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Finding the K highest-ranked answers in a distributed network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Top-k typicality queries and efficient query answering methods on large databases
The VLDB Journal — The International Journal on Very Large Data Bases
Answering linear optimization queries with an approximate stream index
Knowledge and Information Systems
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
Distributed and Parallel Databases
RRPS: A Ranked Real-Time Publish/Subscribe Using Adaptive QoS
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Evaluating top-k queries over incomplete data streams
Proceedings of the 18th ACM conference on Information and knowledge management
Thread cooperation in multicore architectures for frequency counting over multiple data streams
Proceedings of the VLDB Endowment
A fair assignment algorithm for multiple preference queries
Proceedings of the VLDB Endowment
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Maintenance of top-k materialized views
Distributed and Parallel Databases
Aggregate computation over data streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Supporting top-k aggregate queries over unequal synopsis on internet traffic streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
Incremental approach for Continuous k-Nearest Neighbours queries on road
International Journal of Intelligent Information and Database Systems
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient processing of exact top-k queries over disk-resident sorted lists
The VLDB Journal — The International Journal on Very Large Data Bases
The gist of everything new: personalized top-k processing over web 2.0 streams
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Ranking queries on uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
An optimal strategy for monitoring top-k queries in streaming windows
Proceedings of the 14th International Conference on Extending Database Technology
Best position algorithms for efficient top-k query processing
Information Systems
Monitoring reverse top-k queries over mobile devices
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
Getting critical categories of a data set
WAIM'11 Proceedings of the 12th international conference on Web-age information management
MTopS: scalable processing of continuous top-k multi-query workloads
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient monitoring of personalized hot news over Web 2.0 streams
Computer Science - Research and Development
Extract interesting skyline points in high dimension
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
Distributed top-k full-text content dissemination
Distributed and Parallel Databases
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
Discovery of top-k dense subgraphs in dynamic graph collections
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
Probabilistic k-skyband operator over sliding windows
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
A thin monitoring layer for top-k aggregation queries over a database
Proceedings of the 7th International Workshop on Ranking in Databases
Discovering influential data objects over time
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Using a real-time top-k algorithm to mine the most frequent items over multiple streams
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Evaluating continuous top-k queries over document streams
World Wide Web
Hi-index | 0.00 |
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in conventional databases, the existing methods are inapplicable to highly dynamic environments involving numerous long-running queries. This paper studies continuous monitoring of top-k queries over a fixed-size window W of the most recent data. The window size can be expressed either in terms of the number of active tuples or time units. We propose a general methodology for top-k monitoring that restricts processing to the sub-domains of the workspace that influence the result of some query. To cope with high stream rates and provide fast answers in an on-line fashion, the data in W reside in main memory. The valid records are indexed by a grid structure, which also maintains book-keeping information. We present two processing techniques: the first one computes the new answer of a query whenever some of the current top-k points expire; the second one partially pre-computes the future changes in the result, achieving better running time at the expense of slightly higher space requirements. We analyze the performance of both algorithms and evaluate their efficiency through extensive experiments. Finally, we extend the proposed framework to other query types and a different data stream model.