{"id":"https://openalex.org/W2141457448","doi":"https://doi.org/10.1109/cvpr.2004.429","title":"Reducing I/O Cost of Similarity Queries by Processing Several at a Time","display_name":"Reducing I/O Cost of Similarity Queries by Processing Several at a Time","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W2141457448","doi":"https://doi.org/10.1109/cvpr.2004.429","mag":"2141457448"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2004.429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2004.429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 Conference on Computer Vision and Pattern Recognition Workshop","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112133634","display_name":"Wolfgang M\u00fcller","orcid":null},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"W. Muller","raw_affiliation_strings":["LS AI 1, University of Bayreuth, Bayreuth, Germany","[University of Bayreuth, Germany]"],"affiliations":[{"raw_affiliation_string":"LS AI 1, University of Bayreuth, Bayreuth, Germany","institution_ids":["https://openalex.org/I54009628"]},{"raw_affiliation_string":"[University of Bayreuth, Germany]","institution_ids":["https://openalex.org/I54009628"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005937041","display_name":"Andreas Henrich","orcid":"https://orcid.org/0000-0002-5074-3254"},"institutions":[{"id":"https://openalex.org/I94626330","display_name":"University of Bamberg","ror":"https://ror.org/01c1w6d29","country_code":"DE","type":"education","lineage":["https://openalex.org/I94626330"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Henrich","raw_affiliation_strings":["Media Informatics, University of Bamberg, Bamberg, Germany","University of Bamberg; Germany"],"affiliations":[{"raw_affiliation_string":"Media Informatics, University of Bamberg, Bamberg, Germany","institution_ids":["https://openalex.org/I94626330"]},{"raw_affiliation_string":"University of Bamberg; Germany","institution_ids":["https://openalex.org/I94626330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112133634"],"corresponding_institution_ids":["https://openalex.org/I54009628"],"apc_list":null,"apc_paid":null,"fwci":0.9538,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76774942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"142","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8614577054977417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8606724739074707},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.6184980273246765},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.5462495684623718},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4699808657169342},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.4173327088356018},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41486066579818726},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.20963379740715027},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13585159182548523}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8614577054977417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8606724739074707},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.6184980273246765},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.5462495684623718},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4699808657169342},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.4173327088356018},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41486066579818726},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.20963379740715027},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13585159182548523},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvpr.2004.429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2004.429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 Conference on Computer Vision and Pattern Recognition Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W150620477","https://openalex.org/W1541459201","https://openalex.org/W1770616178","https://openalex.org/W1997841190","https://openalex.org/W2025376161","https://openalex.org/W2105022522","https://openalex.org/W2112401798","https://openalex.org/W2113782672","https://openalex.org/W2114443620","https://openalex.org/W2117281615","https://openalex.org/W2118269922","https://openalex.org/W2145789701","https://openalex.org/W2162362064","https://openalex.org/W2163534628","https://openalex.org/W2238624099"],"related_works":["https://openalex.org/W3024364549","https://openalex.org/W4206019083","https://openalex.org/W1949910768","https://openalex.org/W1480566255","https://openalex.org/W2254397067","https://openalex.org/W2013685631","https://openalex.org/W1610355325","https://openalex.org/W1882921205","https://openalex.org/W2129925734","https://openalex.org/W4387185219"],"abstract_inverted_index":{"Current":[0],"research":[1],"on":[2,11,40,93],"high-dimensional":[3],"indexing":[4,66],"structures":[5],"for":[6,15,24,52],"multimedia":[7],"retrieval":[8],"is":[9,33,37,45,55],"focused":[10],"obtaining":[12],"optimal":[13],"performance":[14,51],"single":[16,84],"k-NN":[17],"queries.":[18,31],"Within":[19],"this":[20],"paper,":[21],"we":[22,76],"argue":[23,48],"parallel":[25,53],"processing":[26,72],"of":[27,62,65,82,101],"multiple":[28,73],"nearest":[29],"neighbor":[30],"This":[32],"beneficial":[34],"when":[35],"there":[36],"heavy":[38],"load":[39],"the":[41,60,63,80],"server":[42],"and":[43,95],"efficiency":[44],"important.":[46],"We":[47,68,87],"that":[49,70],"query":[50,85],"queries":[54,74],"an":[56,98],"important":[57],"parameter":[58],"in":[59],"evaluation":[61],"usefulness":[64],"structures.":[67],"show":[69],"by":[71],"simultaneously":[75],"can":[77],"dramatically":[78],"reduce":[79],"cost":[81],"each":[83],"involved.":[86],"support":[88],"these":[89],"findings":[90],"via":[91],"experiments":[92],"VA-":[94],"inverted":[96],"VA-files,":[97],"improved":[99],"variant":[100],"VA-files.":[102]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}