{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T05:06:18Z","timestamp":1748667978417},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,3,15]],"date-time":"2007-03-15T00:00:00Z","timestamp":1173916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10844-007-0039-y","type":"journal-article","created":{"date-parts":[[2007,3,14]],"date-time":"2007-03-14T12:49:29Z","timestamp":1173876569000},"page":"35-52","source":"Crossref","is-referenced-by-count":6,"title":["Using B+-trees for processing of line segments in large spatial databases"],"prefix":"10.1007","volume":"31","author":[{"given":"Hung-Yi","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,15]]},"reference":[{"issue":"9","key":"39_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"Bentley, J. L. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 509\u2013517.","journal-title":"Communications of the ACM"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Blanken, H., Ijbema, A., Meek, P., & Akker, B. (1990). The generalized grid file: Description and performance aspects. In Proceeding of 6th IEEE International Conference on Data Engineering, 380\u2013388. Washington, DC: IEEE Computer Society.","DOI":"10.1109\/ICDE.1990.113491"},{"issue":"2","key":"39_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., & Gunther, O. (1998). Multidimensional access methods. ACM Computing Surveys, 30(2), 170\u2013231.","journal-title":"ACM Computing Surveys"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of ACM SIGMOD (47\u201357). New York: ACM.","DOI":"10.1145\/602259.602266"},{"key":"39_CR5","first-page":"237","volume-title":"Lecture notes in computer science 525","author":"E. G. Hoel","year":"1991","unstructured":"Hoel, E. G., & Samet, H. (1991). Efficient processing of spatial queries in line segment databases In O. Gunther & H. J. Schek (Eds.), Advances in spatial databases\u20142nd symposium, SSD\u201991, Lecture notes in computer science 525 (pp. 237\u2013256). Berlin: Springer."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Hoel, E. G., & Samet, H. A. (1992). Qualitative comparison study of data structure for large segment databases, SIGMOD (pp. 205\u2013214). San Diego, CA.","DOI":"10.1145\/130283.130316"},{"key":"39_CR7","unstructured":"Jagadish, H. V. (1990). On indexing line segments. In D. McLeod, R. Sacks-Davis, & H. Schek (Eds.), Proceedings of the Sixteen International Conference on Very Large Data Bases (614\u2013625). Brisbane, Australia."},{"issue":"2","key":"39_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/69.277778","volume":"6","author":"A. Kumar","year":"1994","unstructured":"Kumar, A. (1994). G-tree: A new data structure for organization multidimensional data. IEEE Transaction on Knowledge and Data Engineering, 6(2), 341\u2013347.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Lanka, S., & Mays, E. (1991). Fully persistent B + -trees. In Proceedings of ACM SIGMOD (426\u2013435). New York: ACM.","DOI":"10.1145\/115790.115861"},{"key":"39_CR10","unstructured":"Lindenbaum, M., Samet, H., & Hjaltason, G. R. A. (2000). Probabilistic analysis of trie-based sorting of large collections of line segments in spatial databases, University of Maryland Computer Science TR 3455.1."},{"issue":"1","key":"39_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., & Sevcik, K. (1984). The grid file: an adaptable symmetric multikey file structure. ACM Transactions on Database Systems, 9(1), 38\u201371.","journal-title":"ACM Transactions on Database Systems"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Orenstein, J. A., & Merrett, T. H. (1984). A class of data structure for associative searching. In Proceedings of the Third ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (pp. 181\u2013190). New York: ACM.","DOI":"10.1145\/588011.588037"},{"issue":"2","key":"39_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/136588197242428","volume":"11","author":"D. Papadias","year":"1997","unstructured":"Papadias, D., & Theodoridis, Y. (1997). Spatial relations, minimum bounding rectangles and spatial data structures. International Journal of Geographical Information Science, 11(2), 111\u2013138.","journal-title":"International Journal of Geographical Information Science"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Robinson, J. T. (1981). The K-D-B Tree: A search structure for large multidimensional dynamic indexes. In Proceedings of ACM SIGMOD (pp. 10\u201318). New York: ACM.","DOI":"10.1145\/582318.582321"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Six, H., & Widmayer, P. (1988). Spatial searching in geometric databases. In Proceeding of 4th IEEE International Conference on Data Engineering (496\u2013503).","DOI":"10.1109\/ICDE.1988.105496"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0039-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-007-0039-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0039-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:10:46Z","timestamp":1559254246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-007-0039-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,15]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s10844-007-0039-y","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,15]]}}}