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.
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Babu, S. and Widom, J. 2001. Continuous queries over data streams. ACM SIGMOD Record 30, 3, 109--120. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- Chandrasekaran, S. and Franklin, M. J. 2003. PSoup: a system for streaming queries over streaming data. VLDB J. 12, 2. Google Scholar
Digital Library
- Corman, T. H., Leiserson, C. E., and Rivest, R. L. 2001. Introduction to Algorithms. MIT Press, Cambridge, MA. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- Golab, L. and Tamer Özsu, M. 2003. Issues in data stream management. ACM Sigmod Rec. 32, 2, 5--14. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- Hellerstein, J. 1998. Optimization techniques for queries with expensive methods. ACM Trans. Datab. Syst. 23, 2, 113--157. Google Scholar
Digital Library
- Hjelsvold, R. and Midtstraum, R. 1994. Modelling and querying video data. In Proceedings of the 20th VLDB Conference. 686--694. Google Scholar
Digital Library
- Koudas, N. and Srivastava, D. 2005. Data stream query processing. In Proceedings of the 21st International Conference on Data Engineering. Google Scholar
Digital Library
- Liu, B., Gupta, A., and Jain, R. 2005. A live multimedia stream querying system. In Proceedings of the International Conference on Database Engineering.Google Scholar
- Peleg, S. and Rom, H. 1990. Motion based segmentation. In Proceedings of the 10th International Conference on Pattern Recognition.Google Scholar
- 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 Scholar
Digital Library
- Thomas, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., Springer-Verlag, Berlin. Google Scholar
Digital Library
- 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 Scholar
Index Terms
Efficient computation of queries on feature streams
Recommendations
Technology of Continuous Query Optimization over Data Streams
ISISE '08: Proceedings of the 2008 International Symposium on Information Science and Engieering - Volume 02The characteristic of data stream is that it has a huge size and its data change continually, which need to be responded quickly, since the times of query is limited. The continuous query and data stream approximate query model are introduced in this ...
Query-aware partitioning for monitoring massive network data streams
SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of dataData Stream Management Systems (DSMS) are gaining acceptance for applications that need to process very large volumes of data in real time. The load generated by such applications frequently exceeds by far the computation capabilities of a single ...
Semantics and implementation of continuous sliding window queries over data streams
In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than the ...






Comments