{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:02:38Z","timestamp":1648569758319},"reference-count":54,"publisher":"Oxford University Press (OUP)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1093\/comjnl\/bxv097","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T01:08:17Z","timestamp":1446772097000},"page":"1363-1382","source":"Crossref","is-referenced-by-count":0,"title":["<i>DiVA<\/i>: Using Application-Specific Policies to \u2018Dive\u2019 into Vector Approximations"],"prefix":"10.1093","volume":"59","author":[{"given":"Konstantinos","family":"Tsakalozos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spiros","family":"Evangelatos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fotis","family":"Psallidas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos R.","family":"Vieira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Delis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,11,4]]},"reference":[{"key":"2016091210174458000_59.9.1363.1","doi-asserted-by":"crossref","unstructured":"Szalay A.S. , Gray J. , Thakar A. , Kunszt P.Z. , Malik T. , Raddick J. , Stoughton C. and van den Berg J. (2002) The SDSS SkyServer\u2014Public Access to the Sloan Digital Sky Server Data. Proc. ACM SIGMOD, Madison, WI, June.","DOI":"10.1145\/564756.564758"},{"key":"2016091210174458000_59.9.1363.2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-009-0339-z"},{"key":"2016091210174458000_59.9.1363.3","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-009-0409-2"},{"key":"2016091210174458000_59.9.1363.4","doi-asserted-by":"publisher","DOI":"10.1007\/s10278-010-9290-9"},{"key":"2016091210174458000_59.9.1363.5","doi-asserted-by":"crossref","unstructured":"Valle E. , Cord M. and Philipp-Foliguet S. (2008) High-Dimensional Descriptor Indexing for Large Multimedia Databases. Proc. ACM Conf. Information and Knowledge Management (CIKM), Napa Valley, CA, pp. 739\u2013748.","DOI":"10.1145\/1458082.1458181"},{"key":"2016091210174458000_59.9.1363.6","doi-asserted-by":"crossref","unstructured":"Huang Z. , Shen H. , Liu J. and Zhou X. (2011) Effective Data Co-Reduction for Multimedia Similarity Search. Proc. ACM SIGMOD Int. Conf. Management of Data, Athens, Greece, June, pp. 1021\u20131032.","DOI":"10.1145\/1989323.1989430"},{"key":"2016091210174458000_59.9.1363.7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0255-5"},{"key":"2016091210174458000_59.9.1363.8","doi-asserted-by":"crossref","unstructured":"Katayama N. and Satoh S. (1997) The SR-Tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. Proc. ACM SIGMOD, Tucson, AZ, USA, May. ACM Press.","DOI":"10.1145\/253260.253347"},{"key":"2016091210174458000_59.9.1363.9","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0066-9"},{"key":"2016091210174458000_59.9.1363.10","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/1806907.1806912","article-title":"Efficient and accurate nearest neighbor and closest pair search in high dimensional space","volume":"35","author":"Tao","year":"2010","journal-title":"ACM Trans. Database Syst."},{"key":"2016091210174458000_59.9.1363.11","unstructured":"Yao B. , Li F. and Kumar P. (2010) K Nearest Neighbor Queries and KNN-Joins in Large Relational Databases (Almost) for Free. Proc. IEEE Int. Conf. Data Engineering (ICDE), Long Beach, CA, March, pp. 4\u201315."},{"key":"2016091210174458000_59.9.1363.12","doi-asserted-by":"crossref","unstructured":"Malik R. , Kim S. , Jin X. , Ramachandran C. , Han J. , Gupta I. and Nahrstedt K. (2009) MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions. Proc. Int. Conf. Scientific and Statistical Database Management (SSDBM), New Orleans, LA, June, pp. 167\u2013184.","DOI":"10.1007\/978-3-642-02279-1_12"},{"key":"2016091210174458000_59.9.1363.13","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687630"},{"key":"2016091210174458000_59.9.1363.14","doi-asserted-by":"crossref","unstructured":"Zhang D. , Agrawal D. , Chen G. and Tung A. (2011) HashFile: An Efficient Index Structure for Multimedia Data. Proc. of IEEE Int. Conf., on Data Engineering (ICDE), Hannover, Germany, April, pp. 1103\u20131114.","DOI":"10.1109\/ICDE.2011.5767837"},{"key":"2016091210174458000_59.9.1363.15","unstructured":"Weber R. , Schek H.-J. and Blott S. (1998) A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. Proc. Int. Conf. Very Large Data Bases (VLDB), New York, NY, August, pp. 194\u2013205."},{"key":"2016091210174458000_59.9.1363.16","doi-asserted-by":"crossref","unstructured":"Beyer K.S. , Goldstein J. , Ramakrishnan R. and Shaft U. (1999) When Is \u2018Nearest Neighbor\u2019 Meaningful? Proc. Int. Conf. Database Theory (ICDT), Jerusalem, Israel, pp. 217\u2013235. Springer.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"2016091210174458000_59.9.1363.17","doi-asserted-by":"crossref","unstructured":"Indyk P. and Motwani R. (1998) Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. 13th Annual ACM Symp. Theory of Computing (STOC), Dallas, TX, May, pp. 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"2016091210174458000_59.9.1363.18","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H. , Tuncel E. , Agrawal D. , El Abbadi A. (2001) Approximate Nearest Neighbor Searching in Multimedia Databases. Proc. IEEE Int. Conf. Data Engineering (ICDE), Heidelberg, Germany, April, pp. 503\u2013511.","DOI":"10.1109\/ICDE.2001.914864"},{"key":"2016091210174458000_59.9.1363.19","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0167-3"},{"key":"2016091210174458000_59.9.1363.20","doi-asserted-by":"crossref","unstructured":"Bernecker T. , Emrich T. , Graf F. , Kriegel H.-P. , Renz M. , Schubert E. and Zimek A. (2010) Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces. Proc. Int. Conf. Scientific and Statistical Database Management (SSDBM), Heidelberg, Germany, June, pp. 555\u2013564.","DOI":"10.1007\/978-3-642-13818-8_38"},{"key":"2016091210174458000_59.9.1363.21","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0322-z"},{"key":"2016091210174458000_59.9.1363.22","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H. , Tuncel E. , Agrawal D. and Abbadi A.E. (2000) Vector Approximation-based Indexing for Non-uniform High Dimensional Data Sets. Proc. 9th CIKM Conf., McLean, VA, November. ACM.","DOI":"10.1145\/354756.354820"},{"key":"2016091210174458000_59.9.1363.23","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.01.001"},{"key":"2016091210174458000_59.9.1363.24","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S. , Kremer H. , Lenhard D. and Seidl T. (2011) Subspace Clustering for Indexing High Dimensional Data: A Main Memory Index Based on Local Reductions and Individual Multi-Representations. Int. Conf. Extending Database Technology (EDBT), Uppsala, Sweden, March, pp. 237\u2013248.","DOI":"10.1145\/1951365.1951395"},{"key":"2016091210174458000_59.9.1363.25","doi-asserted-by":"crossref","unstructured":"Barclay T. , Slutz D. and Gray J. (2000) TerraServer: A Spatial Data Warehouse. Proc. of ACM SIGMOD Int. Conf., on Management of Data, Dallas, TX, May, pp. 307\u2013318.","DOI":"10.1145\/335191.335424"},{"key":"2016091210174458000_59.9.1363.26","unstructured":"Sakurai Y. , Yoshikawa M. , Uemura S. and Kojima H. (2000) The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. Proc. of 26th Int. Conf., on Very Large Databases (VLDB), Cairo, Egypt, September, pp. 516\u2013526."},{"key":"2016091210174458000_59.9.1363.27","unstructured":"Berchtold S. , Bohm C. , Jagadish H. , Kriegel H.-P. and Sander J. (2000) Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces. Proc. 16th IEEE ICDE, San Diego, CA, February."},{"key":"2016091210174458000_59.9.1363.28","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2002.1017736"},{"key":"2016091210174458000_59.9.1363.29","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"2016091210174458000_59.9.1363.30","unstructured":"Samet H. (2005) Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"2016091210174458000_59.9.1363.31","unstructured":"Berchtold S. , Keim D. and Kriegel H.-P. (1996) The X-tree: An Index Structure for High-Dimensional Data. Porc. of 22nd Int., Conf., on Very Large Databases (VLDB), Mumbai, India, September, pp. 28\u201339."},{"key":"2016091210174458000_59.9.1363.32","unstructured":"White D. and Jain R. (1996) Similarity Indexing with the SS-tree. Proc. IEEE ICDE Int. Conf., New Orleans, LA, February. IEEE Comp. Society."},{"key":"2016091210174458000_59.9.1363.33","unstructured":"Ciaccia P. , Patella M. and Zezula P. (1997) M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proc. of 23rd Int., Conf., on Very Large Databases (VLDB), Athens, Greece, August, pp. 426\u2013435."},{"key":"2016091210174458000_59.9.1363.34","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"2016091210174458000_59.9.1363.35","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0178-0"},{"key":"2016091210174458000_59.9.1363.36","doi-asserted-by":"crossref","unstructured":"Freeston M. (1987) The BANG File: A New Kind of Grid File. Proc. ACM SIGMOD Conf., San Francisco, CA, May.","DOI":"10.1145\/38714.38743"},{"key":"2016091210174458000_59.9.1363.37","doi-asserted-by":"crossref","unstructured":"Robinson J. (1981) The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proc. SIGMOD, Ann Arbor, MI, April, pp. 10\u201318.","DOI":"10.1145\/582318.582321"},{"key":"2016091210174458000_59.9.1363.38","doi-asserted-by":"crossref","unstructured":"Chakrabarti K. and Mehrotra S. (1999) The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces. Proc. of ACM SIGMOD Int. Conf., on Management of Data, Sydney, Australia, March.","DOI":"10.1109\/ICDE.1999.754960"},{"key":"2016091210174458000_59.9.1363.39","unstructured":"Bellman R. (1957) Dynamic Programming. Princeton University Press, Princeton, NJ."},{"key":"2016091210174458000_59.9.1363.40","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453861"},{"key":"2016091210174458000_59.9.1363.41","doi-asserted-by":"crossref","unstructured":"Tuncel E. , Ferhatosmanoglu H. and Rose K. (2002) VQ-index: An Index Structure for Similarity Searching in Multimedia Databases. Proc. 10th ACM Int. Conf. Multimedia (MM), Juan-les-Pins, France, pp. 543\u2013552.","DOI":"10.1145\/641007.641117"},{"key":"2016091210174458000_59.9.1363.42","doi-asserted-by":"crossref","unstructured":"Weber R. and B\u00f6hm K. (2000) Trading Quality for Time with Nearest Neighbor Search. Proc. of 7th Int. Conf., on Extending Database Technology (EDBT), Konstanz, Germany, March, pp. 21\u201335.","DOI":"10.1007\/3-540-46439-5_2"},{"key":"2016091210174458000_59.9.1363.43","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019214"},{"key":"2016091210174458000_59.9.1363.44","doi-asserted-by":"crossref","unstructured":"Houle M. and Sakuma J. (2005) Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets. Proc. of 21st IEEE Int. Conf., on Data Engineering (ICDE), Tokyo, Japan, April, pp. 619\u2013630.","DOI":"10.1109\/ICDE.2005.66"},{"key":"2016091210174458000_59.9.1363.45","unstructured":"Gionis A. , Indyk P. and Motwani R. (1999) Similarity Search in High Dimensions via Hashing. Proc. of 25th Int. Conf., on Very Large Databases (VLDB), Edinburgh, Scotland, September, pp. 518\u2013529."},{"key":"2016091210174458000_59.9.1363.46","doi-asserted-by":"crossref","unstructured":"Bawa M. , Condie T. and Ganesan P. (2005) LSH Forest: Self-Tuning Indexes for Similarity Search. Proc. 14th Int. Conf. World Wide Web (WWW), Chiba, Japan, April, pp. 651\u2013 660.","DOI":"10.1145\/1060745.1060840"},{"key":"2016091210174458000_59.9.1363.47","unstructured":"Lv Q. , Josephson W. , Wang Z. , Charikar M. and Li K. (2007) Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search. Proc. 33rd VLDB Conf., Vienna, Austria, September."},{"key":"2016091210174458000_59.9.1363.48","doi-asserted-by":"crossref","unstructured":"Keogh E.J. , Chakrabarti K. , Mehrotra S. and Pazzani M.J. (2001) Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. Proc. of ACM SIGMOD Int. Conf., on Data Management, Santa Barbara, CA, USA, May, pp. 151\u2013162.","DOI":"10.1145\/375663.375680"},{"key":"2016091210174458000_59.9.1363.49","first-page":"1881","article-title":"BF-tree: approximate tree index","volume":"7","author":"Athanassoulis","year":"2014","journal-title":"VLDB J."},{"key":"2016091210174458000_59.9.1363.50","first-page":"1","article-title":"SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index","volume":"8","author":"Sun","year":"2014","journal-title":"VLDB J."},{"key":"2016091210174458000_59.9.1363.51","doi-asserted-by":"crossref","unstructured":"Tsakalozos K. , Evangelatos S. and Delis A. (2011) DiVA: Indexing High-Dimensional Data by \u2018Diving\u2019 into Vector Approximations. Proc. IEEE Int. Conf. Multimedia and Expo 2011, Barcelona, Spain, July.","DOI":"10.1109\/ICME.2011.6012037"},{"key":"2016091210174458000_59.9.1363.52","doi-asserted-by":"publisher","DOI":"10.1109\/34.955109"},{"key":"2016091210174458000_59.9.1363.53","unstructured":"Sakurai Y. (2011) The A-Tree: Source Code Release. NTT Communication Science Laboratories, Seika, Soraku, Kyoto, Japan."},{"key":"2016091210174458000_59.9.1363.54","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1209021"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/9\/1363\/7903127\/bxv097.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T01:09:57Z","timestamp":1599786597000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,4]]},"references-count":54,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2016,9,12]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1093\/comjnl\/bxv097"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv097","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,4]]}}}