{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:50Z","timestamp":1759683770471,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p>\n            Computing temporal aggregates is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.) Due to the large volume of such data, performance improvements for temporal aggregate queries are critical. Previous approaches have aggregate predicates that involve only the time dimension. In this article we examine techniques to compute temporal aggregates that include key-range predicates as well (\n            <jats:italic>range-temporal aggregates<\/jats:italic>\n            ). In particular we concentrate on the SUM aggregate, while COUNT is a special case. To handle arbitrary key ranges, previous methods would need to keep a separate index for every possible key range. We propose an approach based on a new index structure called the\n            <jats:italic>Multiversion SB-Tree<\/jats:italic>\n            , which incorporates features from both the SB-Tree and the Multiversion B+--tree, to handle arbitrary key-range temporal aggregate queries. We analyze the performance of our approach and present experimental results that show its efficiency. Furthermore, we address a novel and practical variation called\n            <jats:italic>functional<\/jats:italic>\n            range-temporal aggregates. Here, the value of any record is a function over time. The meaning of aggregates is altered such that the contribution of a record to the aggregate result is proportional to the size of the intersection between the record's time interval and the query time interval. Both analytical and experimental results show the efficiency of our result.\n          <\/jats:p>","DOI":"10.1145\/1366102.1366109","type":"journal-article","created":{"date-parts":[[2008,7,2]],"date-time":"2008-07-02T12:09:19Z","timestamp":1215000559000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["On computing temporal aggregates with range predicates"],"prefix":"10.1145","volume":"33","author":[{"given":"Donghui","family":"Zhang","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Markowetz","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[{"name":"University of California, Riverside, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[{"name":"University of California, Riverside, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[{"name":"Philipps Universit\u00e4t Marburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217026"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAPD.0000028553.70337.e1"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 418--427","author":"Gendrano J.","key":"e_1_2_1_4_1","unstructured":"Gendrano , J. , Huang , B. , Rodrigue , J. , Moon , B. , and Snodgrass , R . 1999. Parallel algorithms for computing temporal aggregates . In Proceedings of International Conference on Data Engineering (ICDE). 418--427 .]] Gendrano, J., Huang, B., Rodrigue, J., Moon, B., and Snodgrass, R. 1999. Parallel algorithms for computing temporal aggregates. In Proceedings of International Conference on Data Engineering (ICDE). 418--427.]]"},{"volume-title":"Proceedings of International Conference on Database Theory (ICDT). 143--157","author":"Govindarajan S.","key":"e_1_2_1_5_1","unstructured":"Govindarajan , S. , Agarwal , P. K. , and Arge , L . 2003. CRB-Tree: An efficient indexing scheme for range-aggregate queries . In Proceedings of International Conference on Database Theory (ICDT). 143--157 .]] Govindarajan, S., Agarwal, P. K., and Arge, L. 2003. CRB-Tree: An efficient indexing scheme for range-aggregate queries. In Proceedings of International Conference on Database Theory (ICDT). 143--157.]]"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.755613"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2004.02.024"},{"volume-title":"Proceedings of International Conference on Database & Expert Systems Applications (DEXA). 1018--1030","author":"Kim J. S.","key":"e_1_2_1_8_1","unstructured":"Kim , J. S. , Kang , S. T. , and Kim , M. H . 1999. Effective temporal aggregation using point-based trees . In Proceedings of International Conference on Database & Expert Systems Applications (DEXA). 1018--1030 .]] Kim, J. S., Kang, S. T., and Kim, M. H. 1999. Effective temporal aggregation using point-based trees. In Proceedings of International Conference on Database & Expert Systems Applications (DEXA). 1018--1030.]]"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 222--231","author":"Kline N.","key":"e_1_2_1_9_1","unstructured":"Kline , N. and Snodgrass , R . 1995. Computing temporal aggregates . In Proceedings of International Conference on Data Engineering (ICDE). 222--231 .]] Kline, N. and Snodgrass, R. 1995. Computing temporal aggregates. In Proceedings of International Conference on Data Engineering (ICDE). 222--231.]]"},{"key":"e_1_2_1_10_1","unstructured":"Kline N. and Soo M. 1998. Time-IT the time-integrated testbed. ftp:\/\/ftp.cs.arizona.edu\/timecenter\/time-it-0.1.tar.gz.]]  Kline N. and Soo M. 1998. Time-IT the time-integrated testbed. ftp:\/\/ftp.cs.arizona.edu\/timecenter\/time-it-0.1.tar.gz.]]"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 145--154","author":"Moon B.","key":"e_1_2_1_11_1","unstructured":"Moon , B. , Lopez , I. , and Immanuel , V . 2000. Scalable algorithms for large temporal aggregation . In Proceedings of International Conference on Data Engineering (ICDE). 145--154 .]] Moon, B., Lopez, I., and Immanuel, V. 2000. Scalable algorithms for large temporal aggregation. In Proceedings of International Conference on Data Engineering (ICDE). 145--154.]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.93"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 190--201","author":"Tao Y.","key":"e_1_2_1_15_1","unstructured":"Tao , Y. , Papadias , D. , and Faloutsos , C . 2004. Approximate temporal aggregation . In Proceedings of International Conference on Data Engineering (ICDE). 190--201 .]] Tao, Y., Papadias, D., and Faloutsos, C. 2004. Approximate temporal aggregation. In Proceedings of International Conference on Data Engineering (ICDE). 190--201.]]"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0066-x"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 51--60","author":"Yang J.","key":"e_1_2_1_17_1","unstructured":"Yang , J. and Widom , J . 2001. Incremental computation and maintenance of temporal aggregates . In Proceedings of International Conference on Data Engineering (ICDE). 51--60 .]] Yang, J. and Widom, J. 2001. Incremental computation and maintenance of temporal aggregates. In Proceedings of International Conference on Data Engineering (ICDE). 51--60.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0107-z"},{"volume-title":"Proceedings of the International Conference on Systems, Man, and Cybernetics. 1373--1378","author":"Ye X.","key":"e_1_2_1_19_1","unstructured":"Ye , X. and Keane , J . 1997. Processing temporal aggregates in parallel . In Proceedings of the International Conference on Systems, Man, and Cybernetics. 1373--1378 .]] Ye, X. and Keane, J. 1997. Processing temporal aggregates in parallel. In Proceedings of the International Conference on Systems, Man, and Cybernetics. 1373--1378.]]"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375600"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543629"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366102.1366109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1366102.1366109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:39Z","timestamp":1750255059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366102.1366109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1145\/1366102.1366109"],"URL":"https:\/\/doi.org\/10.1145\/1366102.1366109","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2008,6]]},"assertion":[{"value":"2007-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}