{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:25:32Z","timestamp":1725517532486},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540856535"},{"type":"electronic","value":"9783540856542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85654-2_60","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T07:30:03Z","timestamp":1219822203000},"page":"693-700","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Bounds in Finding Aggregate Nearest Neighbors"],"prefix":"10.1007","author":[{"given":"Sansarkhuu","family":"Namnandorj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Ohbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"60_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, I., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial datasets. ACM Trans. Database Syst.\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD 1984, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Outlier Detection for High Dimensional Data. In: SIGMOD 2001, pp. 37\u201346 (2001)","DOI":"10.1145\/375663.375668"},{"key":"60_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/978-3-540-74484-9_70","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"Y. Luo","year":"2007","unstructured":"Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol.\u00a04707, pp. 821\u2013833. Springer, Heidelberg (2007)"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD 1995, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is Nearest Neighbors Meaningful? In: Proc. of the Int. Conf. Database Theories, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"60_CR7","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group Nearest Neighbor Queries. In: ICDE 2004, pp. 301\u2013312 (2004)"},{"issue":"6","key":"60_CR8","first-page":"820","volume":"17","author":"M.L. Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate Nearest Neighbor Queries in Road Networks. IEEE TKDE\u00a017(6), 820\u2013833 (2005)","journal-title":"IEEE TKDE"},{"key":"60_CR9","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 1990, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: GIS, pp. 192\u2013199 (2005)","DOI":"10.1145\/1097064.1097092"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85654-2_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:33:40Z","timestamp":1606185220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85654-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540856535","9783540856542"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85654-2_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}