{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:15Z","timestamp":1725564915392},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340799"},{"type":"electronic","value":"9783540340805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751649_5","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:07:52Z","timestamp":1147356472000},"page":"39-48","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases"],"prefix":"10.1007","author":[{"given":"Yunjun","family":"Gao","sequence":"first","affiliation":[]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Gencai","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chun","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Henrich, A.: A distance-scan algorithm for spatial access structures. In: ACM GIS, pp. 136\u2013143 (1994)","key":"5_CR1"},{"doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","key":"5_CR2","DOI":"10.1145\/223784.223794"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record\u00a027, 16\u201321 (1998)","journal-title":"ACM SIGMOD Record"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS\u00a024, 265\u2013318 (1999)","journal-title":"ACM TODS"},{"doi-asserted-by":"crossref","unstructured":"Papadopoulos, A.N., Manolopoulos, Y.: Similarity query processing using disk arrays. In: SIGMOD, pp. 225\u2013236 (1998)","key":"5_CR5","DOI":"10.1145\/276304.276325"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","key":"5_CR6","DOI":"10.1145\/602259.602266"},{"unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R \u2009+\u2009-tree: a dynamic index for multi-dimensional Objects. In: VLDB, pp. 507\u2013518 (1987)","key":"5_CR7"},{"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, pp. 322\u2013331 (1990)","key":"5_CR8","DOI":"10.1145\/93605.98741"},{"doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: Parallel R-trees. In: SIGMOD, pp. 195\u2013204 (1992)","key":"5_CR9","DOI":"10.1145\/130283.130315"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.K.: A model for the prediction of R-tree performance. In: PODS, pp. 161\u2013171 (1996)","key":"5_CR10","DOI":"10.1145\/237661.237705"},{"doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Braunm\u00fcller, B., Keim, D.A., Kriegel, H.-P.: Fast parallel similarity search in multimedia databases. In: SIGMOD, pp. 1\u201312 (1997)","key":"5_CR11","DOI":"10.1145\/253262.253263"},{"doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Parallel processing of nearest neighbor queries in declustered spatial data. In: ACM GIS, pp. 35\u201343 (1996)","key":"5_CR12","DOI":"10.1145\/258319.258330"},{"doi-asserted-by":"crossref","unstructured":"Koudas, N., Faloutsos, C., Kamel, I.: Declustering spatial databases on a multi-computer architecture. In: EDBT, pp. 592\u2013614 (1996)","key":"5_CR13","DOI":"10.1007\/BFb0014180"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1014310721543","volume":"22","author":"M.L. Gavrilova","year":"2002","unstructured":"Gavrilova, M.L.: On a nearest-neighbor problem under minkowski and power metrics for large data sets. J. of Supercomputing\u00a022, 87\u201398 (2002)","journal-title":"J. of Supercomputing"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751649_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:49Z","timestamp":1619506909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751649_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340799","9783540340805"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11751649_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}