{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:39:20Z","timestamp":1760121560704,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44681-8_124","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"889-900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Partitioning for Efficient I\/O in Spatial Databases"],"prefix":"10.1007","author":[{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"El Abbadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"1","key":"124_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/319682.319698","volume":"7","author":"H. C. Du","year":"1982","unstructured":"H. C. Du and J. S. Sobolewski. Disk allocation for cartesian product files on multiple-disk systems. ACM Transactions of Database Systems, 7(1):82\u2013101, March 1982.","journal-title":"ACM Transactions of Database Systems"},{"key":"124_CR2","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Concentric hyperspaces and disk allocation for fast parallel range searching. In Proc. Int. Conf. Data Engineering, pages 608\u2013615, Sydney, Australia, March 1999.","DOI":"10.1109\/ICDE.1999.754977"},{"key":"124_CR3","volume-title":"Technical report, Comp. Sci. Dept.","author":"H. Ferhatosmanoglu","year":"2000","unstructured":"H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Optimal partitioning for spatial data. Technical report, Comp. Sci. Dept., UC, Santa Barbara, December 2000."},{"key":"124_CR4","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. Multidimensional access methods. ACM Computing Surveys, 30:170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"124_CR5","unstructured":"Thomas C. Hales. The honeycomb conjecture. available at http:\/\/xxx.lanl.gov\/abs\/math.MG\/9906042 , June 1999."},{"key":"124_CR6","unstructured":"Thomas C. Hales. Historical background on hexagonal honeycomb. http:\/\/www.math.lsa.umich.edu\/hales\/countdown\/honey\/hexagonHistory.html , March 2000."},{"key":"124_CR7","doi-asserted-by":"crossref","unstructured":"S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A. El Abbadi. Cyclic allocation of two-dimensional data. In International Conference on Data Engineering, pages 94\u2013101, Orlando, Florida, Feb 1998.","DOI":"10.1109\/ICDE.1998.655763"},{"key":"124_CR8","volume-title":"The Design and Analysis of Spatial Structures","author":"H. Samet","year":"1989","unstructured":"H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989."},{"key":"124_CR9","unstructured":"R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194\u2013205, New York City, New York, August 1998."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:33:49Z","timestamp":1737398029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_124","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}