{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:06Z","timestamp":1725574086113},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_44","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"533-544","source":"Crossref","is-referenced-by-count":3,"title":["Join-Queries between Two Spatial Datasets Indexed by a Single R*-Tree"],"prefix":"10.1007","author":[{"given":"Michael","family":"Vassilakopoulos","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[]},{"given":"Nikitas N.","family":"Karanikolas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.P., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. In: SIGMOD Conference, pp. 237\u2013246 (1993)","DOI":"10.1145\/170035.170075"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1109\/TKDE.2003.1209007","volume":"15","author":"E. Chan","year":"2003","unstructured":"Chan, E.: Buffer Queries. IEEE Transactions on Knowledge and Data Engineering\u00a015(4), 895\u2013910 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"44_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(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: SIGMOD Conference, pp. 189\u2013200 (2000)","DOI":"10.1145\/342009.335414"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A. Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for Processing K-Closest-Pair Queries in Spatial Databases. Data & Knowledge Engineering\u00a049(1), 67\u2013104 (2004)","journal-title":"Data & Knowledge Engineering"},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional Access Methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. SIGMOD Conference, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"44_CR9","unstructured":"Huang, Y.M., Jing, N., Rundensteiner, E.: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. In: VLDB Conference, pp. 395\u2013405 (1997)"},{"issue":"1","key":"44_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206049.1206056","volume":"32","author":"E.H. Jacox","year":"2007","unstructured":"Jacox, E.H., Samet, H.: Spatial Join Techniques. TODS \u00a032(1) article 7, 1\u201344 (2007)","journal-title":"TODS"},{"issue":"7","key":"44_CR11","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TKDE.2009.141","volume":"22","author":"Y.J. Kim","year":"2010","unstructured":"Kim, Y.J., Patel, J.: Performance Comparison of the R*-tree and the Quadtree for kNN and Distance Join Queries. IEEE Transactions on Knowledge and Data Engineering\u00a022(7), 1014\u20131027 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"44_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-293-5","volume-title":"R-Trees: Theory and Applications","author":"Y. Manolopoulos","year":"2006","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2006)"},{"key":"44_CR13","volume-title":"Advanced Database Indexing","author":"Y. Manolopoulos","year":"1999","unstructured":"Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Advanced Database Indexing. Kluwer Academic Publishers, Boston (1999)"},{"key":"44_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"issue":"6","key":"44_CR15","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TKDE.2002.1047776","volume":"14","author":"S. Shekhar","year":"2002","unstructured":"Shekhar, S., Lu, C.T., Chawla, S., Ravada, S.: Efficient Join Index Based Join Processing; A Clustering Approach. IEEE Transactions on Knowledge and Data Engineering\u00a014(6), 1400\u20131421 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"44_CR16","first-page":"43","volume":"17","author":"A. Touir","year":"2004","unstructured":"Touir, A.: ML-Quadtree: The Design of an Efficient Access Method for Spatial Database Systems. Journal of King Saud Univ.\u00a017, 43\u201360 (2004)","journal-title":"Journal of King Saud Univ."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T06:55:33Z","timestamp":1553324133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}