Abstract
We consider indexing sliding windows in main memory over on-line data streams. Our proposed data structures and query semantics are based on a division of the sliding window into sub-windows. By classifying windowed operators according to their method of execution, we motivate the need for two types of windowed indices: those which provide a list of attribute values and their counts for answering set-valued queries, and those which provide direct access to tuples for answering attribute-valued queries. We propose and evaluate indices for both of these cases and show that our techniques are more efficient than executing windowed queries without an index.
This research is partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).
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
Bobineau, C., Bouganim, L., Pucheral, P., Valduriez, P.: PicoDMBS: Scaling down database techniques for the smartcard. In: VLDB 2000, pp. 11–20 (2000)
Cohen, E., Strauss, M.: Maintaining time-decaying stream aggregates. In: PODS 2003, pp. 223–233 (2003)
Das, A., Gehrke, J., Riedewald, M.: Approximate join processing over data streams. In: SIGMOD 2003, pp. 40–51 (2003)
Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. In: SODA 2002, pp. 635–644 (2002)
DeWitt, D.J., et al.: Implementation techniques for main memory database systems. In: SIGMOD 1984, pp. 1–8 (1984)
Gärtner, A., Kemper, A., Kossmann, D., Zeller, B.: Efficient bulk deletes in relational databases. In: ICDE 2001, pp. 183–192 (2001)
Golab, L., Garg, S., Özsu, M.T.: On indexing sliding windows over on-line data streams. University of Waterloo Technical Report CS-2003-29, Available at db.uwaterloo.ca/~ddbms/publications/stream/cs2003-29.pdf
Golab, L., Özsu, M.T.: Issues in data stream management. SIGMOD Record 32(2), 5–14 (2003)
Golab, L., Özsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: VLDB 2003, pp. 500–511 (2003)
Horowitz, E., Sahni, S.: Fundamentals of Data Structures. Computer Science Press, Potomac (1987)
Kang, J., Naughton, J., Viglas, S.: Evaluating window joins over unbounded streams. In: ICDE 2003 (2003)
Lehman, T.J., Carey, M.J.: Query processing in main memory database management systems. In: SIGMOD 1986, pp. 239–250 (1986)
Qiao, L., Agrawal, D., El Abbadi, A.: Supporting sliding window queries for continuous data streams. In: SSDBM 2003 (2003)
Shivakumar, N., García-Molina, H.: Wave-indices: indexing evolving databases. In: SIGMOD 1997, pp. 381–392 (1997)
Srivastava, J., Ramamoorthy, C.V.: Efficient algorithms for maintenance of large database. In: ICDE 1988, pp. 402–408 (1988)
Zhu, Y., Shasha, D.: StatStream: Statistical monitoring of thousands of data streams in real time. In: VLDB 2002, pp. 358–369 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golab, L., Garg, S., Özsu, M.T. (2004). On Indexing Sliding Windows over Online Data Streams. In: Bertino, E., et al. Advances in Database Technology - EDBT 2004. EDBT 2004. Lecture Notes in Computer Science, vol 2992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24741-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-24741-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21200-3
Online ISBN: 978-3-540-24741-8
eBook Packages: Springer Book Archive