{"id":"https://openalex.org/W3089228796","doi":"https://doi.org/10.1145/3414080.3414090","title":"Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting","display_name":"Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting","publication_year":2020,"publication_date":"2020-09-08","ids":{"openalex":"https://openalex.org/W3089228796","doi":"https://doi.org/10.1145/3414080.3414090","mag":"3089228796"},"language":"en","primary_location":{"id":"doi:10.1145/3414080.3414090","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3414080.3414090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming","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/A5072769917","display_name":"Maribel Fern\u00e1ndez","orcid":"https://orcid.org/0000-0001-8325-5815"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Maribel Fernandez","raw_affiliation_strings":["King's College London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King's College London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101858369","display_name":"J\u00e1nos Varga","orcid":"https://orcid.org/0000-0001-5386-4652"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Janos Varga","raw_affiliation_strings":["King's College London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King's College London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":0.3242,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63189206,"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":"1","last_page":"14"},"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.9980000257492065,"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.9980000257492065,"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.9951000213623047,"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"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7779418230056763},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5968067646026611},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5295751094818115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32708847522735596},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27764183282852173}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7779418230056763},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5968067646026611},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5295751094818115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32708847522735596},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27764183282852173}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3414080.3414090","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3414080.3414090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/2a5064bd-fcb1-4c58-9089-59a512306420","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/2a5064bd-fcb1-4c58-9089-59a512306420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fernandez , M & Varga , J 2020 , Finding candidate keys and 3NF via strategic port graph rewriting . in Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020 - Part of BOPL 2020 - Bologna Federated Conference on Programming Languages 2020 . , 3414090 , ACM International Conference Proceeding Series , 22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020 - Part of 2020 Bologna Federated Conference on Programming Languages, BOPL 2020 , Bologna, Online , Italy , 8/09/2020 . https://doi.org/10.1145/3414080.3414090","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1608965","https://openalex.org/W180578187","https://openalex.org/W190356767","https://openalex.org/W1502422810","https://openalex.org/W1538939518","https://openalex.org/W1554120798","https://openalex.org/W1569403765","https://openalex.org/W1607768517","https://openalex.org/W1635078070","https://openalex.org/W1974167925","https://openalex.org/W1992810975","https://openalex.org/W2002222122","https://openalex.org/W2012644520","https://openalex.org/W2023663289","https://openalex.org/W2032386524","https://openalex.org/W2035652450","https://openalex.org/W2064529725","https://openalex.org/W2071678949","https://openalex.org/W2082283048","https://openalex.org/W2115829075","https://openalex.org/W2117671567","https://openalex.org/W2119631806","https://openalex.org/W2131966463","https://openalex.org/W2162621793","https://openalex.org/W2778347405","https://openalex.org/W2950738991","https://openalex.org/W2969864432","https://openalex.org/W3144582725","https://openalex.org/W4230919050","https://openalex.org/W4300056133"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2120204135","https://openalex.org/W2139396251","https://openalex.org/W1796293478","https://openalex.org/W1577544887","https://openalex.org/W2168276503","https://openalex.org/W1573537275","https://openalex.org/W2105713543","https://openalex.org/W174435416"],"abstract_inverted_index":{"We":[0,51],"present":[1],"new":[2],"algorithms":[3,99],"to":[4,42],"compute":[5],"candidate":[6,36],"keys":[7],"and":[8,31,39,64,73,78,84],"third":[9],"normal":[10],"form":[11],"design":[12],"of":[13,55,66,81,89],"a":[14,35,44,76,86,105],"relational":[15],"database":[16,58],"schema,":[17],"using":[18],"strategic":[19,68],"port":[20,27],"graph":[21,28,69],"rewriting.":[22],"More":[23],"precisely,":[24],"we":[25],"define":[26],"rewriting":[29],"rules":[30,72],"strategies":[32,74],"that":[33],"implement":[34],"key":[37],"definition":[38],"Ullman\u2019s":[40],"algorithm":[41],"decompose":[43],"relation":[45],"schema":[46,59],"into":[47],"lossless":[48],"3NF":[49],"schemata.":[50],"show":[52],"the":[53,56,82,90,95],"correctness":[54],"resulting":[57],"by":[60],"proving":[61],"soundness,":[62],"completeness":[63],"termination":[65],"our":[67],"programs.":[70],"These":[71],"provide":[75],"declarative":[77],"visual":[79],"description":[80],"algorithms,":[83],"permit":[85],"fine-grained":[87],"analysis":[88],"computation":[91],"steps":[92],"involved":[93],"in":[94,103],"normalisation":[96],"process.":[97],"The":[98],"have":[100],"been":[101],"implemented":[102],"Porgy,":[104],"visual,":[106],"interactive":[107],"modelling":[108],"tool.":[109]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}