{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:40:34Z","timestamp":1725486034210},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441380"},{"type":"electronic","value":"9783540457107"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45710-0_17","type":"book-chapter","created":{"date-parts":[[2007,6,13]],"date-time":"2007-06-13T00:29:40Z","timestamp":1181694580000},"page":"204-217","source":"Crossref","is-referenced-by-count":2,"title":["An Access Method for Integrating Multi-scale Geometric Data"],"prefix":"10.1007","author":[{"given":"Joon-Hee","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Yong-Ik","family":"Yoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"B. Becker, H.-W. Six, and P. Widmayer, \u201cSpatial Priority Search: an Access Technique for Scaless Maps\u201d, Proceedings ACM SIGMOD Conference, pp.128\u2013137, Denver, CO, 1991.","DOI":"10.1145\/115790.115805"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, \u201cThe R*-tree: An Efficient and Robust Access Method for Points and Rectangles\u201d, Proceedings ACM SIGMOD Conference, pp.322\u2013331, Atlantic City, NJ, 1990.","DOI":"10.1145\/93597.98741"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Bertolotto and M.J. Egenhofer, \u201cProgressive Vector Transmission\u201d, Proceedings 7th ACM-GIS Symposium, pp.152\u2013157, Kansas City, USA, Nov. 1999.","DOI":"10.1145\/320134.320172"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"D.H. Douglas and T.K. Peucker, \u201cAlgorithms for the Reduction of Points Required to Rep-resent a Digitized Line or its Caricature\u201d, Canadian Cartography, 10, pp. 112\u2013122, 1973.","journal-title":"Canadian Cartography"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0169-023X(01)00051-9","volume":"40","author":"P.F.C. Edward","year":"2002","unstructured":"P.F.C. Edward and K.W.C. Kevin, \u201cOn Multi-Scale Display of Geometric Objects\u201d, Data and Knowledge Engineering, 40(1), pp. 91\u2013119, 2002.","journal-title":"Data and Knowledge Engineering"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther, \u201cMultidimensional Access Methods\u201d, ACM Computing Surveys, 30(2), pp. 170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"A. Guttman, \u201cR-trees: A Dynamic Index Structure for Spatial Searching\u201d, Proceedings ACM SIGMOD Conference, pp. 47\u201354, Boston, Ma., 1984.","DOI":"10.1145\/602259.602266"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.-W. Six, and P. Widmayer, \u201cThe R-file: An Efficient Access Structure for Proximity Queries\u201d, Proceedings 6th IEEE ICDE Conference, pp. 372\u2013379, Los Angeles, CA, 1990.","DOI":"10.1109\/ICDE.1990.113490"},{"key":"17_CR9","unstructured":"I. Kamel and C. Faloutsos., \u201cHilbert R-tree: An Improved R-tree Using Fractals\u201d, Proceed-ings 20th VLDB Conference, pp. 500\u2013509, Santiago de Chile, Chile, 1994."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt,, H. Hinterberger, and K.C. Sevcik, \u201cThe Grid file: an Adaptable, Symmetric Multikey File Structure\u201d, ACM Transactions on Database Systems. 9(1), pp. 38\u201371, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"17_CR11","unstructured":"P.V. Oosterom, \u201cThe Reactive-tree: a Storage Structure for a Seamless, Scaless Geographic Database\u201d, Proceedings of Auto-Carto, 10, pp. 393\u2013407, 1991."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"P.V. Oosterom and V. Schenkelaars, \u201cThe Development of an Interactive Multi-scale GIS\u201d, International Journal of Geographic Information Systems, pp. 489\u2013507, 1995.","DOI":"10.1080\/02693799508902052"},{"key":"17_CR13","unstructured":"A. Ruas, \u201cMultiple representation and generalization\u201d, Lecture Notes for \u201csommarkurs: kartografi\u201d, 1995."},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"H. Samet, \u201cThe Quadtree and Related Hierarchical Data Structure\u201d, ACM Computing Surveys, 16(2), pp. 187\u2013260, 1984.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1145\/282957.282966","volume":"4","author":"H. Samet","year":"1985","unstructured":"H. Samet and R.E. Webber, \u201cStoring a collection of polygons using quadtrees\u201d, ACM Transactions on Graphics, 4(3), pp. 182\u2013222, 1985.","journal-title":"ACM Transactions on Graphics"},{"key":"17_CR16","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos, \u201cThe R+-tree: A Dynamic Index for Multidi-mensional Objects\u201d, Proceedings 13th VLDB Conference, pp. 507\u2013518, Brighton, England, 1987."},{"issue":"1","key":"17_CR17","first-page":"224","volume":"1","author":"S. Timpf","year":"1997","unstructured":"S. Timpf, \u201cCartographic Objects in a Multi-scale Data Structure\u201d, Geographic Information Research: Bridging the Atlantic. 1(1), pp. 224\u2013234, 1997.","journal-title":"Geographic Information Research: Bridging the Atlantic"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45710-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T02:10:29Z","timestamp":1556503829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45710-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441380","9783540457107"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45710-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}