Abstract
Continual Queries (CQs) are persistent queries that are issued once and then are run at regular intervals or when source data change until a termination condition is satisfied. Users receive new information automatically as it becomes available. CQs systems need to support a large number of CQs due to the scale of the Internet. This paper describes a novel architecture for a CQs system that scales to a large number of queries. In this system CQs are evaluated locally on the CQ server without accessing base relations after initial evaluation. Only group queries are run to retrieve auxiliary data. We optimize the retrieval of auxiliary data. A performance evaluation shows that the architecture reduces data transmission and I/O costs.
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.
References
S. Babu and J. Widom. Continuous queries over data streams. SIGMOD Record, 30(3):109–120, Sep. 2001.
D. Barbara. The characterization of continuous queries. Int. J. of Cooperative Information Systems, 8(4):295–323, Dec. 1999.
P. Bernstein et al. The asilomer report on database research. SIGMOD Record, 27(4), Dec. 1998.
S. Ceri, R. Cochrane, and J. Widom. Practical applications of triggers and constraints: Successes and lingering issues. In Proc. of Int. Con. VLDB’ 2000, pp 254–262, Cairo, Egypt, Sep. 2000.
J. Chen, D. DeWitt, et al. NiagaraCQ: A scalable continuous query system for Internet Databases. In Proc. of Int. Con. ACM SIGMOD’ 2000, pp 379–390, Dallas, USA, May 2000.
H. Garcia-Molina, J.D. Ullman, and J. Widom. Database System Implementation. Prentice Hall Inc. 1st edn, 2000.
S. Khan and P. Mott. LeedsCQ: A scalable continual queries system. Tech. report 2002.03, School of Computing, Uni. of Leeds, Leeds, LS2 9JT, UK, Feb. 2002.
S. Khan and P. Mott. Differential evaluation of continual queries. Tech. report 2001.11, School of Computing, Uni. of Leeds, Leeds, LS2 9JT, UK, May 2001.
S. Khan and P. Mott. Scalable and dynamic grouping of continual queries. Tech. report 2001.17, School of Computing, Uni. of Leeds, Leeds, LS2 9JT, UK, Sep. 2001.
J L. Liu, C. Pu, et al. Differential evaluation of continual queries. In Proc. of Int. Con. ICDCS’ 96, pp 458–465, Hong Kong, May 1996.
L. Liu, C. Pu, and W. Tang. Continual queries for Internet scale event-driven information delivery. IEEE Trans, on Knowledge and Data Engineering, ll(4):610–628, July/Aug. 1999.
D. Quass, A. Gupta, I.S. Mumick, and J. Widom. Making views self-maintainable for data warehousing. In Proc. of Int. Con. on Parallel and Distributed Information Systems, ppl58–169, Florida, USA, Dec. 1996.
P. Roy, S. Seshadri, et al. Efficient and extensible algorithms for multi query optimization. In Proc. of Int. Con. ACM SIGMOD’ 2000, pp 249–260, Dallas, USA, May 2000.
T.K. Sellis. Multiple-Query Optimization. ACM Trans, on Database Systems, 13:(l)23–52, March 1988.
A. Swami and K.B. Schiefer. On the estimation of join result size. In Proc. of Int. Con. EDBT’ 94, LNCS, Vol.779, pp 287–300, Cambridge, UK, March 1994.
D. Terry, D. Goldberg, et al. Continuous queries over append-only databases. In Proc. of Int. Con. ACM SIGMOD’92, pp 321–330, San Diego, USA, Jan. 1992.
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). LeedsCQ: A Scalable Continual Queries System. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_60
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive