{"id":"https://openalex.org/W7135412203","doi":"https://doi.org/10.46298/lmcs-22(1:24)2026","title":"Direct Access for Conjunctive Queries with Negations","display_name":"Direct Access for Conjunctive Queries with Negations","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7135412203","doi":"https://doi.org/10.46298/lmcs-22(1:24)2026"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-22(1:24)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:24)2026","pdf_url":"https://lmcs.episciences.org/17722/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/17722/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Florent Capelli","orcid":"https://orcid.org/0000-0002-2842-8223"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Florent Capelli","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Nofar Carmeli","orcid":"https://orcid.org/0000-0003-0673-5510"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nofar Carmeli","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Oliver Irwin","orcid":"https://orcid.org/0000-0002-8986-1506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oliver Irwin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sylvain Salvati","orcid":"https://orcid.org/0000-0002-6230-0098"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sylvain Salvati","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.92434339,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 22, Issue 1","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.4447999894618988,"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.4447999894618988,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1762000024318695,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.13330000638961792,"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/conjunctive-query","display_name":"Conjunctive query","score":0.9595999717712402},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7591000199317932},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6315000057220459},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5281000137329102},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5063999891281128},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.47519999742507935},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.42320001125335693},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.4090999960899353}],"concepts":[{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.9595999717712402},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7591000199317932},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6315000057220459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6128000020980835},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5063999891281128},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.47519999742507935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4641999900341034},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.42320001125335693},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.4090999960899353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3986999988555908},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.36160001158714294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34279999136924744},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C98199447","wikidata":"https://www.wikidata.org/wiki/Q2445044","display_name":"Materialized view","level":4,"score":0.31380000710487366},{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.28519999980926514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28450000286102295},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.27639999985694885}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-22(1:24)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:24)2026","pdf_url":"https://lmcs.episciences.org/17722/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-22(1:24)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:24)2026","pdf_url":"https://lmcs.episciences.org/17722/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7135412203.pdf","grobid_xml":"https://content.openalex.org/works/W7135412203.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,6,9,59,80,138,158,200],"conjunctive":[2,50,122,126,180,204,224,239,259,270],"query":[3],"$Q$":[4,16],"and":[5,92,232,261],"database":[7,78],"$D$,":[8],"direct":[10,60,155,197,274],"access":[11,61,156,198],"to":[12,46,62,117,173,192],"the":[13,20,28,74,77,89,98,104,107,118,167,170,175,194,207,212,217,220,227,254,262],"answers":[14,64],"of":[15,22,76,106,120,140,169,178,196,203,222,256,264],"over":[17],"$D$":[18],"is":[19,40,135],"operation":[21],"returning,":[23],"given":[24,93],"an":[25,53],"index":[26],"$k$,":[27],"$k$-th":[29],"answer":[30,176],"for":[31,58,65,199],"some":[32,66],"order":[33],"on":[34,97,103,137,166,183],"its":[35],"answers.":[36],"While":[37],"this":[38,110,151],"problem":[39],"$\\#\\mathcal{P}$-hard":[41],"in":[42,73,219],"general":[43],"with":[44],"respect":[45],"combined":[47,188],"complexity,":[48],"many":[49],"queries":[51,127,181,240,244,260,271],"have":[52],"underlying":[54],"structure":[55,105],"that":[56,69,124,128,142,150,242,253],"allows":[57],"their":[63,184],"lexicographical":[67],"ordering":[68],"takes":[70],"polylogarithmic":[71],"time":[72,82,100,160],"size":[75,168],"after":[79,157],"polynomial":[81,159],"precomputation.":[83],"Previous":[84],"work":[85],"has":[86],"precisely":[87],"characterised":[88],"tractable":[90,154,214,273],"classes":[91,215],"fine-grained":[94],"lower":[95],"bounds":[96,165],"precomputation":[99],"needed":[101,172],"depending":[102,182],"query.":[108],"In":[109,249],"paper,":[111],"we":[112,210,230,251],"generalise":[113,231],"these":[114],"tractability":[115,195,235],"results":[116,187,236],"case":[119,221],"signed":[121,179],"queries,":[123],"is,":[125,243],"may":[129],"contain":[130],"negative":[131,238,258,269],"atoms.":[132,248],"Our":[133],"technique":[134],"based":[136],"class":[139,152,202,255,263],"circuits":[141],"can":[143],"represent":[144,174],"relational":[145],"data.":[146],"We":[147,162],"first":[148],"show":[149,252],"supports":[153],"preprocessing.":[161],"then":[163],"give":[164],"circuit":[171],"set":[177,267],"structure.":[185],"Both":[186],"together":[189],"allow":[190],"us":[191],"prove":[193],"large":[201],"queries.":[205,225],"On":[206,226],"one":[208],"hand,":[209,229],"recover":[211],"known":[213,234],"from":[216],"literature":[218],"positive":[223],"other":[228],"unify":[233],"about":[237],"--":[241],"having":[245],"only":[246],"negated":[247],"particular,":[250],"$\u03b2$-acyclic":[257],"bounded":[265],"nest":[266],"width":[268],"admit":[272],"access.":[275]},"counts_by_year":[],"updated_date":"2026-03-16T07:19:36.451410","created_date":"2025-10-10T00:00:00"}