Abstract
Continual Queries (CQs) allow users to receive new information as it becomes available. CQsystems 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 CQgrouping 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.M. Chen and N. Roussopoulos. The implementation and performance evaluation of the ADMS query optimizer: Integrating query result caching and matching, Tech. rep. TR-3159, Dep. of Comp. Sci., Uni. of Maryland, College Park, Oct. 1993.
C.M. Chen and N. Roussopoulos. The implementation and performance evaluation of the ADMS query optimizer: Integrating query result caching and matching, EDBT, LNCS-779, p. 323–336, UK, Mar. 1994.
J. Chen, D. DeWitt, et al. NiagaraCQ: A scalable continuous query system for Internet databases. SIGMOD, p. 379–390, Dallas, USA, May 2000.
H. Gupta. Selection of views to materialise in a data warehouse. ICDT, LNSC-1186, p. 98–112, Delphi, Greece, Jan. 1997.
M. Jarke and J. Koch. Query optimisation in database systems. Comp. Surveys, 16(2):111–152, June 1984.
S. Khan and P. Mott. Scalable and dynamic grouping of continual queries. Tech. rep. 2001.17, Sch. of Comp., Uni. of Leeds, Leeds, UK, Sept. 2001.
S. Khan and P. Mott. LeedsCQ: A scalable continual queries system. DEXA, Aixen Provence, France, Sept. 2002.
Y. Kotidis and Roussopoulos. Dynamat: A dynamic view management system for data warehouses. SIGMOD, p. 371–382, USA, June 1999.
P.A. Larson and Y.Z. Yang. Computing queries from derived relations. VLDB, p. 259–269, Sweden, Aug. 1985.
D. Lee and W.W. Chu. Semantic caching via query matching for Web sources. ACM CIKM, p. 77–85, Kansas City, USA, Nov. 1999.
L. Liu, C. Pu, et al. Differential evaluation of continual queries. ICDCS, p. 458–465, Hong Kong, May 1996.
L. Liu, C. Pu and W. Tang. Continual queries for Internet scale event-driven information delivery. IEEE TKDE, 11(4):610–628, July/Aug. 1999.
L. Liu, C. Pu, et al. Conquer: A continual query system for update monitoring in the www. Comput. Syst. Sci. and Eng., 11(4):99–112, Mar 1999.
M.V. Mannino, P. Chu and T. Sager. Statistical profile estimation in database systems. ACM Comp. Surveys, 20(3):191–221, Sep. 1988.
N. J. Nilsson. Principles of Artificial Intelligence. 1st edn 1980.
P. Roy, S. Seshadri, et al. Efficient and extensible algorithms for multi query optimisation. SIGMOD, p. 249–260, Texas, May 2000.
S. Samtani, V. Kumar and M. Mohania. Self-maintenance of multiple views in data warehousing. CIKM, p. 292–299, Kansas City, USA, Nov. 1999.
T.K. Sellis. Multiple-query optimisation. ACM TDS, 13(1):23–52, Mar.1988.
D. Theodoratos and T. Sellis. Data warehousing configuration. VLDB, p. 126–135, Athens, Greece, Aug. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khan, S., Mott, P.L. (2002). Scalable and Dynamic Grouping of Continual Queries. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive