{"id":"https://openalex.org/W7136543684","doi":"https://doi.org/10.48550/arxiv.2603.12560","title":"Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries","display_name":"Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7136543684","doi":"https://doi.org/10.48550/arxiv.2603.12560"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.12560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2603.12560","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129452419","display_name":"Xiao Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Xiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129594926","display_name":"Jinchao Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Jinchao","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/T10317","display_name":"Advanced Database Systems and Queries","score":0.5612000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.5612000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.1673000007867813,"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/T11719","display_name":"Data Quality and Management","score":0.08560000360012054,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5651999711990356},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4941999912261963},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48330000042915344},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4828999936580658},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4814999997615814},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.48019999265670776},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46810001134872437},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4023999869823456}],"concepts":[{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5651999711990356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5117999911308289},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4828999936580658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48179998993873596},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.48019999265670776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47749999165534973},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4178999960422516},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3199999928474426},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2874000072479248},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.12560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2603.12560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Uniform":[0],"sampling":[1,26,97],"and":[2,27,89,99,149],"approximate":[3,17],"counting":[4,28,102],"are":[5,42,170],"fundamental":[6,57,81],"primitives":[7],"for":[8,30,38,52,80,163],"modern":[9],"database":[10],"applications,":[11],"ranging":[12],"from":[13,56],"query":[14,18],"optimization":[15],"to":[16],"processing.":[19],"While":[20,147],"recent":[21],"breakthroughs":[22],"have":[23],"established":[24],"optimal":[25,78],"algorithms":[29,79,169],"full":[31],"join":[32],"queries,":[33,40,85,165],"a":[34,94,100,158],"significant":[35],"gap":[36],"remains":[37],"join-project":[39,84],"which":[41,127],"ubiquitous":[43],"in":[44,172],"real-world":[45],"workloads.":[46],"The":[47],"state-of-the-art":[48],"``propose-and-verify''":[49],"framework":[50],"\\cite{chen2020random}":[51],"these":[53],"queries":[54,151],"suffers":[55],"inefficiencies,":[58],"often":[59],"yielding":[60],"prohibitive":[61],"complexity":[62,124],"when":[63],"projections":[64],"significantly":[65,159],"reduce":[66],"the":[67,75,109,112,116,140,144],"output":[68],"size.":[69],"In":[70],"this":[71],"paper,":[72],"we":[73,104,138,156],"present":[74],"first":[76],"asymptotically":[77],"classes":[82],"of":[83,111,118,143],"including":[86],"matrix,":[87],"star,":[88],"chain":[90,164],"queries.":[91],"By":[92],"leveraging":[93],"novel":[95],"rejection-based":[96],"strategy":[98],"hybrid":[101],"reduction,":[103],"achieve":[105],"polynomial":[106],"speedups":[107],"over":[108],"state":[110],"art.":[113],"We":[114],"establish":[115,157],"optimality":[117],"our":[119],"results":[120],"through":[121],"matching":[122],"communication":[123],"lower":[125,161],"bounds,":[126],"hold":[128],"even":[129],"against":[130],"algebraic":[131],"techniques":[132],"like":[133],"fast":[134],"matrix":[135,148],"multiplication.":[136],"Finally,":[137],"delineate":[139],"theoretical":[141],"limits":[142],"problem":[145],"space.":[146],"star":[150],"admit":[152],"efficient":[153],"sublinear-time":[154],"algorithms,":[155],"stronger":[160],"bound":[162],"demonstrating":[166],"that":[167],"sublinear":[168],"impossible":[171],"general.":[173]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-17T00:00:00"}