Exploiting k-constraints to reduce memory overhead in continuous queries over data streams

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Shivnath Babu Stanford University, Stanford, CA
Utkarsh Srivastava Stanford University, Stanford, CA
Jennifer Widom Stanford University, Stanford, CA
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 29 Issue 3, September 2004
Pages 545-580
ACM New York, NY, USA
table of contents doi>10.1145/1016028.1016032
Exploiting <i>k</i>-constraints to reduce memory overhead in continuous queries over data streams Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 28
· Downloads (cumulative): 1,032
· Citation Count: 20


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder