{"id":"https://openalex.org/W7160409509","doi":"https://doi.org/10.1145/3788852.3805596","title":"Fine-grained Complexity of Database Queries","display_name":"Fine-grained Complexity of Database Queries","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160409509","doi":"https://doi.org/10.1145/3788852.3805596"},"language":null,"primary_location":{"id":"doi:10.1145/3788852.3805596","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3788852.3805596","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion of the 45th Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3788852.3805596","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Department of Computer Science, Theory Institute, ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-1356-5177","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Theory Institute, ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"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":"18","last_page":"18"},"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.36890000104904175,"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.36890000104904175,"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.17399999499320984,"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.11819999665021896,"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/conjecture","display_name":"Conjecture","score":0.6037999987602234},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5813999772071838},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5044999718666077},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4909000098705292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48339998722076416},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4526999890804291},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4207000136375427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39660000801086426},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.3529999852180481}],"concepts":[{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6244999766349792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6173999905586243},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5044999718666077},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4207000136375427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39660000801086426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3546999990940094},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3529999852180481},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3368000090122223},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.3325999975204468},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.32179999351501465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.321399986743927},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C12439846","wikidata":"https://www.wikidata.org/wiki/Q4809258","display_name":"Database theory","level":3,"score":0.310699999332428},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C90329073","wikidata":"https://www.wikidata.org/wiki/Q914232","display_name":"Ask price","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3788852.3805596","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3788852.3805596","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion of the 45th Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3788852.3805596","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3788852.3805596","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion of the 45th Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W4390590950","https://openalex.org/W4405114273","https://openalex.org/W4411319869"],"related_works":[],"abstract_inverted_index":{"Fine-grained":[0],"complexity":[1,23],"theory":[2],"is":[3],"the":[4,21,29,35,45,59,61,66],"area":[5],"of":[6,24,76],"theoretical":[7],"computer":[8,77],"science":[9,78],"that":[10],"proves":[11],"conditional":[12,52],"lower":[13,53],"bounds.":[14,54],"Starting":[15],"from":[16],"a":[17,25],"popular":[18],"conjecture":[19],"about":[20],"time":[22],"core":[26],"problem":[27],"(e.g.,":[28],"Strong":[30],"Exponential":[31],"Time":[32],"Hypothesis":[33],"for":[34],"Satisfiability":[36],"problem),":[37],"we":[38],"can":[39],"design":[40],"fine-grained":[41],"reductions":[42],"to":[43,48],"transfer":[44],"conjectured":[46],"intractability":[47],"other":[49],"problems,":[50],"yielding":[51],"After":[55],"initial":[56],"results":[57],"in":[58],"90s,":[60],"field":[62],"has":[63],"matured":[64],"over":[65],"last":[67],"15":[68],"years,":[69],"demonstrating":[70],"its":[71],"usefulness":[72],"across":[73],"many":[74],"areas":[75],"including":[79],"graph":[80],"algorithms,":[81],"optimization,":[82],"computational":[83],"geometry,":[84],"and":[85],"string":[86],"processing.":[87]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-05-07T00:00:00"}