Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting

Fernández, Maribel; Varga, János

doi:10.1145/3414080.3414090

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of the examples are taken from the literature [23,22,27,5,8,6,10,14] and others are randomly generated. The experiments #21 − #25 are taken from real-word data sets available at https://data.cms.gov/provider-data/ 12 . Figures 8 and 9 show the outputs of the algorithms on example #23 that corresponds to Unplanned hospital visits data.…”

Section: Experimentationmentioning

confidence: 99%

See 1 more Smart Citation

KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases

Demba¹

2021

View full text Add to dashboard Cite

In relational databases, it is essential to know all minimal keys since the concept of database normaliza-tion is based on keys and functional dependencies of a relation schema. Existing algorithms for determining keysor computing the closure of arbitrary sets of attributes are generally time-consuming. In this paper we present aneï¬ƒcient algorithm, called KeyFinder, for solving the key-ï¬nding problem. We also propose a more direct methodfor computing the closure of a set of attributes. KeyFinder is based on a powerful proof procedure for ï¬ndingkeys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of searchspace and execution time.

show abstract

Section: Experimentationmentioning

confidence: 99%

“…Their approach cannot nd all minimal keys (see their example 3, they compute only one minimal key out of three). Recently, Fernandez et al [12] proposed a method for nding all minimal keys using strategic port graph Rewriting. Walst proposed a rst approach based on tableaux [26] to compute minimal keys.…”

Section: Introductionmentioning

confidence: 99%

KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases

Demba¹

2021

View full text Add to dashboard Cite

show abstract

“…Unlike the strategies usually considered for the λ -calculus and abstract rewriting, these strategies are syntactically represented as programs and the next steps are not only dependent on the last state but may depend on the whole history of the derivation. These languages have been applied to several real problems, among others [29,26,28,2,42].…”

mentioning

confidence: 99%

Model checking strategy-controlled systems in rewriting logic

et al. 2021

View full text Add to dashboard Cite

He de admitir que he curioseado algunos agradecimientos de tesis para escribir estos, con los que doy fin a esta memoria (cronológicamente, lo siento, aún quedan 300 páginas). Intentaré huir de la autobiografía, del ensayo y del cantar de gesta. Sin embargo, no quiero zafarme de incluir nombres, aunque eso suponga omitir otros, porque le restaría valor al reconocimiento que se merecen. Entiéndase este párrafo como una disculpa para todos aquellos que no son mencionados.En primer lugar, quiero agradecer a mis directores de tesis, Narciso, Isabel y Alberto, todo su trabajo y apoyo durante estos años. No solo han leído numerosas páginas con más erratas de las que quisiera, recibido largos correos y firmado abundantes informes, sino que me han enseñado a desenvolverme como investigador, cuando hubiera dicho que eso era cosa de Herlock Sholmes y Jessica Fletcher. Narciso me animó desde el principio a hacer el doctorado y se ha esforzado en que lo realizase en las mejores condiciones, a gusto y convencido.A mis compañeros del despacho 219 y en especial a Adrián, Enrique y Manuel. Ellos han sido mis ciceroni en la universidad, alegrando el ambiente a base de paseos periunédicos y juegos de palabras, y me han dejado involucrarme en sus proyectos (Juan inclusive). Gracias a Óscar y Luis, pues aunque no hayamos trabajado juntos, nuestros temas se han retroalimentado. No me puedo olvidar tampoco de Pablo ni de Gorka.To the members of the Maude Team, Paco Durán, Santiago Escobar, Steven Eker, Narciso again, José Meseguer, and Carolyn Talcott, who have welcomed me warmly and generously into their group. During this time, we have published two versions of Maude and a centenary article, committed to writing two books together, and met in different conferences and numerous Skype hours. I also appreciate Steven's confidence in letting me contribute to the well-kept Maude code, although the circumstances did not allow us to collaborate in person.

show abstract

Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language

Fernandez,

Mackie

2024

Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting

Cited by 3 publications

References 15 publications

KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases

KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases

Model checking strategy-controlled systems in rewriting logic

Hierarchical Higher-Order Port-Graphs: A Rewriting-Based Modelling Language

Contact Info

Product

Resources

About