{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:42:05Z","timestamp":1736314925750,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327349"},{"type":"electronic","value":"9783540327356"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681885_11","type":"book-chapter","created":{"date-parts":[[2006,2,24]],"date-time":"2006-02-24T06:28:29Z","timestamp":1140762509000},"page":"129-143","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Zoning Technique for Multi-dimensional Access Methods"],"prefix":"10.1007","author":[{"given":"Byunggu","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seon Ho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Beckman, N., et al.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Kriegel, H.-P.: The Pyramid-technique: Towards breaking the curse of dimensionality. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 142\u2013153 (1998)","DOI":"10.1145\/276304.276318"},{"key":"11_CR3","unstructured":"Berchtold, S., Keim, D., Kriegel, H.-P.: The X-tree: An index structure for highdimensional data. In: Proc. VLDB Int. Conf. on Very Large Data Bases, pp. 28\u201339 (1996)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-tree. ACM Computing Surveys\u00a011, 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Kamel, I.: On Packing R-tree. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp. 490\u2013499 (1993)","DOI":"10.1145\/170088.170403"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47\u201354 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/69.842248","volume":"12","author":"S.T. Leutenegger","year":"2000","unstructured":"Leutenegger, S.T., Lopez, M.A.: The Effect of Buffering on the Performance of Rtrees. IEEE Transactions on Knowledge and Data Engineering\u00a012(1), 33\u201344 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Lopez, M.A., Edingnton, J.M.: STR: A Simple and Efficient Algorithm for R-tree Packing. In: IEEE International Conference on Data Engineering, pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. Lin","year":"1995","unstructured":"Lin, K., Jagadish, H., Faloutsos, C.: The TV-tree: An Index Structure for High- Dimensional Data. VLDB Journal\u00a03, 517\u2013542 (1995)","journal-title":"VLDB Journal"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Ng, S.W.: Advances in Disk Technology: Performance Issues. IEEE Computer Magazine, 75\u201381 (1998)","DOI":"10.1109\/2.675641"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0169-023X(02)00023-X","volume":"42","author":"R. Orlandic","year":"2002","unstructured":"Orlandic, R., Yu, B.: A Retrieval Technique for High-Dimensional Data and Partially Specified Queries. DKE Data & Knowledge Engineering\u00a042(2), 1\u201321 (2002)","journal-title":"DKE Data & Knowledge Engineering"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4018\/jdm.2004070103","volume":"15","author":"R. Orlandic","year":"2004","unstructured":"Orlandic, R., Yu, B.: Scalable QSF-Trees: Retrieving Regional Objects in High- Dimensional Spaces. Journal of Database Management\u00a015(3), 45\u201359 (2004)","journal-title":"Journal of Database Management"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Papadias, D., Theodoridis, Y., Sellis, T., Egenhofer, M.J.: Topological relations in the world of minimum bounding rectangles: A study with R-trees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 92\u2013103 (1995)","DOI":"10.1145\/223784.223798"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1145\/319540.319565","volume":"6","author":"A.L. Rosenberg","year":"1981","unstructured":"Rosenberg, A.L., Snyder, L.: Time- and Space- Optimality in B-trees. ACM Transactions on Database Systems\u00a06(1), 174\u2013193 (1981)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Leifker, D.: Direct Spatial Search on Pictorial Database Using Packed R-trees. In: ACM International Conference on Management of Data, pp. 17\u201331 (1985)","DOI":"10.1145\/318898.318900"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Ruemmler, C., Wilkes, J.: An Introduction to Disk Drive Modeling. IEEE Computer (March 1994)","DOI":"10.1109\/2.268881"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity Indexing with the SS-tree. In: Proc. 12th IEEE Conf. on Data Engineering, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Lecture Notes in Computer Science","Trends in Enterprise Application Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681885_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:26:45Z","timestamp":1736285205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681885_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327349","9783540327356"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11681885_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}