Abstract | ||
---|---|---|
Continual Queries (CQs) allow users to receive new information as it becomes available. CQ systems need to support a large number of CQs due to the scale of the Internet. One approach to this problem is to group CQs so that they share their computation on the assumption that many CQs have similar structure. Grouping queries optimizes the evaluation of the queries by executing common operations in the group of queries just once. However, traditional grouping techniques are not suitable for CQs because their grouping raises new issues. In this paper we propose a scalable and dynamic CQ grouping technique. Our grouping strategy is incremental in that it scales to a large number of queries. It also re-groups existing grouped queries dynamically to maintain the effectiveness of the groups. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1007/3-540-36077-8_4 | ADVIS |
Keywords | Field | DocType |
dynamic grouping,new issue,large number,new information,traditional grouping technique,continual queries,common operation,cq system,grouping query,dynamic cq grouping technique,grouping strategy,query optimization | Database query,Information retrieval,Computer science,Execution model,The Internet,Computation,Scalability | Conference |
Volume | ISSN | ISBN |
2457 | 0302-9743 | 3-540-00009-7 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sharifullah Khan | 1 | 40 | 11.64 |
Peter L. Mott | 2 | 13 | 2.09 |