Abstract
Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of new data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. In this paper, we argue that concurrent processing of queries (reads) and window-slides (writes) is required by data stream systems in order to allow prioritized query scheduling and improve the freshness of answers. We prove that the traditional notion of conflict serializability is insufficient in this context and define stronger isolation levels that restrict the allowed serialization orders. We also design and experimentally evaluate a transaction scheduler that efficiently enforces the new isolation levels.
This research is partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) and Communications and Information Technology Ontario (CITO).
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
Arasu, A., Widom, J.: Resource sharing in continuous sliding-window aggregates. In: Proc. VLDB Conference, pp. 336–347 (2004)
Chen, J., DeWitt, D., Tian, F., Wang, Y.: NiagaraCQ: A scalable continuous query system for Internet databases. In: Proc. SIGMOD Conference, pp. 379–390 (2000)
Golab, L., Garg, S., Özsu, M.T.: On indexing sliding windows over online data streams. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 712–729. Springer, Heidelberg (2004)
Shivakumar, N., García-Molina, H.: Wave-indices: indexing evolving databases. In: Proc. SIGMOD Conference, pp. 381–392 (1997)
Zhu, Y., Shasha, D.: StatStream: Statistical monitoring of thousands of data streams in real time. In: Proc. VLDB Conference, pp. 358–369 (2002)
Abadi, D., et al.: Aurora: A new model and architecture for data stream management. VLDB Journal 12, 120–139 (2003)
Arasu, A., Babu, S., Widom, J.: The CQL continuous query language: Semantic foundations and query execution. VLDB Journal 14 (2005)(to appear)
Chandrasekaran, S., et al.: TelegraphCQ: Continuous dataflow processing for an uncertain world. In: Proc. CIDR Conference, pp. 269–280 (2003)
Golab, L., Özsu, M.T.: Update-pattern aware modeling and processing of continuous queries. In: Proc. SIGMOD Conference, pp. 658–669 (2005)
Golab, L., Bijay, K.G., Özsu, M.T.: On concurrency control in sliding window queries over data streams. University of Waterloo Technical Report CS-2005-28., Available at http://www.cs.uwaterloo.ca/research/tr/cs-2005-28.pdf
Cormode, G., Muthukrishnan, S.M.: An improved data stream summary: The count-min sketch and its applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 29–38. Springer, Heidelberg (2004)
Flajolet, P., Martin, G.N.: Probabilistic counting. In: Proc. FOCS Conference, pp. 76–82 (1983)
Bernstein, P., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)
Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78–101 (1966)
Cormode, G., et al.: Holistic UDAFs at streaming speeds. In: Proc. SIGMOD Conference, pp. 35–46 (2004)
Cranor, C., Johnson, T., Spatscheck, O., Shkapenyuk, V.: Gigascope: High performance network monitoring with an SQL interface. In: Proc. SIGMOD Conference, pp. 647–651 (2003)
Chandrasekaran, S., Franklin, M.: PSoup: a system for streaming queries over streaming data. VLDB Journal 12, 140–156 (2003)
Golab, L., Özsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: Proc. VLDB Conference, pp. 500–511 (2003)
Weikum, G., Vossen, G.: Transactional Information Systems. In: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kauffman, San Francisco (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golab, L., Bijay, K.G., Özsu, M.T. (2006). On Concurrency Control in Sliding Window Queries over Data Streams. In: Ioannidis, Y., et al. Advances in Database Technology - EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 3896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11687238_37
Download citation
DOI: https://doi.org/10.1007/11687238_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32960-2
Online ISBN: 978-3-540-32961-9
eBook Packages: Computer ScienceComputer Science (R0)