{"id":"https://openalex.org/W7138304675","doi":"https://doi.org/10.48550/arxiv.2603.14754","title":"Towards Parameterized Hardness on Maintaining Conjunctive Queries","display_name":"Towards Parameterized Hardness on Maintaining Conjunctive Queries","publication_year":2026,"publication_date":"2026-03-16","ids":{"openalex":"https://openalex.org/W7138304675","doi":"https://doi.org/10.48550/arxiv.2603.14754"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.14754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14754","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.14754","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129725722","display_name":"Qichen Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang, Qichen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5129725722"],"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.35920000076293945,"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.35920000076293945,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.2531999945640564,"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/T11269","display_name":"Algorithms and Data Compression","score":0.16869999468326569,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8745999932289124},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7684000134468079},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6323000192642212},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6312000155448914},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5616999864578247},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.484499990940094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47429999709129333},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4578000009059906}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8745999932289124},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7684000134468079},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6323000192642212},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6312000155448914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5656999945640564},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5616999864578247},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47429999709129333},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4578000009059906},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41940000653266907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39750000834465027},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.38119998574256897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3625999987125397},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.34709998965263367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3328999876976013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3237999975681305},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25540000200271606},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.14754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14754","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.14754","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14754","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":"article"},"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":{"We":[0,67,92],"investigate":[1],"the":[2,8,40,43,51,78,85,89,120,131,151],"fine-grained":[3,95],"complexity":[4,80],"of":[5,10,42,56,61,81,133,173],"dynamically":[6],"maintaining":[7,102,126,167],"result":[9],"fixed":[11],"self-join":[12],"free":[13],"conjunctive":[14,83],"queries":[15,24],"under":[16],"single-tuple":[17],"updates.":[18],"Prior":[19],"work":[20],"shows":[21],"that":[22,99],"free-connex":[23,127,176],"can":[25],"be":[26],"maintained":[27],"in":[28,200],"update":[29,110,183],"time":[30,111,184],"$O(|D|^\u03b4)$":[31],"for":[32,63,125,166],"some":[33],"$\u03b4\\in":[34],"[0.5,":[35],"1]$,":[36],"where":[37],"$|D|$":[38],"is":[39,156],"size":[41],"current":[44,134],"database.":[45],"However,":[46],"a":[47,82,103,148,170],"gap":[48,70],"remains":[49],"between":[50],"best":[52],"known":[53],"upper":[54,157],"bound":[55,195],"$O(|D|)$":[57],"and":[58,88,129,161,196],"lower":[59,96,123,144,194],"bounds":[60,97,124],"$\u03a9(|D|^{0.5-\u03b5})$":[62],"any":[64,100],"$\u03b5\\ge":[65],"0$.":[66],"narrow":[68],"this":[69],"by":[71,159],"introducing":[72],"two":[73],"structural":[74],"parameters":[75,107],"to":[76],"quantify":[77],"dynamic":[79],"query:":[84],"height":[86,174],"$k$":[87,140],"dimension":[90],"$d$.":[91],"establish":[93],"new":[94],"showing":[98],"algorithm":[101,165,179],"query":[104],"with":[105,186],"these":[106],"must":[108],"incur":[109],"$\u03a9(|D|^{1-1/\\max(k,d)-\u03b5})$,":[112],"unless":[113],"widely":[114],"believed":[115],"conjectures":[116],"fail.":[117],"These":[118],"yield":[119],"first":[121],"super-$\\sqrt{|D|}$":[122],"queries,":[128,169],"suggest":[130],"tightness":[132],"algorithms":[135],"when":[136],"considering":[137],"arbitrarily":[138],"large":[139],"and~$d$.":[141],"Complementing":[142],"our":[143,192],"bounds,":[145],"we":[146],"identify":[147],"data-dependent":[149],"parameter,":[150],"generalized":[152],"$H$-index":[153],"$h(D)$,":[154],"which":[155],"bounded":[158],"$|D|^{1/d}$,":[160],"design":[162],"an":[163,181],"efficient":[164],"star":[168],"common":[171],"class":[172],"2":[175],"queries.":[177],"The":[178],"achieves":[180],"instance-specific":[182,198],"$O(h(D)^{d-1})$":[185],"linear":[187],"space":[188],"$O(|D|)$.":[189],"This":[190],"matches":[191],"parameterized":[193],"provides":[197],"performance":[199],"favorable":[201],"cases.":[202]},"counts_by_year":[],"updated_date":"2026-03-18T06:31:55.123368","created_date":"2026-03-18T00:00:00"}