{"id":"https://openalex.org/W52840101","doi":null,"title":"Algorithms for acyclic database schemes","display_name":"Algorithms for acyclic database schemes","publication_year":1981,"publication_date":"1981-09-09","ids":{"openalex":"https://openalex.org/W52840101","mag":"52840101"},"language":"en","primary_location":{"id":"mag:52840101","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/vldb/vldb81.html#Yannakakis81","pdf_url":null,"source":{"id":"https://openalex.org/S4306421142","display_name":"Very Large Data Bases","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Very Large Data Bases","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860","observed_orcids":["https://orcid.org/0000-0003-2857-1860"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2857-1860","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5043084405"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.4317,"has_fulltext":false,"cited_by_count":515,"citation_normalized_percentile":{"value":0.99164768,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"82","last_page":"94"},"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.9951000213623047,"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.9951000213623047,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.00039999998989515007,"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/join-dependencies","display_name":"join dependencies","score":0.7020000219345093},{"id":"https://openalex.org/keywords/functional-dependencies","display_name":"functional dependencies","score":0.9900000095367432},{"id":"https://openalex.org/keywords/database-decomposition","display_name":"database decomposition","score":0.5440000295639038},{"id":"https://openalex.org/keywords/dependency-inference","display_name":"dependency inference","score":0.8190000057220459},{"id":"https://openalex.org/keywords/efficient-algorithms","display_name":"efficient algorithms","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.8215131759643555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7889659404754639},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.7816450595855713},{"id":"https://openalex.org/C40683218","wikidata":"https://www.wikidata.org/wiki/Q5260625","display_name":"Dependency theory (database theory)","level":4,"score":0.7015998959541321},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.6670229434967041},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6131659746170044},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5434361696243286},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5173937082290649},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.43013542890548706},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.42368483543395996},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4170229136943817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3966577649116516},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.35592007637023926},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.2639358937740326},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17022573947906494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16297614574432373},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07672828435897827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:52840101","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/vldb/vldb81.html#Yannakakis81","pdf_url":null,"source":{"id":"https://openalex.org/S4306421142","display_name":"Very Large Data Bases","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Very Large Data Bases","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W235476604","https://openalex.org/W1774916018","https://openalex.org/W1967992696","https://openalex.org/W1968137129","https://openalex.org/W1975714036","https://openalex.org/W1981597405","https://openalex.org/W1985581502","https://openalex.org/W2001605229","https://openalex.org/W2006564766","https://openalex.org/W2006772093","https://openalex.org/W2015611106","https://openalex.org/W2023663289","https://openalex.org/W2032386524","https://openalex.org/W2039610696","https://openalex.org/W2053741160","https://openalex.org/W2056660085","https://openalex.org/W2057773300","https://openalex.org/W2075035440","https://openalex.org/W2110810394","https://openalex.org/W2135105491","https://openalex.org/W2162068127","https://openalex.org/W2165467455","https://openalex.org/W3094133439"],"related_works":["https://openalex.org/W2628596753","https://openalex.org/W2148417962","https://openalex.org/W2134483537","https://openalex.org/W2104498537","https://openalex.org/W2046652577","https://openalex.org/W2046649829","https://openalex.org/W2039610696","https://openalex.org/W2034674470","https://openalex.org/W2033325972","https://openalex.org/W2029448190","https://openalex.org/W2027519504","https://openalex.org/W2026745535","https://openalex.org/W2011039300","https://openalex.org/W2004485491","https://openalex.org/W1991477862","https://openalex.org/W1989783863","https://openalex.org/W1985581502","https://openalex.org/W1979514837","https://openalex.org/W1579803282","https://openalex.org/W1558832481"],"abstract_inverted_index":{"Many":[0],"real-world":[1],"situations":[2],"can":[3],"be":[4],"captured":[5],"by":[6],"a":[7,13,18,29],"set":[8],"of":[9,17],"functional":[10],"dependencies":[11],"and":[12,63],"single":[14],"join":[15,25],"dependency":[16,26,66],"particular":[19],"form":[20],"called":[21],"acyclic":[22,36],"[B..].":[23],"The":[24],"corresponds":[27],"to":[28,45],"natural":[30],"decomposition":[31],"into":[32],"meaningfull":[33],"objects":[34],"(an":[35],"database":[37],"scheme).":[38],"Our":[39],"purpose":[40],"in":[41,49],"this":[42,50],"paper":[43],"is":[44],"describe":[46],"efficient":[47],"algorithms":[48],"setting":[51],"for":[52,65],"various":[53],"problems,":[54],"such":[55],"as":[56],"computing":[57],"projections,":[58],"minimizing":[59],"joins,":[60],"inferring":[61],"dependencies,":[62],"testing":[64],"satisfaction.":[67]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":30},{"year":2015,"cited_by_count":25},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":17}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}
