{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:27:24Z","timestamp":1778300844796,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433248","type":"print"},{"value":"9783540458760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45876-x_42","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:28:28Z","timestamp":1181183308000},"page":"682-700","source":"Crossref","is-referenced-by-count":16,"title":["Aggregate Processing of Planar Points"],"prefix":"10.1007","author":[{"given":"Yufei","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","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 Journal, Vol. 5(4), pp. 264\u2013275, 1996.","journal-title":"VLDB Journal"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, B., Kriegel, H.P., Schneider, R, Seeger, B. The R*-tree: An Efficient and Robust Access Method. ACM SIGMOD, 1990.","DOI":"10.1145\/93597.98741"},{"key":"42_CR3","unstructured":"Bercken van den, J., Seeger, B. Query Processing Techniques for Multiversion Access Methods. VLDB, 1996."},{"key":"42_CR4","unstructured":"Jurgens, M., Lenz, H. The Ra*-tree: An Improved R-tree with Materialized Data for Supporting Range Queries on OLAP-Data. DEXA Workshop, 1998."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C. On Packing R-trees. CIKM, 1993.","DOI":"10.1145\/170088.170403"},{"key":"42_CR6","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V., Dellis, A., Hadjieleftheriou, M. Indexing Animated Objects Using Spatiotemporal Access Methods. To appear in IEEE TKDE."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Kim, J., Kang, S., Kim, M. Effective Temporal Aggregation using Pointbased Trees. DEXA, 1999.","DOI":"10.1007\/3-540-48309-8_96"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Kline, N., Snodgrass, R. Computing Temporal Aggregates. IEEE ICDE, 1995.","DOI":"10.1109\/ICDE.1995.380389"},{"issue":"1","key":"42_CR9","first-page":"1","volume":"10","author":"A. Kumar","year":"1998","unstructured":"Kumar, A, Tsotras, V., Faloutsos, C. Design Access Methods for Bitemporal Databases. IEEE TKDE 10(1): 1\u201320, 1998.","journal-title":"IEEE TKDE"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Lazaridis, I., Mehrotra, S. Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. ACM SIGMOD, 2001.","DOI":"10.1145\/375663.375718"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y. Efficient OLAP Operations in Spatial Data Warehouses. SSTD, 2001.","DOI":"10.1007\/3-540-47724-1_23"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Pedersen, T., Tryfona, N. Pre-aggregation in Spatial Data Warehouses. SSTD, 2001.","DOI":"10.1007\/3-540-47724-1_24"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Kalnis, P., Zhang, J. Indexing Spatio-temporal Data Warehouses. IEEE ICDE, 2002.","DOI":"10.1109\/ICDE.2002.994706"},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1997","unstructured":"Salzberg, B., Tsotras, V. A Comparison of Access Methods for Temporal Data. ACM Computing Surveys, 31(2): 158\u2013221, 1997.","journal-title":"ACM Computing Surveys"},{"key":"42_CR15","unstructured":"Tao, Y., Papadias, D. The MV3R-tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. VLDB, 2001."},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Zhang, J. Efficient Cost Models for Overlapping and Multi-Version Structures. IEEE ICDE, 2002.","DOI":"10.1145\/581751.581754"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T. A Model for the Prediction of R-tree Performance. ACM PODS, 1996.","DOI":"10.1145\/237661.237705"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Silva, J. Nascimento, M. On the Generation of Spatiotemporal Datasets. SSD, 1999.","DOI":"10.1007\/3-540-48482-5_11"},{"issue":"3","key":"42_CR19","first-page":"391","volume":"9","author":"P. Varman","year":"1997","unstructured":"Varman, P., Verma, R. An Efficient Multiversion Access Structure. IEEE TKDE, Vol. 9, No. 3, pp. 391\u2013409, 1997.","journal-title":"IEEE TKDE"},{"issue":"9","key":"42_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00289075","volume":"2","author":"A. Yao","year":"1978","unstructured":"Yao, A. Random 2-3 Trees. Acta Informatica, Vol. 2(9), 159\u2013179, 1978.","journal-title":"Acta Informatica"},{"key":"42_CR21","unstructured":"Yang, J., Widom, J. Incremental Computation and Maintenance of Temporal Aggregates. IEEE ICDE, 2001."},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, D., Markowetz, A., Tsotras, V., Gunopulos, D., Seeger, B. Efficient Computation of Temporal Aggregates with Range Predicates. ACM PODS, 2001.","DOI":"10.1145\/375551.375600"},{"key":"42_CR23","unstructured":"Zhang, D., Tsotras, V., Seeger, B. Efficient Temporal Join Processing Using Indices. IEEE ICDE, 2002."}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45876-X_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:44:25Z","timestamp":1556480665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45876-X_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433248","9783540458760"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45876-x_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}