{"id":"https://openalex.org/W7135181402","doi":"https://doi.org/10.48550/arxiv.2603.11402","title":"Faster Relational Algorithms Using Geometric Data Structures","display_name":"Faster Relational Algorithms Using Geometric Data Structures","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135181402","doi":"https://doi.org/10.48550/arxiv.2603.11402"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11402","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.2603.11402","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114419945","display_name":"Aryan Esmailpour","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Esmailpour, Aryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015883931","display_name":"Stavros Sintos","orcid":"https://orcid.org/0000-0002-2114-8886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sintos, Stavros","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.47909998893737793,"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.47909998893737793,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.17249999940395355,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.05559999868273735,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/relational-database","display_name":"Relational database","score":0.7960000038146973},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.5185999870300293},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5062999725341797},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5026000142097473},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.4896000027656555},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.47360000014305115},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4652000069618225},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.44209998846054077},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4260999858379364}],"concepts":[{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.7960000038146973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6690000295639038},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.5185999870300293},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5062999725341797},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.4896000027656555},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.47360000014305115},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4652000069618225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4611999988555908},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4124999940395355},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38749998807907104},{"id":"https://openalex.org/C24394798","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database management system","level":3,"score":0.3675999939441681},{"id":"https://openalex.org/C12439846","wikidata":"https://www.wikidata.org/wiki/Q4809258","display_name":"Database theory","level":3,"score":0.36329999566078186},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C95916125","wikidata":"https://www.wikidata.org/wiki/Q840540","display_name":"Relational algebra","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C54239708","wikidata":"https://www.wikidata.org/wiki/Q1329910","display_name":"View","level":3,"score":0.3409000039100647},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C16739119","wikidata":"https://www.wikidata.org/wiki/Q5139948","display_name":"Codd's theorem","level":5,"score":0.2962000072002411},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.29339998960494995},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26980000734329224},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.26190000772476196}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11402","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.2603.11402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11402","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimization":[0],"tasks":[1],"over":[2,122],"relational":[3,44,85,106,123,163,194],"data,":[4],"such":[5],"as":[6,76],"clustering,":[7],"often":[8],"suffer":[9],"from":[10],"the":[11,22,37,50,53,72,77,91,94,101,112,131,136,149,160,176,193],"prohibitive":[12],"cost":[13],"of":[14,52,79,93,100,109,130,169],"join":[15,54,81,150],"operations,":[16],"which":[17],"are":[18],"necessary":[19,137],"to":[20,43,49,67,142,188],"access":[21],"full":[23],"dataset.":[24],"While":[25],"geometric":[26,65,144],"data":[27,45,73],"structures":[28],"like":[29],"BBD":[30,102],"trees":[31],"yield":[32],"fast":[33],"approximation":[34,178],"algorithms":[35,70,157],"in":[36,83,171,192],"standard":[38],"computational":[39],"setting,":[40],"their":[41],"application":[42],"remains":[46],"unclear":[47],"due":[48],"size":[51],"output.":[55],"In":[56],"this":[57],"paper,":[58],"we":[59,125,155],"introduce":[60],"a":[61,80,84,97,167],"framework":[62],"that":[63,158],"leverages":[64],"insights":[66],"design":[68],"faster":[69],"when":[71],"is":[74,90,182],"stored":[75],"results":[78],"query":[82,145],"database.":[86],"Our":[87,180],"core":[88],"contribution":[89],"development":[92],"RBBD":[95,113,132],"tree,":[96,114,133],"randomized":[98],"variant":[99],"tree":[103],"tailored":[104],"for":[105,162],"settings.":[107],"Instead":[108],"completely":[110],"constructing":[111],"by":[115,166],"leveraging":[116],"efficient":[117,128],"sampling":[118],"and":[119,184],"counting":[120],"techniques":[121],"joins,":[124],"enable":[126],"on-the-fly":[127],"expansion":[129],"maintaining":[134,175],"only":[135],"parts.":[138],"This":[139],"allows":[140],"us":[141],"simulate":[143],"procedures":[146],"without":[147],"materializing":[148],"result.":[151],"As":[152],"an":[153],"application,":[154],"present":[156],"improve":[159],"state-of-the-art":[161],"$k$-center/means/median":[164],"clustering":[165],"factor":[168],"$k$":[170],"running":[172],"time":[173],"while":[174],"same":[177],"guarantees.":[179],"method":[181],"general":[183],"can":[185],"be":[186],"applied":[187],"various":[189],"optimization":[190],"problems":[191],"setting.":[195]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-14T00:00:00"}