{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:26:14Z","timestamp":1764001574621},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"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":[[2005,4]]},"DOI":"10.1007\/s00778-004-0142-4","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T09:18:35Z","timestamp":1109150315000},"page":"170-181","source":"Crossref","is-referenced-by-count":10,"title":["Optimizing spatial Min\/Max aggregations"],"prefix":"10.1007","volume":"14","author":[{"given":"Donghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Agarwal P, Erickson J (1998) Geometric range searching and its relatives. In: Chazelle B, Goodman E, Pollack R (eds) Advances in discrete and computational geometry. American Mathematical Society, Providence, RI","DOI":"10.1090\/conm\/223\/03131"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Aoki PM (1999) How to avoid building datablades that know the value of everything and the cost of nothing. In: Proceedings of the international conference on scientific and statistical database management (SSDBM), pp 122-133","DOI":"10.1109\/SSDM.1999.787627"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Aref WG, Samet H (1990) Efficient processing of window queries in the pyramid data structure. In: ACM international symposium on principles of database systems (PODS), pp 265-272","DOI":"10.1145\/298514.298579"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"Bentley","year":"1980","unstructured":"Bentley JL (1980) Multidimensional divide-and-conquer. Commun ACM 23(4):214-229","journal-title":"Commun ACM"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM\/SIGMOD annual conference on management of data (SIGMOD), pp 322-331","DOI":"10.1145\/93605.98741"},{"key":"CR6","unstructured":"Chung C, Chun S, Lee J, Lee S (2001) Dynamic update cube for range-sum queries. In: Proceedings of the international conference on very large data bases (VLDB), pp 521-530"},{"key":"CR7","unstructured":"Chan C, Ioannidis YE (1999) Hierarchical prefix cubes for range-sum queries. In: Proceedings of the international conference on very large data bases (VLDB), pp 675-686"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Geffner S, Agrawal D, El Abbadi A (2000) The dynamic data cube. In: Proceedings of the international conference on extending database technology (EDBT), pp 237-253","DOI":"10.1007\/3-540-46439-5_17"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Geffner S, Agrawal D, El Abbadi A, Smith T (1999) Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. In: Proceedings of the international conference on data engineering (ICDE), pp 328-335","DOI":"10.1109\/ICDE.1999.754948"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Gray J, Bosworth A, Layman A, Piramish H (1996) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In: Proceedings of the international conference on data engineering (ICDE), pp 152-159","DOI":"10.1109\/ICDE.1996.492099"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM\/SIGMOD annual conference on management of data (SIGMOD), pp 47-57","DOI":"10.1145\/602259.602266"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Ho C, Agrawal R, Megiddo N, Srikant R (1997) Range queries in OLAP data cubes. In: Proceedings of the ACM\/SIGMOD annual conference on management of data (SIGMOD), pp 73-88","DOI":"10.1145\/253260.253274"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Ho CT, Agrawal R, Megiddo N, Tsay JJ (1997) Techniques for speeding up range-max queries in OLAP data cubes. IBM Research Report","DOI":"10.1145\/253260.253274"},{"key":"CR14","unstructured":"International Research Institute for Climate Prediction (2003) NOAA NCEP CPC merged analysis monthly December 2003 release (version 1). URL=http:\/\/iridl.ldeo.columbia.edu\/SOURCES\/.NOAA\/ .NCEP\/.CPC\/.Merged\\_Analysis\/.monthly\/.v0312\/"},{"key":"CR15","unstructured":"J\u00fcrgens M, Lenz HJ (1998) The R a *-tree: an improved R-tree with materialized data for supporting range queries on OLAP-data. In: International workshop on database and expert systems applications (DEXAW)"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"J\u00fcrgens M, Lenz HJ (1999) PISA: Performance models for index structures with and without aggregated data. In: Proceedings of the international conference on scientific and statistical database management (SSDBM), pp 78-87","DOI":"10.1109\/SSDM.1999.787623"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proceedings of the ACM\/SIGMOD annual conference on management of data (SIGMOD), pp 401-412","DOI":"10.1145\/375663.375718"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"Matousek","year":"1994","unstructured":"Matousek J (1994) Geometric range searching. ACM Comput Surv 26(4):421-461","journal-title":"ACM Comput Surv"},{"key":"CR19","first-page":"Multi","volume":"3","author":"Mehlhorn","year":"1984","unstructured":"Mehlhorn K (1984) Multi-dimensional searching and computational geometry. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer, New York, ISBN 0387136428","journal-title":"Data Structures and Algorithms"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Proceedings of the symposium on spatial and temporal databases (SSTD), pp 443-459","DOI":"10.1007\/3-540-47724-1_23"},{"key":"CR21","first-page":"an","volume":"geometry","author":"Preparata","year":"1985","unstructured":"Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York","journal-title":"Computational"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Papadias D, Tao Y, Kalnis P, Zhang J (2002) Indexing spatio-temporal data warehouses. In: Proceedings of international conference on data engineering (ICDE), pp 166-175","DOI":"10.1109\/ICDE.2002.994706"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kotidis Y, Roussopoulos M (1997) Cubetree: organization of and bulk incremental updates on the data cube. In: Proceedings of the ACM\/SIGMOD annual conference on management of data (SIGMOD), pp 89-99","DOI":"10.1145\/253260.253276"},{"key":"CR24","unstructured":"Sellis TK, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the international conference on very large data bases (VLDB), pp 507-518"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Yang J, Widom J (2000) Temporal view self-maintenance. In: Proceedings of the international conference on extending database technology (EDBT), pp 395-412","DOI":"10.1007\/3-540-46439-5_28"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Yang J, Widom J (2001) Incremental computation and maintenance of temporal aggregates. In: Proceedings of the international conference on data engineering (ICDE), pp 51-60","DOI":"10.1109\/ICDE.2001.914813"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Zhang D, Markowetz A, Tsotras VJ, Gunopulos D, Seeger B (2001) Efficient computation of temporal aggregates with range predicates. In: ACM international symposium on principles of database systems (PODS), pp 237-245","DOI":"10.1145\/375551.375600"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Zhang D, Tsotras VJ (2001) Improving Min\/Max aggregation over spatial objects. In: ACM international symposium on advances in geographic information systems (GIS), pp 88-93","DOI":"10.1145\/512161.512181"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Zhang D, Tsotras VJ, Gunopulos D (2002) Efficient aggregation over objects with extent. In: ACM international symposium on principles of database systems (PODS), pp 121-132","DOI":"10.1145\/543613.543629"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0142-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0142-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0142-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:51:39Z","timestamp":1586123499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0142-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0142-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}