Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
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
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 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
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Spatial Join Processing Using Corner Transformation
IEEE Transactions on Knowledge and Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure
Proceedings of the Second International Symposium on Database Systems for Advanced Applications
Techniques for Design and Implementation of Efficient Spatial Access Methods
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Issues in data stream management
ACM SIGMOD Record
Spatial Query Processing for High Resolutions
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
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
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Information Sciences: an International Journal
Prefilter: predicate pushdown at streaming speeds
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
Exploiting the power of relational databases for efficient stream processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Using data correlation to build an intrusion detection system
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
A continuous spatial query processing for push-based geographic web search systems
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Enhanced stream processing in a DBMS kernel
Proceedings of the 16th International Conference on Extending Database Technology
Local correlation detection with linearity enhancement in streaming data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified into two dual categories -- data-initiative and query-initiative -- depending on whether query processing is initiated by selecting a data element or a query. Although the duality property has been widely recognized, previous data stream systems do not fully take advantages of this property since they use the two dual methods independently: data-initiative methods only for continuous queries and query-initiative methods only for ad-hoc queries. We contend that continuous query processing can be better optimized by adopting an approach that integrates the two dual methods. Our primary contribution is based on the observation that spatial join is a powerful tool for achieving this objective. In this paper, we first present a new viewpoint of transforming the continuous query processing problem to a multi-dimensional spatial join problem. We then present a continuous query processing algorithm based on spatial join, which we name Spatial Join CQ. This algorithm processes continuous queries by finding the pairs of overlapping regions from a set of data elements and a set of queries, both defined as regions in the multi-dimensional space. The algorithm achieves the advantages of the two dual methods simultaneously. Experimental results show that the proposed algorithm outperforms earlier algorithms by up to 36 times for simple selection continuous queries and by up to 7 times for sliding window join queries.