{"id":"https://openalex.org/W4416057703","doi":"https://doi.org/10.1145/3801899","title":"Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum","display_name":"Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W4416057703","doi":"https://doi.org/10.1145/3801899"},"language":"en","primary_location":{"id":"doi:10.1145/3801899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3801899","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2510.19197","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030337488","display_name":"Nofar Carmeli","orcid":"https://orcid.org/0000-0003-0673-5510"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nofar Carmeli","raw_affiliation_strings":["Inria, LIRMM, University of Montpellier, CNRS, Montpellier, France"],"raw_orcid":"https://orcid.org/0000-0003-0673-5510","affiliations":[{"raw_affiliation_string":"Inria, LIRMM, University of Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083668297","display_name":"Nikolaos Tziavelis","orcid":"https://orcid.org/0000-0001-8342-2177"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaos Tziavelis","raw_affiliation_strings":["UC Santa Cruz, Santa Cruz, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8342-2177","affiliations":[{"raw_affiliation_string":"UC Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":2,"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.01121076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"25"},"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.3310999870300293,"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.3310999870300293,"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.1509999930858612,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.09220000356435776,"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/conjunctive-query","display_name":"Conjunctive query","score":0.8600000143051147},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5738999843597412},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5509999990463257},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.531000018119812},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.482699990272522},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.47429999709129333},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45669999718666077},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4449999928474426},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.42089998722076416}],"concepts":[{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.8600000143051147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5773000121116638},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5738999843597412},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5509999990463257},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.531000018119812},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.503000020980835},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.482699990272522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48240000009536743},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.47429999709129333},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4359000027179718},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.40790000557899475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4032999873161316},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2935999929904938},{"id":"https://openalex.org/C59462968","wikidata":"https://www.wikidata.org/wiki/Q10361123","display_name":"Dichotomy","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.2508000135421753},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3801899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3801899","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2510.19197","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.19197","pdf_url":"https://arxiv.org/pdf/2510.19197","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2510.19197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.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":"pmh:oai:arXiv.org:2510.19197","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.19197","pdf_url":"https://arxiv.org/pdf/2510.19197","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416057703.pdf","grobid_xml":"https://content.openalex.org/works/W4416057703.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,26,40],"investigate":[1],"the":[2,19,29,42,61,90,115],"fine-grained":[3],"complexity":[4],"of":[5,37,44,60,73,92],"direct":[6,83],"access":[7],"to":[8,14,33,96],"Conjunctive":[9],"Query":[10],"(CQ)":[11],"answers":[12],"according":[13],"their":[15],"position,":[16],"ordered":[17],"by":[18,128],"minimum":[20],"(or":[21],"maximum)":[22],"value":[23],"between":[24],"attributes.":[25],"further":[27],"use":[28],"tools":[30],"we":[31,105],"develop":[32],"explore":[34],"a":[35,55,58,71,78,107],"wealth":[36],"related":[38],"tasks.":[39],"consider":[41],"task":[43],"ranked":[45],"enumeration":[46],"under":[47],"min/max":[48],"orders,":[49],"as":[50,52],"well":[51],"tasks":[53],"concerning":[54],"CQ":[56],"with":[57],"predicate":[59,86],"form":[62],"x":[63,76],"\u2264":[64],"min":[65],"X":[66,69],",":[67],"where":[68],"is":[70,77],"set":[72],"variables":[74],"and":[75,85,94],"single":[79],"variable:":[80],"counting,":[81],"enumeration,":[82],"access,":[84],"elimination":[87],"(i.e.,":[88],"transforming":[89],"pair":[91,99],"query":[93],"database":[95],"an":[97],"equivalent":[98],"without":[100],"min-predicates).":[101],"For":[102],"each":[103],"task,":[104],"establish":[106],"complete":[108],"dichotomy":[109],"for":[110],"self-join-free":[111],"CQs,":[112],"precisely":[113],"identifying":[114],"cases":[116],"that":[117],"are":[118],"solvable":[119],"in":[120],"near-ideal":[121],"time,":[122],"i.e.,":[123],"(quasi)linear":[124],"preprocessing":[125],"time":[126,132],"followed":[127],"constant":[129],"or":[130],"logarithmic":[131],"per":[133],"output.":[134]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-24T00:00:00"}