{"id":"https://openalex.org/W4407694792","doi":"https://doi.org/10.14778/3704965.3704973","title":"A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition","display_name":"A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition","publication_year":2024,"publication_date":"2024-09-01","ids":{"openalex":"https://openalex.org/W4407694792","doi":"https://doi.org/10.14778/3704965.3704973"},"language":"en","primary_location":{"id":"doi:10.14778/3704965.3704973","doi":"https://doi.org/10.14778/3704965.3704973","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3704965.3704973","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-2","poland-20","russia-white-list-1","vabb-shw"],"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 VLDB Endowment","raw_type":"journal-article"},"volume":null,"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/A5111733992","display_name":"Zongyan He","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Zongyan He","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X","observed_orcids":["https://orcid.org/0000-0002-9738-827X"]},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.3905,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62934215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"17","issue":"13","first_page":"4655","last_page":"4667"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8241999745368958,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8241999745368958,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.14869999885559082,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.004399999976158142,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/hypertree-decomposition","display_name":"hypertree decomposition","score":0.7699999809265137},{"id":"https://openalex.org/keywords/hypertree-width","display_name":"hypertree width","score":0.890999972820282},{"id":"https://openalex.org/keywords/conjunctive-queries","display_name":"conjunctive queries","score":0.9580000042915344},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9070000052452087},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8980000019073486},{"id":"https://openalex.org/keywords/query-processing","display_name":"query processing","score":0.8109999895095825},{"id":"https://openalex.org/keywords/database-management-systems","display_name":"database management systems","score":0.39899998903274536}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.6895589828491211},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6872994899749756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4607921540737152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4378500282764435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3931349515914917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3689233362674713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33112019300460815},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09727424383163452},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.09565946459770203},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0859605073928833},{"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/C192939610","wikidata":"https://www.wikidata.org/wiki/Q188444","display_name":"Differential geometry","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3704965.3704973","doi":"https://doi.org/10.14778/3704965.3704973","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3704965.3704973","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","norway-2","poland-20","russia-white-list-1","vabb-shw"],"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 VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W53273316","https://openalex.org/W1516019649","https://openalex.org/W1594550269","https://openalex.org/W1759086394","https://openalex.org/W1969259020","https://openalex.org/W1991477862","https://openalex.org/W2000015739","https://openalex.org/W2008134141","https://openalex.org/W2033325972","https://openalex.org/W2046649829","https://openalex.org/W2050100848","https://openalex.org/W2104498537","https://openalex.org/W2218651731","https://openalex.org/W2423871547","https://openalex.org/W2547902904","https://openalex.org/W2624220145","https://openalex.org/W2950924921","https://openalex.org/W3015632420","https://openalex.org/W3084963370","https://openalex.org/W3159367332","https://openalex.org/W3185640417","https://openalex.org/W3212567773","https://openalex.org/W4236157893","https://openalex.org/W4244579861","https://openalex.org/W4281724122","https://openalex.org/W4282583266","https://openalex.org/W4379135714","https://openalex.org/W4379390531"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2134402143","https://openalex.org/W5383638","https://openalex.org/W2362150722","https://openalex.org/W4313304827","https://openalex.org/W4386827690","https://openalex.org/W1560870503","https://openalex.org/W2051932001","https://openalex.org/W2158985358","https://openalex.org/W156119379"],"abstract_inverted_index":{"Conjunctive":[0],"queries":[1,73,76],"(":[2,161],"CQ":[3,15,23,29,46,86],"s)":[4],"have":[5,55],"been":[6,56],"widely":[7],"used":[8],"in":[9,12,217,228,231],"database":[10,233],"systems":[11],"which":[13],"acyclic":[14,31,72],"s":[16,24,47],"can":[17,87],"be":[18,88],"computed":[19],"efficiently,":[20],"whereas":[21],"cyclic":[22,85],"may":[25],"not.":[26],"Here,":[27],"a":[28,43,83,146,180,188,218],"is":[30,37,63,74,80,95,126,133,157,179],"if":[32,91,137],"its":[33,92],"hypergraph":[34],"representation":[35],"H":[36],"acyclic.":[38],"In":[39,153,172],"order":[40],"to":[41,135,169,196],"find":[42],"class":[44,70],"of":[45,60,71,208],"that":[48,177],"are":[49,98],"\"mildly":[50],"cyclic\",":[51],"hypertree":[52,67,78,93,107,111,117,122,140,148],"decompositions":[53],"(HDs)":[54],"studied.":[57],"The":[58,69,120],"quality":[59],"such":[61,101],"HDs":[62],"by":[64,124,142,211],"the":[65,75,127,138,154,204],"so-called":[66],"width.":[68],"whose":[77],"width":[79,94,123,141,149],"1,":[81],"and":[82,131,185,206,222],"mildly":[84],"processed":[89],"efficiently":[90],"bounded.":[96],"There":[97],"several":[99],"HDs,":[100,221],"as":[102,114,116],"tree":[103],"decomposition":[104,108,112,118],"(TD),":[105],"generalized":[106],"(GHD),":[109],"fractional":[110],"(FHD),":[113],"well":[115],"(HD).":[119],"minimum":[121,139],"FHD":[125,143,198],"smallest":[128],"among":[129],"all,":[130],"it":[132],"NP-complete":[134],"check":[136],"exists":[144],"for":[145,183,220],"given":[147,216],"at":[150],"most":[151],"k.":[152],"literature,":[155],"there":[156,178],"no":[158],"dynamic":[159],"programming":[160],"DP":[162,181,194],")":[163],"algorithm":[164,167,182,190,195,210],"or":[165],"branch-&-bound":[166,189],"reported":[168],"compute":[170,197],"FHD.":[171],"this":[173],"paper,":[174],"we":[175,186,223],"show":[176],"FHD,":[184],"give":[187],"based":[191],"on":[192],"our":[193,209,226],"with":[199],"upper/lower":[200],"bounds.":[201],"We":[202],"confirm":[203,225],"effectiveness":[205],"efficiency":[207],"testing":[212],"all":[213],"3,648":[214],"hypergraphs":[215],"benchmark":[219],"also":[224],"approach":[227],"query":[229],"evaluation":[230],"real":[232],"systems.":[234]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}