{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T05:53:13Z","timestamp":1726206793947},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s11042-010-0614-z","type":"journal-article","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T22:27:33Z","timestamp":1287008853000},"page":"261-275","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic optimization of queries in pivot-based indexing"],"prefix":"10.1007","volume":"60","author":[{"given":"Svein Erik","family":"Bratsberg","sequence":"first","affiliation":[]},{"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,9]]},"reference":[{"key":"614_CR1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/1244002.1244123","volume-title":"SAC \u201907: proceedings of the 2007 ACM symposium on applied computing","author":"GB Baioco","year":"2007","unstructured":"Baioco GB, Traina AJM, Traina C Jr (2007) An effective cost model for similarity queries in metric spaces. In: SAC \u201907: proceedings of the 2007 ACM symposium on applied computing. New York, NY, USA, ACM pp 527\u2013528"},{"issue":"8","key":"614_CR2","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1002\/cyto.a.20586","volume":"73A","author":"T Bernas","year":"2008","unstructured":"Bernas T, Asem EK, Robinson JP, Rajwa B (2008) Quadratic form: a robust metric for quantitative comparison of flow cytometric histograms. Cytometry, Part A 73A(8):715\u2013726","journal-title":"Cytometry, Part A"},{"key":"614_CR3","first-page":"217","volume-title":"Proceedings of the 7th international conference on database theory. Lecture Notes In Computer Science, vol 1540","author":"K Beyer","year":"1999","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful? In: Proceedings of the 7th international conference on database theory. Lecture Notes In Computer Science, vol 1540. Springer-Verlag, London, UK, pp 217\u2013235"},{"issue":"14","key":"614_CR4","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos B, Navarro G, Ch\u00e1vez E (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn Lett 24(14):2357\u20132366","journal-title":"Pattern Recogn Lett"},{"key":"614_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/SISAP.2008.12","volume-title":"SISAP \u201908: proceedings of the first international workshop on similarity search and applications (sisap 2008)","author":"B Bustos","year":"2008","unstructured":"Bustos B, Pedreira O, Brisaboa N (2008) A dynamic pivot selection technique for similarity search. In: SISAP \u201908: proceedings of the first international workshop on similarity search and applications (sisap 2008). Washington, DC, USA, IEEE Computer Society, pp 105\u2013112"},{"key":"614_CR6","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez E, Marroqu\u00edn JL, Baeza-Yates R (1999) Spaghettis: an array based algorithm for similarity queries in metric spaces. In: Proceedings of the string processing and information retrieval symposium & international workshop on groupware (SPIRE). IEEE Computer Society, pp 38\u201346","DOI":"10.1109\/SPIRE.1999.796576"},{"issue":"3","key":"614_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E, Navarro G, Baeza-Yates R, Luis J (2001) Searching in metric spaces. ACM Comput Surv 33(3):273\u2013321","journal-title":"ACM Comput Surv"},{"key":"614_CR8","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M, Zezula P (1998) A cost model for similarity queries in metric spaces. In: Proc. 17th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS\u201998), pp 59\u201368","DOI":"10.1145\/275487.275495"},{"key":"614_CR9","doi-asserted-by":"crossref","unstructured":"Figueroa K, Ch\u00e1vez E, Navarro G, Paredes R (2006) On the least cost for proximity searching in metric spaces. In: \u00c0lvarez C, Serna M (eds) Proceedings of the 5th international workshop on experimental algorithms. Lecture notes in computer science, vol 4007. Springer, pp 279\u2013290","DOI":"10.1007\/11764298_26"},{"key":"614_CR10","unstructured":"Figuerora K, Navarro G, Chavez E (2010) SISAP: metric space library. http:\/\/sisap.org\/Home.html"},{"issue":"1","key":"614_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.patrec.2006.06.012","volume":"28","author":"K Fredriksson","year":"2007","unstructured":"Fredriksson K (2007) Engineering efficient metric indexes. Pattern Recogn Lett 28(1):75\u201384","journal-title":"Pattern Recogn Lett"},{"key":"614_CR12","doi-asserted-by":"crossref","unstructured":"Hetland ML (2009) The basic principels of metric indexing. In: Coello Coello C, Dehuri S, Ghosh S (eds) Swarm intelligence for multi-objective problems in data mining, 2009. Published by Springer-Verlag, Springer-Verlag","DOI":"10.1007\/978-3-642-03625-5_9"},{"key":"614_CR13","doi-asserted-by":"crossref","unstructured":"Ioannidis Y (2003) The history of histograms (abridged). In: VLDB \u20192003: proceedings of the 29th international conference on very large data bases. VLDB Endowment, pp 19\u201330","DOI":"10.1016\/B978-012722442-8\/50011-2"},{"key":"614_CR14","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-45151-X_34","volume-title":"WAIM \u201900: proceedings of the first international conference on web-age information management","author":"M Ishikawa","year":"2000","unstructured":"Ishikawa M, Chen H, Furuse K, Yu JX, Ohbo N (2000) Mb+tree: a dynamically updatable metric index for similarity searches. In: WAIM \u201900: proceedings of the first international conference on web-age information management. Springer-Verlag, London, UK, pp 356\u2013373"},{"issue":"2","key":"614_CR15","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan K-L, Yu C, Zhang R (2005) idistance: an adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364\u2013397","journal-title":"ACM Trans Database Syst"},{"key":"614_CR16","doi-asserted-by":"crossref","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) R-Trees: theory and applications (advanced information and knowledge processing), 1st edn. Springer","DOI":"10.1007\/978-1-84628-293-5"},{"issue":"1","key":"614_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L Mic\u00f3","year":"1994","unstructured":"Mic\u00f3 L, Oncina J, Vidal E (1994) A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recogn Lett 15(1):9\u201317","journal-title":"Pattern Recogn Lett"},{"key":"614_CR18","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/978-3-540-69507-3_37","volume-title":"SOFSEM \u201907: proceedings of the 33rd conference on current trends in theory and practice of computer science","author":"O Pedreira","year":"2007","unstructured":"Pedreira O, Brisaboa NR (2007) Spatial selection of sparse pivots for similarity search in metric spaces. In: SOFSEM \u201907: proceedings of the 33rd conference on current trends in theory and practice of computer science. Springer-Verlag, Berlin, Heidelberg, pp 434\u2013445"},{"issue":"2","key":"614_CR19","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/971697.602294","volume":"14","author":"G Piatetsky-Shapiro","year":"1984","unstructured":"Piatetsky-Shapiro G, Connell C (1984) Accurate estimation of the number of tuples satisfying a condition. SIGMOD Rec 14(2):256\u2013276","journal-title":"SIGMOD Rec"},{"issue":"3","key":"614_CR20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"EV Ruiz","year":"1986","unstructured":"Ruiz EV (1986) An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recogn Lett 4(3):145\u2013157","journal-title":"Pattern Recogn Lett"},{"key":"614_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/582095.582099","volume-title":"SIGMOD \u201979: proceedings of the 1979 ACM SIGMOD international conference on management of data","author":"PG Selinger","year":"1979","unstructured":"Selinger PG, Astrahan MM, Chamberlin DD, Lorie RA, Price TG (1979) Access path selection in a relational database management system. In: SIGMOD \u201979: proceedings of the 1979 ACM SIGMOD international conference on management of data. ACM, New York, NY, USA, pp 23\u201334"},{"issue":"2","key":"614_CR22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C Traina","year":"2002","unstructured":"Traina C Jr, Traina A, Faloutsos C, Seeger B (2002) Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans Knowl Data Eng 14(2):244\u2013260","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"614_CR23","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina","year":"2007","unstructured":"Traina C Jr, Filho RF, Traina AJ, Vieira MR, Faloutsos C (2007) The omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J 16(4):483\u2013505","journal-title":"VLDB J"},{"key":"614_CR24","unstructured":"Zhang D (2008) Neustore: a simple java package for the construction of disk-based, paginated, and buffered indices. http:\/\/www.ccs.neu.edu\/home\/donghui\/research\/neustore\/"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s11042-010-0614-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T12:50:05Z","timestamp":1559739005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-010-0614-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["614"],"URL":"https:\/\/doi.org\/10.1007\/s11042-010-0614-z","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,9]]}}}