{"id":"https://openalex.org/W7161819978","doi":"https://doi.org/10.48550/arxiv.2605.19197","title":"Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing","display_name":"Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161819978","doi":"https://doi.org/10.48550/arxiv.2605.19197"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.19197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19197","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.2605.19197","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dasgupta, Subhasis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dasgupta, Subhasis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057846313","display_name":"Amarnath Gupta","orcid":"https://orcid.org/0000-0003-0897-120X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Amarnath","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5976999998092651,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5976999998092651,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.15449999272823334,"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.1348000019788742,"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/predicate","display_name":"Predicate (mathematical logic)","score":0.6729999780654907},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6243000030517578},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.5934000015258789},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5631999969482422},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5598000288009644},{"id":"https://openalex.org/keywords/query-plan","display_name":"Query plan","score":0.4959999918937683},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.48570001125335693},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.4392000138759613}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7333999872207642},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6729999780654907},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6243000030517578},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.5934000015258789},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5631999969482422},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5598000288009644},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.4959999918937683},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.48570001125335693},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4223000109195709},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.41909998655319214},{"id":"https://openalex.org/C2776321320","wikidata":"https://www.wikidata.org/wiki/Q857525","display_name":"Annotation","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40529999136924744},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C9357733","wikidata":"https://www.wikidata.org/wiki/Q6878417","display_name":"Missing data","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3160000145435333},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.31540000438690186},{"id":"https://openalex.org/C33762810","wikidata":"https://www.wikidata.org/wiki/Q461671","display_name":"Data integrity","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3043999969959259},{"id":"https://openalex.org/C201932085","wikidata":"https://www.wikidata.org/wiki/Q642514","display_name":"Online analytical processing","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27480000257492065},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.19197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19197","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.2605.19197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19197","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":{"Natural":[0],"language":[1],"(NL)":[2],"interfaces":[3],"to":[4,8,21,79],"databases":[5],"broaden":[6],"access":[7],"heterogeneous":[9,122],"data":[10],"but":[11],"often":[12],"yield":[13],"many":[14,108],"ambiguous":[15],"intermediate":[16],"logical":[17],"plans":[18],"(ILPs)":[19],"due":[20],"uncertain":[22],"operator":[23],"scope":[24],"and":[25,52,98,101],"predicate":[26],"semantics.":[27],"Many":[28],"candidates":[29],"are":[30],"infeasible":[31,71],"because":[32],"of":[33],"type":[34],"mismatches,":[35],"missing":[36],"bindings,":[37],"or":[38],"engine-specific":[39],"constraints.":[40],"We":[41],"address":[42],"this":[43],"challenge":[44],"with":[45,110],"\\emph{feasibility":[46],"constraints}":[47],"for":[48,117],"detecting":[49],"local":[50],"inconsistencies":[51],"introduce":[53],"the":[54],"Packed":[55],"Plan":[56],"Forest":[57],"(PPF)":[58],"a":[59,114],"polynomially":[60],"bounded":[61,96],"structure":[62],"that":[63,104],"compactly":[64],"encodes":[65],"all":[66],"feasible":[67],"ILPs":[68,109],"while":[69],"pruning":[70],"ones":[72],"early.":[73],"Extending":[74],"packed":[75],"parse":[76],"forest":[77],"ideas":[78],"multi-model":[80],"settings,":[81],"PPF":[82],"supports":[83],"efficient":[84],"feasibility":[85],"analysis":[86],"through":[87],"annotated":[88],"operators.":[89],"Formal":[90],"results":[91],"show":[92],"polynomial":[93],"size":[94],"under":[95],"arity":[97],"annotation":[99],"vocabularies,":[100],"experiments":[102],"confirm":[103],"PPFs":[105],"capture":[106],"exponentially":[107],"minimal":[111],"overhead,":[112],"establishing":[113],"scalable":[115],"foundation":[116],"NL-to-DB":[118],"query":[119],"planning":[120],"across":[121],"systems":[123]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-21T00:00:00"}