ACM Home Page
Please provide us with feedback. Feedback
NiagaraCQ: a scalable continuous query system for Internet databases
Full text PdfPdf (165 KB)
Source International Conference on Management of Data archive
Proceedings of the 2000 ACM SIGMOD international conference on Management of data table of contents
Dallas, Texas, United States
Pages: 379 - 390  
Year of Publication: 2000
ISBN:1-58113-217-4
Also published in ...
Authors
Jianjun Chen  Computer Sciences Department, University of Wisconsin-Madison
David J. DeWitt  Computer Sciences Department, University of Wisconsin-Madison
Feng Tian  Computer Sciences Department, University of Wisconsin-Madison
Yuan Wang  Computer Sciences Department, University of Wisconsin-Madison
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 160,   Citation Count: 198
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/342009.335432
What is a DOI?

ABSTRACT

Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment, they need to be able to support millions of queries due to the scale of the Internet. No existing systems have achieved this level of scalability. NiagaraCQ addresses this problem by grouping continuous queries based on the observation that many web queries share similar structures. Grouped queries can share the common computation, tend to fit in memory and can reduce the I/O cost significantly. Furthermore, grouping on selection predicates can eliminate a large number of unnecessary query invocations. Our grouping technique is distinguished from previous group optimization approaches in the following ways. First, we use an incremental group optimization strategy with dynamic re-grouping. New queries are added to existing query groups, without having to regroup already installed queries. Second, we use a query-split scheme that requires minimal changes to a general-purpose query engine. Third, NiagaraCQ groups both change-based and timer-based queries in a uniform way. To insure that NiagaraCQ is scalable, we have also employed other techniques including incremental evaluation of continuous queries, use of both pull and push models for detecting heterogeneous data source changes, and memory caching. This paper presents the design of NiagaraCQ system and gives some experimental results on the system's performance and scalability.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
CM86
 
DFF+98
A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu. XML-QL: A Query Langaage for XML. http://www.w3.org/TR/NOTE-xml-ql.
 
HCH+99
 
HJ94
E. N. Hanson and T. Johnson. Selection Predicate Indexing for Active Databases Using Interval Skip List. TR94-017. CIS department, University of Florida, 1994.
 
LPBZ96
 
LPT99
MD89
 
RC88
 
Sel86
T. Sellis. Multiple query optimization. ACM Transactions on Database Systems, 10(3), 1986.
SJGP90
 
SK95
 
SPAM91
TGNO92
WF89
ZDNS98

CITED BY  199

Collaborative Colleagues:
Jianjun Chen: colleagues
David J. DeWitt: colleagues
Feng Tian: colleagues
Yuan Wang: colleagues