{"id":"https://openalex.org/W2088904455","doi":"https://doi.org/10.1145/1376916.1376959","title":"Tree-width and functional dependencies in databases","display_name":"Tree-width and functional dependencies in databases","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2088904455","doi":"https://doi.org/10.1145/1376916.1376959","mag":"2088904455"},"language":"en","primary_location":{"id":"doi:10.1145/1376916.1376959","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033412587","display_name":"Isolde Adler","orcid":"https://orcid.org/0000-0002-9667-9841"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Isolde Adler","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","[Humboldt Universitat zu Berlin, Berlin, Germany]"],"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"[Humboldt Universitat zu Berlin, Berlin, Germany]","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033412587"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":1.493,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82435488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"311","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8290692567825317},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.7738438844680786},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.7394718527793884},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7102482318878174},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.6920067071914673},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6159570217132568},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6042084693908691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5240195989608765},{"id":"https://openalex.org/keywords/functional-dependency","display_name":"Functional dependency","score":0.49776673316955566},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.49304959177970886},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47898268699645996},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44915854930877686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4292541444301605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38891151547431946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3737713694572449},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.34958434104919434},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.11611756682395935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1046082079410553}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8290692567825317},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.7738438844680786},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.7394718527793884},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7102482318878174},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.6920067071914673},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6159570217132568},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6042084693908691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5240195989608765},{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.49776673316955566},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.49304959177970886},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47898268699645996},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44915854930877686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4292541444301605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38891151547431946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3737713694572449},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.34958434104919434},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.11611756682395935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1046082079410553},{"id":"https://openalex.org/C192939610","wikidata":"https://www.wikidata.org/wiki/Q188444","display_name":"Differential geometry","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1376916.1376959","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W99828349","https://openalex.org/W156119379","https://openalex.org/W1482193060","https://openalex.org/W1967265779","https://openalex.org/W1979514837","https://openalex.org/W2008536061","https://openalex.org/W2033325972","https://openalex.org/W2057256946","https://openalex.org/W2065023965","https://openalex.org/W2134483537","https://openalex.org/W2150339067","https://openalex.org/W2479567345","https://openalex.org/W2492526546","https://openalex.org/W2798588639","https://openalex.org/W3127823229","https://openalex.org/W4285719527","https://openalex.org/W6628898632","https://openalex.org/W6750258011"],"related_works":["https://openalex.org/W2949978915","https://openalex.org/W2480025839","https://openalex.org/W2119213574","https://openalex.org/W1973538949","https://openalex.org/W2628596753","https://openalex.org/W2950294966","https://openalex.org/W1988026822","https://openalex.org/W4292713356","https://openalex.org/W2134402143","https://openalex.org/W3169968423"],"abstract_inverted_index":{"Conjunctive":[0],"query":[1],"(CQ)":[2],"evaluation":[3,35],"on":[4],"relational":[5],"databases":[6],"is":[7,133],"NP-complete":[8],"in":[9,26,42,153],"general.":[10],"Several":[11],"restrictions,":[12],"like":[13],"bounded":[14,17,75,86],"tree-width":[58,61],"and":[16,59,65,98,100,104,114],"hypertree-width,":[18,99],"allow":[19],"polynomial":[20,154],"time":[21],"evaluations.We":[22],"extend":[23],"the":[24,27,45,54],"framework":[25],"presence":[28],"of":[29,44,56,83],"functional":[30],"dependencies.":[31],"Our":[32],"exteAnded":[33],"CQ":[34],"problem":[36,47],"has":[37,127],"a":[38,109,124],"concise":[39],"equivalent":[40],"formulation":[41],"terms":[43],"homomorphism":[46],"(HOM)":[48],"for":[49,62,95,101,117,140,144],"non-relational":[50],"structures.":[51],"We":[52,135],"introduce":[53],"notions":[55],"closure":[87,105,141,151],"hyperclosure":[96,102,128],"arbitrary":[63],"structures,":[64],"we":[66,147],"prove":[67,136],"that":[68,116],"HOM":[69],"(and":[70],"hence":[71],"CQ)":[72],"restricted":[73],"to":[74],"(hyper)closure":[76],"becomes":[78],"tractable.":[79],"There":[80],"are":[81],"classes":[82],"structures":[84],"with":[85],"but":[89],"unbounded":[90],"tree-width.":[91,142],"Similar":[92],"statements":[93],"hold":[94],"tree-width.It":[106],"follows":[107],"from":[108],"result":[110],"by":[111],"Gottlob,":[112],"Miklos,":[113],"Schwentick":[115],"fixed":[118],"k":[119,146],"\u2265":[120],"2,":[121],"deciding":[122],"whether":[123],"given":[125,145],"structure":[126],"at":[130],"most":[131],"k,":[132],"NP-complete.":[134],"an":[137],"analogous":[138],"statement":[139],"Nevertheless,":[143],"can":[148],"approximate":[149],"k-bounded":[150],"time.":[155]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}