{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:31Z","timestamp":1725490471326},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74484-9_70","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T17:48:03Z","timestamp":1188323283000},"page":"821-833","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering"],"prefix":"10.1007","author":[{"given":"Yanmin","family":"Luo","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":[{"key":"70_CR1","series-title":"Lecture Notes in Computer Science","first-page":"394","volume-title":"Database Theory - ICDT \u201997","author":"A. Papadopoulos","year":"1996","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-Trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 394\u2013408. Springer, Heidelberg (1996)"},{"issue":"3","key":"70_CR2","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Narasimha Murty, M., Flynn, P.J.: Data Clustering: A Review. ACM Comput. Surv.\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"70_CR3","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of ACM SIGMOD Int\u2019l Conference, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"70_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Outlier Detection for High Dimensional Data. In: SIGMOD Conference, pp. 37\u201346 (2001)","DOI":"10.1145\/375663.375668"},{"key":"70_CR5","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Kol\u00e1rvr, J.: Torben Bach Pedersen, Igor Timko: Nearest neighbor queries in road networks. In: GIS 2003, pp. 1\u20138 (2003)","DOI":"10.1145\/956676.956677"},{"issue":"2","key":"70_CR6","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst.\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"70_CR7","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group Nearest Neighbor Queries. In: ICDE 2004, pp. 301\u2013312 (2004)"},{"key":"70_CR8","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 2005, pp. 192\u2013199 (2005)","DOI":"10.1145\/1097064.1097092"},{"key":"70_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/ similary queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"70_CR10","unstructured":"Lin, K.-I., Nolen, M., Kommeneni, K.: Utilizing Indexes for Approximate and On-Line Nearest Neighbor Queries. In: IDEAS 2005, pp. 83\u201388 (2005)"},{"key":"70_CR11","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 Theorie, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"6","key":"70_CR12","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"M.L. Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate Nearest Neighbor Queries in Road Networks. IEEE Trans. Knowl. Data Eng.\u00a017(6), 820\u2013833 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"70_CR13","unstructured":"Paolo Ciaccia, M.P., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd VLDB Conference, Athenes, Greece, 1997, pp. 357\u2013368 (1997)"},{"key":"70_CR14","doi-asserted-by":"crossref","unstructured":"Ishikawa, M., Chen, H., Furuse, K., Yu, J.X., Ohbo, N.: MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches. Web.-Age. Information Management, 356\u2013373 (2000)","DOI":"10.1007\/3-540-45151-X_34"},{"key":"70_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD Conference 1995, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"70_CR16","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: Proc. of ACM SIGMOD Int\u2019l Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"70_CR17","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21st VLDB Conference, pp. 574\u2013584 (1995)"},{"key":"70_CR18","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based inde- xing for high-dimensional metric spaces. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona, pp. 357\u2013368 (May 1997)","DOI":"10.1145\/253262.253345"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74484-9_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:33:39Z","timestamp":1619505219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74484-9_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744825"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74484-9_70","relation":{},"subject":[]}}