{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:39:42Z","timestamp":1740109182750,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1251019"],"award-info":[{"award-number":["1251019"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1200792"],"award-info":[{"award-number":["1200792"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61428204"],"award-info":[{"award-number":["61428204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202025"],"award-info":[{"award-number":["61202025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2015CB352403"],"award-info":[{"award-number":["2015CB352403"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Scientific Innovation Act of STCSM","award":["13511504200","15JC1402400"],"award-info":[{"award-number":["13511504200","15JC1402400"]}]},{"name":"the EU FP7 CLIMBER project","award":["PIRSES-GA-2012-318939"],"award-info":[{"award-number":["PIRSES-GA-2012-318939"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00778-015-0418-x","type":"journal-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T09:05:53Z","timestamp":1451984753000},"page":"317-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Exact and approximate flexible aggregate similarity search"],"prefix":"10.1007","volume":"25","author":[{"given":"Feifei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,5]]},"reference":[{"issue":"6","key":"418_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"418_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Kriegel, H.-P.: A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson. PODS \u201997, pp. 78\u201386. ACM, New York (1997)","DOI":"10.1145\/263661.263671"},{"key":"418_CR3","unstructured":"Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, New York (1997)"},{"key":"418_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C.: A cost model for query processing in high dimensional data spaces. ACM Trans. Database Syst. 25(2), 129\u2013178 (2000)","DOI":"10.1145\/357775.357776"},{"key":"418_CR5","unstructured":"Chakrabarti, K., Porkaew, K., Mehrotra, S.: The Color Data Set (2006). \n                    http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.data.html"},{"key":"418_CR6","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases. VLDB \u201997, pp. 426\u2013435. Morgan Kaufmann Publishers Inc., San Francisco (1997)"},{"key":"418_CR7","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: SIGMOD (2003)","DOI":"10.1145\/872757.872795"},{"key":"418_CR8","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)","DOI":"10.1145\/375551.375567"},{"key":"418_CR9","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., El Abbadi, A.: Constrained nearest neighbor queries. In: SSTD, pp. 257\u2013278 (2001)","DOI":"10.1007\/3-540-47724-1_14"},{"key":"418_CR10","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB (1999)"},{"key":"418_CR11","doi-asserted-by":"publisher","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265\u2013318. doi:\n                    10.1145\/320248.320255","DOI":"10.1145\/320248.320255"},{"issue":"2","key":"418_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: iDistance: an adaptive B$$^+$$-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"418_CR13","doi-asserted-by":"publisher","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8, Art ID 1.1. doi:\n                    10.1145\/996546.996548\n                    \n                   (2003)","DOI":"10.1145\/996546.996548"},{"key":"418_CR14","unstructured":"LeCun, Y., Cortes, C.: The MNIST Data Set (1998). \n                    http:\/\/yann.lecun.com\/exdb\/mnist"},{"key":"418_CR15","doi-asserted-by":"crossref","unstructured":"Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE Trans Knowl Data Eng 23(10), 1526\u20131540 (2010)","DOI":"10.1109\/TKDE.2010.181"},{"key":"418_CR16","doi-asserted-by":"crossref","unstructured":"Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems, Bremen. GIS \u201905, pp. 192\u2013199. ACM, New York (2005)","DOI":"10.1145\/1097064.1097092"},{"key":"418_CR17","doi-asserted-by":"crossref","unstructured":"Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: SIGMOD, pp. 1009\u20131020 (2011)","DOI":"10.1145\/1989323.1989429"},{"key":"418_CR18","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE (2004)"},{"issue":"2","key":"418_CR19","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 TODS 30(2), 529\u2013576 (2005)","journal-title":"ACM TODS"},{"key":"418_CR20","doi-asserted-by":"crossref","unstructured":"Razente, H.L., Barioni, M.C.N., Traina, A.J.M., Faloutsos, C., Traina Jr., C.: A novel optimization approach to efficiently process aggregate similarity queries in metric access methods. In: CIKM (2008)","DOI":"10.1145\/1458082.1458110"},{"key":"418_CR21","unstructured":"Rose, K., Manjunath, B.S.: The CORTINA Data Set (2004). \n                    http:\/\/www.scl.ece.ucsb.edu\/datasets\/index.htm"},{"key":"418_CR22","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose. SIGMOD \u201995, pp. 71\u201379. ACM, New York (1995)","DOI":"10.1145\/223784.223794"},{"key":"418_CR23","unstructured":"Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44\u201353 (2000)"},{"key":"418_CR24","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559905"},{"issue":"6","key":"418_CR25","first-page":"820","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE TKDE 17(6), 820\u2013833 (2005)","journal-title":"IEEE TKDE"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0418-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0418-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0418-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0418-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T15:27:58Z","timestamp":1589642878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0418-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["418"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0418-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2016,1,5]]},"assertion":[{"value":"1 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2015","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}