Dataflow query execution in a parallel main-memory environment
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
Ripple joins for online aggregation
SIGMOD '99 Proceedings of the 1999 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
Characterizing memory requirements for queries over continuous data streams
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic Pipeline Scheduling for Improving Interactive Query Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Exploiting Punctuation Semantics in Continuous Data Streams
IEEE Transactions on Knowledge and Data Engineering
Fjording the Stream: An Architecture for Queries Over Streaming Sensor Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Dynamic plan migration for continuous queries over data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Exploiting k-constraints to reduce memory overhead in continuous queries over data streams
ACM Transactions on Database Systems (TODS)
Scheduling for shared window joins over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Processing sliding window multi-joins in continuous queries over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
CAPE: continuous query engine with heterogeneous-grained adaptivity
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Querying sliding windows over online data streams
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Foundations and Trends in Databases
Out-of-order processing: a new architecture for high-performance stream systems
Proceedings of the VLDB Endowment
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
Tagging stream data for rich real-time services
Proceedings of the VLDB Endowment
Transformation of continuous aggregation join queries over data streams
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Optimizing adaptive multi-route query processing via time-partitioned indices
Journal of Computer and System Sciences
FENCE: continuous access control enforcement in dynamic data stream environments
Proceedings of the third ACM conference on Data and application security and privacy
Hi-index | 0.00 |
We explore join optimizations in the presence of both time-based constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named PWJoin that exploits such combined constraints to shrink the runtime join state and to propagate punctuations to benefit downstream operators. We design a state structure for PWJoin that facilitates the exploitation of both constraint types. We also explore optimizations enabled by the interactions between window and punctuation, e.g., early punctuation propagation. The costs of the PWJoin are analyzed using a cost model. We also conduct an experimental study using CAPE continuous query system. The experimental results show that in most cases, by exploiting punctuations, PWJoin outperforms the pure window join with regard to both memory overhead and throughput. Our technique complements the joins in the literature, such as symmetric hash join or window join, to now require less runtime resources without compromising the accuracy of the result.