skip to main content
research-article

Efficient computation of queries on feature streams

Published:02 December 2011Publication History
Skip Abstract Section

Abstract

This article introduces the notion of virtual feature stream, a feature stream defined from a primary data stream, in which at any time only the features that are needed to compute the queries that are currently running in the system are computed.

Virtual feature streams are, in general, impossible to determine a priori, but the paper introduces an algorithm that stops the computation of features as soon as it can be proved that they are no longer needed thus generating, albeit in a roundabout and more expensive than the ideal way, a feature stream that is less expensive than the complete one to compute and safe: the queries that accept the virtual feature stream are those (and only those) that would accept the original feature stream.

References

  1. Arasu, A., Babu, S., and Widom, J. 2003. CQL: a language for continuous queries over streams and relations. In Proceedings of the International Workshop on Database Programming Languages.Google ScholarGoogle Scholar
  2. Ayad, A. and Naughton, J. 2004. Static optimization of conjunctive queries with sliding windows over infinite streams. In Proceedings of the ACM SIGACT/SIGART/SIGMOD Conference on Management of Data. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Babcock, B., Babu, S., Datar, M., and Motwani, R. 2002. Chain: operator scheduling for memory minimization in data stream systems. In Proceedings of the ACM SIGACT/SIGART/SIGMOD Conference on Management of Data. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Babu, S., Srivastava, U., and Widom, J. 2004. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Datab. Syst. 29, 3, 545--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Babu, S. and Widom, J. 2001. Continuous queries over data streams. ACM SIGMOD Record 30, 3, 109--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Carney, D., Cetintemel, U., Rasin, A., Zdonik, S. B., Cerniack, M., and Stonebraker, M. 2003. Operator scheduling in a data stream manager. VLDB J. 838--49. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chandrasekaran, S. and Franklin, M. J. 2003. PSoup: a system for streaming queries over streaming data. VLDB J. 12, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Corman, T. H., Leiserson, C. E., and Rivest, R. L. 2001. Introduction to Algorithms. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Diao, Y., Altinel, M., Franklin, M. J., Zhang, H., and Fisher, P. 2003. Path sharing and predicate evaluation for high-performance xml filtering. AMC Trans. Datab. Syst. 8, 4, 467--516. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Golab, L. and Tamer Özsu, M. 2003. Issues in data stream management. ACM Sigmod Rec. 32, 2, 5--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Green, T. J., Miklau, G., Onizuka, M., and Suciu, D. 2003. Processing xml streams with deterministic automata. In Proceedings of the 9th International Conference on Database Theory (ICDT). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Gyllstrom, D., Wu, E., Chae, H.-J., Diao, Y., Stahlberg, P., and Anderson, G. 2007. Sase: Complex event processing over streams. In Proceedings of the 3rd Biennial Conference on Innovative Data Systems Research.Google ScholarGoogle Scholar
  13. Hellerstein, J. 1998. Optimization techniques for queries with expensive methods. ACM Trans. Datab. Syst. 23, 2, 113--157. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hjelsvold, R. and Midtstraum, R. 1994. Modelling and querying video data. In Proceedings of the 20th VLDB Conference. 686--694. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Koudas, N. and Srivastava, D. 2005. Data stream query processing. In Proceedings of the 21st International Conference on Data Engineering. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Liu, B., Gupta, A., and Jain, R. 2005. A live multimedia stream querying system. In Proceedings of the International Conference on Database Engineering.Google ScholarGoogle Scholar
  17. Peleg, S. and Rom, H. 1990. Motion based segmentation. In Proceedings of the 10th International Conference on Pattern Recognition.Google ScholarGoogle Scholar
  18. Srivastava, U., Munagala, K., and Widom, J. 2005. Operator placement for in-network stream query processing. In Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Thomas, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., Springer-Verlag, Berlin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Viglas, S., Franklin, M., and Amsaleg, L. 2003. Cost based query scrambling for initial delays. In Proceedings of the 29th International Conference on Very Large Data Bases.Google ScholarGoogle Scholar

Index Terms

  1. Efficient computation of queries on feature streams

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Multimedia Computing, Communications, and Applications
          ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 7, Issue 4
          November 2011
          108 pages
          ISSN:1551-6857
          EISSN:1551-6865
          DOI:10.1145/2043612
          Issue’s Table of Contents

          Copyright © 2011 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 2 December 2011
          • Accepted: 1 March 2010
          • Revised: 1 September 2009
          • Received: 1 February 2009
          Published in tomm Volume 7, Issue 4

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!