{"id":"https://openalex.org/W1984868905","doi":"https://doi.org/10.1145/1055558.1055587","title":"Weighted hypertree decompositions and optimal query plans","display_name":"Weighted hypertree decompositions and optimal query plans","publication_year":2004,"publication_date":"2004-06-14","ids":{"openalex":"https://openalex.org/W1984868905","doi":"https://doi.org/10.1145/1055558.1055587","mag":"1984868905"},"language":"en","primary_location":{"id":"doi:10.1145/1055558.1055587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055587","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-third 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/A5011519788","display_name":"Francesco Scarcello","orcid":"https://orcid.org/0000-0001-7765-1563"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Scarcello","raw_affiliation_strings":["Universit\u00e0 della Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087340443","display_name":"Gianluigi Greco","orcid":"https://orcid.org/0000-0002-5799-6828"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluigi Greco","raw_affiliation_strings":["Universit\u00e0 della Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002604860","display_name":"Nicola Leone","orcid":"https://orcid.org/0000-0002-9742-1252"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Leone","raw_affiliation_strings":["Universit\u00e0 della Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7204,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84394938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"210","last_page":"221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","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/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9783453345298767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.615821361541748},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5569331049919128},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5375098586082458},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.527600109577179},{"id":"https://openalex.org/keywords/materialized-view","display_name":"Materialized view","score":0.5253733396530151},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.49405649304389954},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4394080936908722},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.43472611904144287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38141441345214844},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2269706428050995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16159436106681824},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.09057188034057617}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9783453345298767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.615821361541748},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5569331049919128},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5375098586082458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.527600109577179},{"id":"https://openalex.org/C98199447","wikidata":"https://www.wikidata.org/wiki/Q2445044","display_name":"Materialized view","level":4,"score":0.5253733396530151},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.49405649304389954},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4394080936908722},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.43472611904144287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38141441345214844},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2269706428050995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16159436106681824},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.09057188034057617},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0},{"id":"https://openalex.org/C54239708","wikidata":"https://www.wikidata.org/wiki/Q1329910","display_name":"View","level":3,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C148840519","wikidata":"https://www.wikidata.org/wiki/Q1049878","display_name":"Database design","level":2,"score":0.0},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"score":0.0},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1055558.1055587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1055558.1055587","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-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.3258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.3258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~dechter/ics-280/spring-2007/papers/p210-scarcello.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W282367566","https://openalex.org/W1500313707","https://openalex.org/W1537809898","https://openalex.org/W1558832481","https://openalex.org/W1565494300","https://openalex.org/W1685626019","https://openalex.org/W1853742281","https://openalex.org/W1965022641","https://openalex.org/W1977735896","https://openalex.org/W1978282744","https://openalex.org/W1979514837","https://openalex.org/W1986736553","https://openalex.org/W1989783863","https://openalex.org/W1992810975","https://openalex.org/W1993920925","https://openalex.org/W1996878052","https://openalex.org/W2004485491","https://openalex.org/W2009020789","https://openalex.org/W2018798767","https://openalex.org/W2026745535","https://openalex.org/W2027519504","https://openalex.org/W2029448190","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2039610696","https://openalex.org/W2046649829","https://openalex.org/W2046652577","https://openalex.org/W2072838038","https://openalex.org/W2075233028","https://openalex.org/W2079057772","https://openalex.org/W2080192364","https://openalex.org/W2089857781","https://openalex.org/W2115822498","https://openalex.org/W2134483537","https://openalex.org/W2148417962","https://openalex.org/W2151310484","https://openalex.org/W2153597031","https://openalex.org/W2158985358","https://openalex.org/W2160983447","https://openalex.org/W2162621793","https://openalex.org/W2167634979","https://openalex.org/W2293896416","https://openalex.org/W2337098149","https://openalex.org/W2397672765","https://openalex.org/W2400283444","https://openalex.org/W4241108585","https://openalex.org/W4254380579","https://openalex.org/W6697212920","https://openalex.org/W6776626634"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2008536061","https://openalex.org/W2280659633","https://openalex.org/W1979091081","https://openalex.org/W2091522522","https://openalex.org/W4302801230","https://openalex.org/W4308505582","https://openalex.org/W2959649007","https://openalex.org/W4288283333","https://openalex.org/W1524736198"],"abstract_inverted_index":{"Hypertree":[0],"width":[1],"[22,":[2],"25]":[3],"is":[4,217],"a":[5,224,268],"measure":[6],"of":[7,10,12,16,25,54,64,72,78,106,153,254,258,267],"the":[8,23,32,52,62,70,76,104,142,151,155,159,190,196,252,264,290],"degree":[9],"cyclicity":[11],"hypergraphs.":[13],"A":[14],"number":[15,71],"relevant":[17],"problems":[18],"from":[19],"different":[20],"areas,":[21],"e.g.,":[22],"evaluation":[24,53,230],"conjunctive":[26,247],"queries":[27,281],"in":[28,35,48,74,110,169,206],"database":[29,55],"theory":[30],"or":[31],"constraint":[33],"satisfaction":[34],"AI,":[36],"are":[37,88,123,274],"tractable":[38],"when":[39],"their":[40],"underlying":[41],"hypergraphs":[42],"have":[43,58,138],"bounded":[44],"hypertree":[45,108,121,156,164,201,212,238],"width.":[46],"However,":[47,177],"practical":[49],"contexts":[50],"like":[51],"queries,":[56],"we":[57,68,102,137,174,178,222,250],"more":[59],"information":[60,140],"besides":[61,145],"structure":[63],"queries.":[65,248],"For":[66,209],"instance,":[67],"know":[69],"tuples":[73],"relations,":[75],"selectivity":[77],"attributes":[79],"and":[80,93,194,232],"so":[81],"on.":[82],"In":[83],"fact,":[84],"all":[85],"commercial":[86,269,291],"query-optimizers":[87],"based":[89],"on":[90,141,189,195],"quantitative":[91,118],"methods":[92,116],"do":[94],"not":[95,184],"care":[96],"about":[97],"structural":[98,114],"properties.In":[99],"this":[100,215,259],"paper,":[101],"define":[103],"notion":[105],"weighted":[107,200,237],"decomposition,":[109],"order":[111],"to":[112,235],"combine":[113],"decomposition":[115],"with":[117,125,263],"approaches.":[119],"Weighted":[120],"decompositions":[122,157,202,239],"equipped":[124],"cost":[126,192,225],"functions,":[127,214],"that":[128,227],"can":[129,203],"be":[130,204],"used":[131],"for":[132,240,245,278],"modelling":[133],"many":[134,170,283],"situations":[135],"where":[136],"further":[139],"given":[143],"problem,":[144],"its":[146],"hypergraph":[147],"representation.":[148],"We":[149,166],"analyze":[150],"complexity":[152],"computing":[154],"having":[158],"smallest":[160],"weights,":[161],"called":[162],"minimal":[163],"decompositions.":[165],"show":[167,233],"that,":[168,180],"cases,":[171],"adding":[172],"weights":[173],"loose":[175],"tractability.":[176],"prove":[179],"under":[181],"some":[182,210,279],"-":[183,187],"very":[185,275],"severe":[186],"restrictions":[188],"allowed":[191],"functions":[193],"target":[197],"hypertrees,":[198],"optimal":[199],"computed":[205],"polynomial":[207],"time.":[208],"easier":[211],"weighting":[213],"problem":[216],"also":[218],"highly":[219],"parallelizable.":[220],"Then,":[221],"provide":[223],"function":[226],"models":[228],"query":[229,243,260,265],"costs":[231],"how":[234],"exploit":[236],"determining":[241],"(logical)":[242],"plans":[244],"answering":[246],"Finally,":[249],"present":[251],"results":[253,273],"an":[255],"experimental":[256],"comparison":[257],"optimization":[261,266],"technique":[262,287],"DBMS.":[270],"These":[271],"preliminary":[272],"promising,":[276],"as":[277],"large":[280],"(with":[282],"joins)":[284],"our":[285],"hybrid":[286],"clearly":[288],"outperforms":[289],"optimizer.":[292]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}