Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Optimal histograms for hierarchical range queries (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Eddies: continuously adaptive query processing
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
Active Database Systems: Triggers and Rules for Advanced Database Processing
Active Database Systems: Triggers and Rules for Advanced Database Processing
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
WebFilter: A High-throughput XML-based Publish and Subscribe System
Proceedings of the 27th International Conference on Very Large Data Bases
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Optimal External Memory Interval Management
SIAM Journal on Computing
PSoup: a system for streaming queries over streaming data
The VLDB Journal — The International Journal on Very Large Data Bases
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
AGILE: adaptive indexing for context-aware information filters
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Monitoring streams: a new class of data management applications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Monitoring continuous band-join queries over dynamic data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
End-to-end support for joins in large-scale publish/subscribe systems
Proceedings of the VLDB Endowment
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
An Optimization Technique for Multiple Continuous Multiple Joins over Data Streams
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Publish-subscribe services for urgent and emergency response
Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE
Probabilistic filters: A stream protocol for continuous probabilistic queries
Information Systems
| Hi-index | 0.00 |
This paper considers the problem of scalably processing a large number of continuous queries. We propose a flexible framework with novel data structures and algorithms for group-processing and indexing continuous queries by exploiting potential overlaps in query predicates. Our approach partitions the collection of continuous queries into groups based on the clustering patterns of the query ranges, and then applies specialized processing strategies to those heavily-clustered groups (or hotspots). To maintain the partition dynamically, we present efficient algorithms that maintain a nearly optimal partition in nearly amortized logarithmic time. We show how to use the hotspots to scalably process large numbers of continuous select-join and band-join queries, which are much more challenging than simple range selection queries. Experiments demonstrate that this approach can improve the processing throughput by orders of magnitude. As another application of hotspots, we show how to use them to build a high-quality histogram for intervals in linear time.