{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:53Z","timestamp":1750307153661,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Consejer\u00eda de Educaci\u00f3n de la Comunidad Aut\u00f3noma de Madrid","award":["CCG08-UAM\/TIC\/4303"],"award-info":[{"award-number":["CCG08-UAM\/TIC\/4303"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2011,11]]},"abstract":"<jats:p>\n            This article introduces the notion of\n            <jats:italic>virtual feature stream<\/jats:italic>\n            , 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.\n          <\/jats:p>\n          <jats:p>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.<\/jats:p>","DOI":"10.1145\/2043612.2043616","type":"journal-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T19:05:23Z","timestamp":1323198323000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient computation of queries on feature streams"],"prefix":"10.1145","volume":"7","author":[{"given":"Simone","family":"Santini","sequence":"first","affiliation":[{"name":"Universidad Aut\u00f3noma de Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"volume-title":"Proceedings of the International Workshop on Database Programming Languages.","author":"Arasu A.","key":"e_1_2_1_1_1","unstructured":"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."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007616"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872789"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016028.1016032"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/603867.603884"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","unstructured":"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.","DOI":"10.5555\/1315451.1315523"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0096-y"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Corman T. H. Leiserson C. E. and Rivest R. L. 2001. Introduction to Algorithms. MIT Press Cambridge MA.","DOI":"10.5555\/580470"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/776985.776986"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656444"},{"volume-title":"Proceedings of the 3rd Biennial Conference on Innovative Data Systems Research.","author":"Gyllstrom D.","key":"e_1_2_1_12_1","unstructured":"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."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/292481.277627"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672818"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.43"},{"volume-title":"Proceedings of the International Conference on Database Engineering.","author":"Liu B.","key":"e_1_2_1_16_1","unstructured":"Liu, B., Gupta, A., and Jain, R. 2005. A live multimedia stream querying system. In Proceedings of the International Conference on Database Engineering."},{"volume-title":"Proceedings of the 10th International Conference on Pattern Recognition.","author":"Peleg S.","key":"e_1_2_1_17_1","unstructured":"Peleg, S. and Rom, H. 1990. Motion based segmentation. In Proceedings of the 10th International Conference on Pattern Recognition."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065199"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"volume-title":"Proceedings of the 29th International Conference on Very Large Data Bases.","author":"Viglas S.","key":"e_1_2_1_20_1","unstructured":"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."}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043612.2043616","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2043612.2043616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:18Z","timestamp":1750240458000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043612.2043616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["10.1145\/2043612.2043616"],"URL":"https:\/\/doi.org\/10.1145\/2043612.2043616","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2011,11]]},"assertion":[{"value":"2009-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}