{"id":"https://openalex.org/W7162524202","doi":"https://doi.org/10.48550/arxiv.2605.26474","title":"Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]","display_name":"Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162524202","doi":"https://doi.org/10.48550/arxiv.2605.26474"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.26474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26474","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.26474","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137188555","display_name":"Yingfan Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yingfan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137152962","display_name":"Tong Wu","orcid":"https://orcid.org/0000-0003-4680-0129"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Tong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137183433","display_name":"Jiadong Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Jiadong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137112112","display_name":"Yang Zhao","orcid":"https://orcid.org/0009-0009-9915-9794"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137104271","display_name":"Jeffrey Xu Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Jeffrey Xu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137114272","display_name":"Jiangtao Cui","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cui, Jiangtao","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/T11106","display_name":"Data Management and Algorithms","score":0.14380000531673431,"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.14380000531673431,"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.12309999763965607,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.09759999811649323,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/tree-traversal","display_name":"Tree traversal","score":0.7394000291824341},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6998000144958496},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6330000162124634},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.534600019454956},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.47360000014305115},{"id":"https://openalex.org/keywords/containment","display_name":"Containment (computer programming)","score":0.421999990940094},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.41690000891685486},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.38190001249313354}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7394000291824341},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6998000144958496},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6330000162124634},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.534600019454956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4912000000476837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4790000021457672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4745999872684479},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.47360000014305115},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.38190001249313354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.373199999332428},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.34790000319480896},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.32600000500679016},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.32499998807907104},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31690001487731934},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2773999869823456},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.26474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26474","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.26474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26474","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.40772518515586853,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Approximate":[0],"nearest":[1],"neighbor":[2],"(ANN)":[3],"search":[4,25,165,253,261],"with":[5,26,51,166,182,240],"range":[6,54,62,92,98,167],"filters":[7],"has":[8,146],"recently":[9],"garnered":[10],"significant":[11],"attention.":[12],"This":[13],"paper":[14],"delves":[15],"into":[16],"a":[17,32,52,60,141,189],"generalized":[18],"form":[19],"of":[20,143,163,229],"this":[21],"problem,":[22],"i.e.,":[23],"ANN":[24,38,164],"exact":[27],"range-range":[28],"(RR)":[29],"predicates":[30,201],"on":[31,223],"range-valued":[33],"attribute,":[34],"named":[35],"RR":[36,86,102,184,200],"filtering":[37],"(RRANN).":[39],"Specifically,":[40],"given":[41],"$n$":[42],"vectors":[43,76,82],"in":[44,149,232],"$\\mathbb{R}^d$,":[45],"each":[46],"vector":[47],"$v_i$":[48],"is":[49,271],"associated":[50],"numeric":[53],"$[l_i,":[55,99],"r_i]$,":[56],"symbolizing":[57],"aspects":[58],"like":[59],"price":[61,153],"or":[63,118,132,140,155],"time":[64,156,215],"interval.":[65],"An":[66],"RRANN":[67,145,233],"query":[68,91],"$(v_q,":[69],"l_q,":[70],"r_q)$":[71],"aims":[72],"at":[73,273],"finding":[74],"$k$":[75],"closest":[77],"to":[78,152,179,216,237,264],"$v_q$":[79],"within":[80],"the":[81,90,96,177,227,241,245,265],"satisfying":[83],"an":[84],"arbitrary":[85,183,199],"predicate":[87,103],"defined":[88],"between":[89],"$[l_q,":[93,119],"r_q]$":[94,117],"and":[95,158,208,213,255,259],"object":[97],"r_i]$.":[100],"The":[101],"remains":[104],"unspecified,":[105],"enabling":[106],"user-defined":[107],"conditions.":[108],"It":[109,196],"may":[110],"encompass":[111],"containment":[112],"($[l_i,":[113],"r_i]":[114],"\\subseteq":[115,121],"[l_q,":[116],"r_q]":[120],"[l_i,":[122],"r_i]$),":[123],"overlap":[124],"($l_i":[125],"\\le":[126,128,130,134,136,138],"l_q":[127],"r_i":[129],"r_q$":[131],"$l_q":[133],"l_i":[135],"r_q":[137],"r_i$),":[139],"disjunction":[142],"them.":[144],"broad":[147],"applications":[148],"queries":[150,181],"related":[151],"ranges":[154],"intervals,":[157],"it":[159],"generalizes":[160],"existing":[161,170],"variants":[162],"filters.":[168],"However,":[169],"dedicated":[171],"approaches":[172],"for":[173,219],"these":[174],"problems":[175],"lack":[176],"capacity":[178],"support":[180],"predicates.":[185],"Hence,":[186],"we":[187],"introduce":[188],"new":[190],"approach,":[191],"labeled":[192],"multi-segment":[193],"tree":[194],"graph.":[195],"efficiently":[197],"handles":[198],"by":[202],"avoiding":[203],"traversal":[204],"through":[205],"non-predicate-satisfied":[206],"nodes,":[207],"keeps":[209],"equivalent":[210],"index":[211],"size":[212],"construction":[214],"state-of-the-art":[217,267],"methods":[218],"RFANN.":[220],"Extensive":[221],"experiments":[222],"real-world":[224],"data":[225],"demonstrate":[226],"efficacy":[228],"our":[230,248],"approach":[231,249],"queries,":[234],"achieving":[235],"up":[236],"12.5x":[238],"speedups":[239],"same":[242],"accuracy":[243],"as":[244],"baselines.":[246],"Moreover,":[247],"attains":[250],"comparable":[251],"RFANN":[252],"performance":[254,262],"notably":[256],"superior":[257],"IFANN":[258],"TSANN":[260],"compared":[263],"respective":[266],"approaches.":[268],"Our":[269],"code":[270],"available":[272],"https://github.com/FanEDG/MSTG.":[274]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}