{"id":"https://openalex.org/W7167099683","doi":"https://doi.org/10.48550/arxiv.2607.00727","title":"Approximate Nearest Neighbor Search with Graph Range Filters","display_name":"Approximate Nearest Neighbor Search with Graph Range Filters","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7167099683","doi":"https://doi.org/10.48550/arxiv.2607.00727"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00727","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139885478","display_name":"Qian Tao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao, Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103984676","display_name":"Yi Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Yuntao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139922350","display_name":"Yongxin Tong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tong, Yongxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139855617","display_name":"Yu Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5376999974250793,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.5376999974250793,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.17470000684261322,"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/T11106","display_name":"Data Management and Algorithms","score":0.0723000019788742,"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/hash-function","display_name":"Hash function","score":0.7156999707221985},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5806999802589417},{"id":"https://openalex.org/keywords/bloom-filter","display_name":"Bloom filter","score":0.5712000131607056},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.5340999960899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.526199996471405},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.4894999861717224},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.46720001101493835},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.46230000257492065},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.42809998989105225},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.41920000314712524}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7156999707221985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6517999768257141},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5806999802589417},{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.5712000131607056},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.5340999960899353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.526199996471405},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.4894999861717224},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.46230000257492065},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4537999927997589},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.41920000314712524},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.38920000195503235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3815999925136566},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.3756999969482422},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3662000000476837},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.3416999876499176},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C4969071","wikidata":"https://www.wikidata.org/wiki/Q7316353","display_name":"Result set","level":3,"score":0.3409000039100647},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.3230000138282776},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C5274069","wikidata":"https://www.wikidata.org/wiki/Q2285707","display_name":"Categorical variable","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00727","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Vector":[0],"databases":[1],"have":[2],"become":[3],"a":[4,35,80,88,99],"fundamental":[5],"component":[6],"for":[7,164],"high-dimensional":[8],"vector":[9],"retrieval":[10],"in":[11,57,87,136,147],"artificial":[12],"intelligence":[13],"applications.":[14],"Recent":[15],"research":[16],"has":[17],"focused":[18],"on":[19,176],"filtered":[20,67],"approximate":[21],"nearest":[22,31],"neighbor":[23],"search":[24],"(filtered":[25],"ANN),":[26],"which":[27,53],"involves":[28],"retrieving":[29],"the":[30,74,84,118,141,151,160,165,202,206],"vectors":[32,76],"that":[33,140,180],"satisfy":[34],"given":[36],"attribute-based":[37],"filter.":[38],"However,":[39],"existing":[40],"filters":[41,116,131],"are":[42,126],"generally":[43],"limited":[44,198],"to":[45,111,132,188],"numerical":[46],"range":[47,71,115,153],"constraints":[48],"or":[49],"categorical":[50],"existence":[51],"checks,":[52],"restricts":[54],"their":[55],"applicability":[56],"more":[58],"complex,":[59],"real-world":[60],"scenarios.":[61],"In":[62],"this":[63,94],"paper,":[64],"we":[65,96,155],"investigate":[66],"ANN":[68],"using":[69],"graph":[70,114,152],"filters,":[72,154],"where":[73],"retrieved":[75],"must":[77],"be":[78],"within":[79],"specified":[81],"distance":[82],"from":[83],"query":[85,134,142,166],"node":[86,143],"predefined":[89],"filter":[90],"graph.":[91],"To":[92],"address":[93],"problem,":[95],"propose":[97],"DLH,":[98],"Distance-aware":[100],"Labeling":[101],"index":[102,163],"with":[103,197],"Hashing":[104],"compression.":[105],"DLH":[106,157,181],"creates":[107],"distance-aware":[108],"labeling":[109,124],"sets":[110,125],"enable":[112],"efficient":[113],"via":[117],"simplified":[119],"set":[120],"intersection":[121],"operations.":[122],"Large":[123],"further":[127],"compressed":[128],"into":[129],"Bloom":[130],"improve":[133,184],"efficiency":[135],"DLH.":[137],"Furthermore,":[138],"recognizing":[139],"is":[144],"always":[145],"involved":[146],"in-range":[148],"queries":[149],"of":[150,205],"enhance":[156],"by":[158,186],"memoizing":[159],"intermediate":[161],"hashing":[162],"node,":[167],"yielding":[168],"an":[169],"optimized":[170],"version":[171],"called":[172],"DLH-M.":[173],"Experimental":[174],"evaluations":[175],"diverse":[177],"datasets":[178],"demonstrate":[179],"and":[182,190],"DLH-M":[183],"throughput":[185],"up":[187],"70.3%,":[189],"could":[191],"maintain":[192],"recall":[193],"rates":[194],"over":[195],"98.5%":[196],"extra":[199],"storage,":[200],"validating":[201],"practical":[203],"availability":[204],"proposed":[207],"solution.":[208]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}