{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:58:25Z","timestamp":1725501505494},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387308586"},{"type":"electronic","value":"9780387359731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-35973-1_43","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T23:26:46Z","timestamp":1199834806000},"page":"16-19","source":"Crossref","is-referenced-by-count":0,"title":["Aggregation Query, Spatial"],"prefix":"10.1007","author":[{"given":"Donghui","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","first-page":"322","volume-title":"Proc. ACM International Conference on Management of Data (SIGMOD'90)","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R\n                  $$ ^\\ast $$\n                -tree:\nAn Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD, pp. 322\u2013331 (1990)"},{"issue":"4","key":"43_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional Divide-and-Conquer. Commun.s ACM 23(4), 214\u2013229 (1980)","journal-title":"Communs. ACM"},{"issue":"4","key":"43_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, N.B.: Decomposable Searching Problems I:\nStatic-to-Dynamic Transformations. J. Algorithms 1(4), 301\u2013358 (1980)","journal-title":"J. Algorithms"},{"issue":"9","key":"43_CR4","first-page":"1412","volume":"80","author":"Y. Chiang","year":"1992","unstructured":"Chiang, Y., Tamassia R.: Dynamic Algorithms in Computational\nGeometry. Proc. of the IEEE, Special Issue on Computational Geometry\n80(9), 1412\u20131434 (1992)","journal-title":"Proc. of the IEEE, Special Issue on Computational Geometry"},{"key":"43_CR5","unstructured":"Chung, C., Chun, S., Lee, J., Lee, S.: Dynamic Update Cube for Range-Sum\nQueries. In: VLDB, pp. 521\u2013530 (2001)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Geffner, S., Agrawal, D., El\u00a0Abbadi, A.: The Dynamic Data Cube. In: EDBT, pp: 237\u2013253 (2000)","DOI":"10.1007\/3-540-46439-5_17"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/375663.375718","volume-title":"SIGMOD '01: Proceedings of the 2001 ACM SIGMOD international conference on Management of data","author":"I. Lazaridis","year":"2001","unstructured":"Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with \na\u00a0Multi-Resolution Tree Structure. In: SIGMOD, pp. 401\u2013412 (2001)"},{"key":"43_CR8","volume-title":"The Design of Dynamic Data Strucutures, vol. 156 of LNCS","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. Lecture Notes in\nComputer Science, vol. 156, Springer, Heidelberg (1983)"},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/3-540-47724-1_23","volume-title":"SSTD '01: Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases","author":"D. Papadias","year":"2001","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP Operations in\nSpatial Data Warehouses. In: Jensen, C.S.; Schneider, M.; Seeger, B.; Tsotras,\nV.J. (eds.) Advances in Spatial and Temporal Databases, 7th International\nSymposium, SSTD 2001, Redondo Beach, July 2001. Lecture Notes in Computer\nScience, vol. 2121, pp. 443\u2013459. Springer, Heidelberg (2001)"},{"key":"43_CR10","volume-title":"Proc. of the 1981 ACM SIGMOD international conference on Management of data (SIGMOD'81)","author":"J.T. Robinson","year":"1981","unstructured":"Robinson, J.: The K-D-B Tree: A\u00a0Search Structure For Large Multidimensional\nDynamic Indexes. In: SIGMOD, pp 10\u201318 (1981)"},{"issue":"2","key":"43_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External Memory Algorithms and Data Structures. ACM\nComput. Surveys 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surveys"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, D., Tsotras, V.J., Gunopulos, D.: Efficient Aggregation over Objects\nwith Extent. In: PODS, pp. 121\u2013132 (2002)","DOI":"10.1145\/543627.543629"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35973-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T14:58:52Z","timestamp":1557673132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35973-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387308586","9780387359731"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35973-1_43","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}