{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:00:16Z","timestamp":1742382016402},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285854"},{"type":"electronic","value":"9783540318958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547686_12","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:38:26Z","timestamp":1127817506000},"page":"153-166","source":"Crossref","is-referenced-by-count":3,"title":["VA-Files vs. R*-Trees in Distance Join Queries"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Corral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"D\u2019Ermiliis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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. SIGMOD Conf., pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Jagadish, H., Kriegel, H.P., Sander, J.: Independent Quantization: an Index Compression Technique for High-Dimensional Data Spaces. In: Proc. ICDE Conf., pp. 577\u2013588 (2000)","DOI":"10.1109\/ICDE.2000.839456"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Braunmuller, B., Breuning, M.M., Kriegel, H.P.: High Performance Clustering based on Similarity Join. In: Proc. CIKM Conf., pp. 298\u2013305 (2000)","DOI":"10.1145\/354756.354832"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Kriegel, H.P.: A Cost Model and Index Architecture for the Similarity Join. In: Proc. ICDE Conf., pp. 411\u2013420 (2001)","DOI":"10.1109\/ICDE.2001.914854"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1109\/TMM.2002.1017736","volume":"4","author":"G.H. Cha","year":"2002","unstructured":"Cha, G.H., Chung, C.W.: The GC-tree: a High-Dimensional Index Structure for Similarity Search in Image Databases. Transactions on Multimedia\u00a04(2), 235\u2013247 (2002)","journal-title":"Transactions on Multimedia"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/6046.985556","volume":"4","author":"G.H. Cha","year":"2002","unstructured":"Cha, G.H., Zhu, X., Petkovic, D., Chung, C.W.: An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases. Transactions on Multimedia\u00a04(1), 76\u201387 (2002)","journal-title":"Transactions on Multimedia"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A. Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for Processing K-Closest-Pair Queries in Spatial Databases. Data and Knowledge Engineering Journal\u00a049(1), 67\u2013104 (2004)","journal-title":"Data and Knowledge Engineering Journal"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1093\/comjnl\/bxh060","volume":"48","author":"A. Corral","year":"2005","unstructured":"Corral, A., Vassilakopoulos, M.: On Approximate Algorithms for Distance-Based Queries using R-trees. The Computer Journal\u00a048(2), 220\u2013238 (2005)","journal-title":"The Computer Journal"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cui, B., Hu, J., Shen, H., Yu, C.: Adaptive Quantization of the High-Dimensional Data for Efficient KNN Processing. In: Proc. DASFAA Conf., pp. 302\u2013313 (2004)","DOI":"10.1007\/978-3-540-24571-1_27"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Dittrich, J.P., Seeger, B.: GESS: a Scalable Similarity-Join Algorithm for Mining Large Data Sets in High Dimensional Spaces. In: Proc. SIGKDD Conf., pp. 47\u201356 (2001)","DOI":"10.1145\/502512.502524"},{"issue":"3-4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and Effective Querying by Image Content. Journal of Intelligent Information System\u00a03(3-4), 231\u2013262 (1994)","journal-title":"Journal of Intelligent Information System"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Vector Approximation Based Indexing for Non-Uniform High Dimensional Data Sets. In: Proc. CIKM Conf., pp. 202\u2013209 (2000)","DOI":"10.1145\/354756.354820"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a Dynamic Index Structure for Spatial Searching. In: Proc. SIGMOD Conf., pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/69.842246","volume":"12","author":"N. Koudas","year":"2000","unstructured":"Koudas, N., Sevcik, K.C.: High Dimensional Similarity Joins: Algorithms and Performance Evaluation. Transactions on Knowledge and Data Engineering\u00a012(1), 3\u201318 (2000)","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"12_CR15","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, C., Protopapas, Z.: Fast Nearest Neighbor Search in Medical Images Databases. In: Proc. VLDB Conf., pp. 215\u2013226 (1996)"},{"key":"12_CR16","unstructured":"Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: C2P: Clustering based on Closest Pairs. In: Proc. VLDB Conf., pp. 331\u2013340 (2001)"},{"key":"12_CR17","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: an Index Structure for High-Dimensional Spaces using Relative Approximation. In: Proc. VLDB Conf., pp. 516\u2013526 (2000)"},{"key":"12_CR18","unstructured":"Shim, K., Srikant, R., Agrawal, R.: High-Dimensional Similarity Joins. In: Proc. of ICDE Conf., pp. 301\u2013311 (1997)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Weber, R., B\u00f6hm, K.: Trading Quality for Time with Nearest Neighbor Search. In: Proc. EDBT Conf., pp. 21\u201335 (2000)","DOI":"10.1007\/3-540-46439-5_2"},{"key":"12_CR20","unstructured":"Weber, R., Schek, H.J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. VLDB Conf., pp. 194\u2013205 (1998)"},{"key":"12_CR21","unstructured":"Web site: http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547686_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:57:56Z","timestamp":1619492276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547686_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285854","9783540318958"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11547686_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}