{"id":"https://openalex.org/W2018618445","doi":"https://doi.org/10.1145/1353343.1353388","title":"Efficient online top-K retrieval with arbitrary similarity measures","display_name":"Efficient online top-K retrieval with arbitrary similarity measures","publication_year":2008,"publication_date":"2008-03-25","ids":{"openalex":"https://openalex.org/W2018618445","doi":"https://doi.org/10.1145/1353343.1353388","mag":"2018618445"},"language":"en","primary_location":{"id":"doi:10.1145/1353343.1353388","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1353343.1353388","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1353343.1353388","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th international conference on Extending database technology: Advances in database technology","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1353343.1353388","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065031367","display_name":"Prasad Deshpande","orcid":"https://orcid.org/0000-0001-6389-533X"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prasad M Deshpande","raw_affiliation_strings":["IBM India Research Lab, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM India Research Lab, Bangalore, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113740386","display_name":"P Deepak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak P","raw_affiliation_strings":["IBM India Research Lab, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM India Research Lab, Bangalore, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083401163","display_name":"Krishna Kummamuru","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna Kummamuru","raw_affiliation_strings":["IBM India Research Lab, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM India Research Lab, Bangalore, India","institution_ids":["https://openalex.org/I4210103279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210103279"],"apc_list":null,"apc_paid":null,"fwci":3.5503,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93058057,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"356","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.998199999332428,"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.9979000091552734,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7024556994438171},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.6031783223152161},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.5783958435058594},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3281410038471222},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2786594033241272}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7024556994438171},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.6031783223152161},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.5783958435058594},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3281410038471222},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2786594033241272},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1353343.1353388","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1353343.1353388","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1353343.1353388","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th international conference on Extending database technology: Advances in database technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.1659","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://deepakp7.googlepages.com/edbt2008crc.pdf","raw_type":"text"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/cc040956-971d-4fb2-b5ee-151aabe22d17","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/cc040956-971d-4fb2-b5ee-151aabe22d17","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Deshpande, P, Padmanabhan, D & Kummamuru, K 2008, Efficient online top-K retrieval with arbitrary similarity measures. in EDBT 2008, 11th International Conference on Extending Database Technology, Nantes, France. pp. 356-367, EDBT 2008, Nantes, France, 25/03/2008. < https://sites.google.com/site/deepakp7/EDBT2008CRC.pdf?attredirects=0 >","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/1353343.1353388","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1353343.1353388","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1353343.1353388","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th international conference on Extending database technology: Advances in database technology","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2018618445.pdf","grobid_xml":"https://content.openalex.org/works/W2018618445.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W182666420","https://openalex.org/W299839057","https://openalex.org/W1535279741","https://openalex.org/W1603845670","https://openalex.org/W1672197616","https://openalex.org/W1850437073","https://openalex.org/W1985986751","https://openalex.org/W2018177083","https://openalex.org/W2049644877","https://openalex.org/W2069421480","https://openalex.org/W2083039049","https://openalex.org/W2084812512","https://openalex.org/W2090682579","https://openalex.org/W2091967195","https://openalex.org/W2099797738","https://openalex.org/W2123544675","https://openalex.org/W2129461758","https://openalex.org/W2149328866","https://openalex.org/W2164312060","https://openalex.org/W2165046835","https://openalex.org/W2168960477","https://openalex.org/W2666600683","https://openalex.org/W2982720039","https://openalex.org/W3009784374","https://openalex.org/W7001816316"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"The":[0,143],"top-k":[1,121,135],"retrieval":[2,136],"problem":[3],"requires":[4],"finding":[5],"k":[6],"objects":[7,17],"most":[8,19,54],"similar":[9],"to":[10,43,92,110,133,178],"a":[11,155],"given":[12],"query":[13],"object.":[14],"Similarities":[15],"between":[16,36],"are":[18,39,83],"often":[20],"computed":[21],"as":[22,72],"aggregated":[23],"similarities":[24,35],"of":[25,66,104,113,174,181,191,197,201],"their":[26],"attribute":[27,37,82],"values.":[28],"We":[29,123,159],"consider":[30],"the":[31,34,53,64,95,114,128,146,168,182],"case":[32,200],"where":[33],"values":[38],"arbitrary":[40,60],"(non-metric),":[41],"due":[42,177],"which":[44],"standard":[45],"space":[46,116],"partitioning":[47],"indexes":[48],"cannot":[49],"be":[50],"used.":[51],"Among":[52],"popular":[55],"techniques":[56],"that":[57,75,77,107,148,161],"can":[58,108],"handle":[59],"similarity":[61,78],"measures":[62],"is":[63],"family":[65],"threshold":[67,169],"algorithms.":[68],"These":[69],"were":[70],"designed":[71],"middleware":[73],"algorithms":[74,171],"assume":[76],"lists":[79,91],"for":[80],"each":[81],"available":[84],"and":[85,130],"focus":[86],"on":[87],"efficiently":[88],"merging":[89],"these":[90],"arrive":[93],"at":[94],"results.":[96],"In":[97],"this":[98],"paper,":[99],"we":[100],"explore":[101],"multi-dimensional":[102],"indexing":[103,126],"non-metric":[105],"spaces":[106],"lead":[109],"efficient":[111,179],"pruning":[112,180],"search":[115,183],"utilizing":[117],"inter-attribute":[118],"relationships,":[119],"during":[120],"computation.":[122],"propose":[124],"an":[125,131,140,195],"structure,":[127],"AL-Tree":[129],"algorithm":[132,163],"do":[134],"using":[137],"it":[138,186],"in":[139,172,189,199],"online":[141],"fashion.":[142],"ALTree":[144],"exploits":[145],"fact":[147],"many":[149],"real":[150],"world":[151],"attributes":[152],"come":[153],"from":[154],"small":[156],"value":[157],"space.":[158,184],"show":[160],"our":[162],"performs":[164],"much":[165],"better":[166],"than":[167],"based":[170],"terms":[173,190],"computational":[175],"cost":[176],"Further,":[185],"out-performs":[187],"them":[188],"IOs":[192],"by":[193],"upto":[194],"order":[196],"magnitude":[198],"dense":[202],"datasets.":[203]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}