{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T23:40:01Z","timestamp":1741563601848,"version":"3.38.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T00:00:00Z","timestamp":1315440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00778-011-0247-5","type":"journal-article","created":{"date-parts":[[2011,9,7]],"date-time":"2011-09-07T14:25:45Z","timestamp":1315405545000},"page":"721-741","source":"Crossref","is-referenced-by-count":5,"title":["Sequenced spatiotemporal aggregation for coarse query granularities"],"prefix":"10.1007","volume":"20","author":[{"given":"Igor","family":"Timko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"B\u00f6hlen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,8]]},"reference":[{"key":"247_CR1","doi-asserted-by":"crossref","unstructured":"Bayer, R.: Binary b-trees for virtual memory. In: ACM SIGFIDET, pp. 219\u2013235 (1971)","DOI":"10.1145\/1734714.1734731"},{"issue":"4","key":"247_CR2","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker B., Gschwind S., Ohler T., Seeger B., Widmayer P.: An asymptotically optimal multiversion b-tree. VLDB J. 5(4), 264\u2013275 (1996)","journal-title":"VLDB J."},{"key":"247_CR3","volume-title":"Algorithms for Klee\u2019s Rectangle Problems","author":"J.L. Bentley","year":"1977","unstructured":"Bentley J.L.: Algorithms for Klee\u2019s Rectangle Problems. Computer Science Department, Carnegie-Mellon University, Pittsburgh (1977)"},{"key":"247_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hlen M.H., Gamper J., Jensen C.S.: Multi-dimensional aggregation for temporal data. In: EDBT, pp. 257\u2013275 (2006)","DOI":"10.1007\/11687238_18"},{"issue":"2","key":"247_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T. Brinkhoff","year":"2002","unstructured":"Brinkhoff T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153\u2013180 (2002)","journal-title":"GeoInformatica"},{"key":"247_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms. 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"247_CR7","doi-asserted-by":"crossref","unstructured":"Dieker, S., G\u00fcting, R.H.: Plug and play with query algebras: SECONDO\u2014a generic DBMS development environment. In: IDEAS, pp. 380\u2013392 (2000)","DOI":"10.1109\/IDEAS.2000.880618"},{"key":"247_CR8","volume-title":"Dynamic Rectangle Intersection Searching","author":"H. Edelsbrunner","year":"1980","unstructured":"Edelsbrunner H.: Dynamic Rectangle Intersection Searching. Institute for Information Processing Rept. 47, Technical University of Graz, Austria (1980)"},{"key":"247_CR9","doi-asserted-by":"crossref","unstructured":"Geffner, S., Agrawal, D., El Abbadi, A., Smith, T.: Relative prefix sums: an efficient approach for querying dynamic olap data cubes. In: Proceedings of the ICDE-99, pp. 328\u2013335, March (1999)","DOI":"10.1109\/ICDE.1999.754948"},{"key":"247_CR10","unstructured":"Google. Google\u2019s sparsehash project. http:\/\/code.google.com\/p\/google-sparsehash\/ . Current as of December 12, (2008)"},{"key":"247_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"247_CR12","doi-asserted-by":"crossref","unstructured":"Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online aggregation. In: Proceedings of SIGMOD-97, pp. 171\u2013182 (1997)","DOI":"10.1145\/253262.253291"},{"key":"247_CR13","unstructured":"Jensen, C.S., Lee, K.-J., Pakalnis, S., \u0160altenis, S.: Advanced tracking of vehicles. In: European Congress and Exhibition on ITS, p. 12 (2005)"},{"key":"247_CR14","doi-asserted-by":"crossref","unstructured":"Kline, N., Snodgrass, R.T.: Computing temporal aggregates. In: ICDE, pp. 222\u2013231 (1995)","DOI":"10.1109\/ICDE.1995.380389"},{"issue":"2","key":"247_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/TKDE.2005.34","volume":"17","author":"I.F.V. Lopez","year":"2005","unstructured":"Lopez I.F.V., Snodgrass R.T., Moon B.: Spatiotemporal aggregate computation: a survey. IEEE Trans. Knowl. Data Eng. 17(2), 271\u2013286 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"247_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight E.M.: Priority search trees. SIAM J. Comput. 14(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"247_CR17","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/TKDE.2003.1198403","volume":"15","author":"B. Moon","year":"2003","unstructured":"Moon B., L\u00f3pez I.F.V., Immanuel V.: Efficient algorithms for large-scale temporal aggregation. IEEE Trans. Knowl. Data Eng. 15(3), 744\u2013759 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"247_CR18","doi-asserted-by":"crossref","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: SSTD, pp. 443\u2013459 (2001)","DOI":"10.1007\/3-540-47724-1_23"},{"key":"247_CR19","unstructured":"Papadias, D., Tao, Y., Kalnis, P., Zhang, J.: Indexing spatio-temporal data warehouses. In: ICDE, pp. 166\u2013175, (2002)"},{"issue":"4","key":"247_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/50020.50021","volume":"20","author":"H. Samet","year":"1988","unstructured":"Samet H.: Hierarchical representations of collections of small rectangles. ACM Comput. Surv. 20(4), 271\u2013309 (1988)","journal-title":"ACM Comput. Surv."},{"key":"247_CR21","doi-asserted-by":"crossref","unstructured":"Sun, J., Papadias, D., Tao, Y., Liu, B.: Querying about the past, the present, and the future in spatio-temporal databases. In: ICDE, pp. 202\u2013213 (2004)","DOI":"10.1109\/ICDE.2004.1319997"},{"key":"247_CR22","unstructured":"Tao, Y., Kollios, G., Considine, J., Li, F., Papadias, D.: Spatio-temporal aggregation using sketches. In: ICDE, pp. 214\u2013226 (2004)"},{"key":"247_CR23","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Zhang, J.: Aggregate processing of planar points. In: EDBT, pp. 682\u2013700 (2002)","DOI":"10.1007\/3-540-45876-X_42"},{"key":"247_CR24","unstructured":"Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. In: ICDE, pp. 51\u201360 (2001)"},{"key":"247_CR25","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/s00778-003-0107-z","volume":"12","author":"J. Yang","year":"2003","unstructured":"Yang J., Widom J.: Incremental computation and maintenance of temporal aggregates. VLDB J. 12, 262\u2013283 (2003)","journal-title":"VLDB J."},{"key":"247_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, D., Markowetz, A., Tsotras, V.J., Gunopulos, D., Seeger, B.: Efficient computation of temporal aggregates with range predicates. In: PODS, pp. 237\u2013245 (2001)","DOI":"10.1145\/375551.375600"},{"key":"247_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, D., Markowetz, A., Tsotras, V.J., Gunopulos, D., Seeger, B.: On computing temporal aggregates with range predicates. ACM Trans. Database Syst. 33(2), 12:1\u201312:39 (2008)","DOI":"10.1145\/1366102.1366109"},{"key":"247_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, D., Tsotras, V.J.: Improving min\/max aggregation over spatial objects. In: Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems, GIS \u201901, pp. 88\u201393 (2001)","DOI":"10.1145\/512178.512181"},{"key":"247_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, D., Tsotras, V.J., Gunopulos, D.: Efficient aggregation over objects with extent. In: PODS, pp. 121\u2013132 (2002)","DOI":"10.1145\/543627.543629"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0247-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0247-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0247-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T23:17:47Z","timestamp":1741562267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0247-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,8]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0247-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2011,9,8]]}}}