See this document in CiteSeerX!

Dependency preserving refinements of relational database schemes (Extended Abstract) (1996)  (Make Corrections)  
J.A. Makowsky, E.V. Ravve



  Home/Search   Context   Related

 
View or download:
cs.technion.ac.il/~admlog...ERextab.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.technion.ac.il/~admlo...readme (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: , April 1996 Abstract. We introduce a new point of view into database schemes by applying systematically an old logical technique: translation schemes, and their induced formula transformation. This allows us to reexamine the notion of dependency preserving decomposition and its generalization refinement. This logical tool allows us to have a new look a BCNF and show that every scheme specified by functional dependencies (FD's) has a dependency preserving refinement into BCNF. Furthermore we... (Update)

Similar documents (at the sentence level):
36.7%:   Translation Schemes and the Fundamental Problem of Database.. - Makowsky, Ravve (1996)   (Correct)
23.2%:   Dependency Preserving Refinements and the Fundamental Problem .. - Makowsky, Ravve (1998)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Views and Updates over Distributed Databases (Extended Abstract) - Makowsky, Ravve (1998)   (Correct)
0.2:   First-class Synchronous Operations - Reppy (1995)   (Correct)
0.2:   Performance Comparison of Ten Variations on the.. - Robert Fisher (1994)   (Correct)

Similar documents based on text:   More   All
0.2:   Algebraic and Descriptive Complexity of Combinatorial . . . - Gathen, Makowsky (1997)   (Correct)
0.2:   Incremental Model Checking for Fixed Point Properties on.. - Makowsky, Ravve (1995)   (Correct)
0.2:   Incremental Model Checking for Decomposable Structures - Makowsky, Ravve (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ makowsky-dependency,
  author = "J.A. Makowsky and E.V. Ravve",
  title = "Dependency preserving refinements of relational database schemes (Extended
    Abstract)",
  url = "citeseer.ist.psu.edu/makowsky96dependency.html" }
Citations (may not include all citations):
775   Foundations of Database (context) - Abiteboul, Hull et al. - 1994
211   Languages that capture complexity classes - Immerman - 1987
64   The Design of Relational Databases (context) - Mannila, Raiha - 1992
43   Further normalization of the data base relational models (context) - Codd - 1972
26   A uniform method for proving lower bounds on the computation.. (context) - Compton, Henson - 1990
19   Embedded implicational dependencies and their implication pr.. (context) - Chandra, Lewis et al. - 1981
17   Reductions to NP--complete problems by interpretations (context) - Dahlhaus - 1983
17   Undergraduate Texts in Mathematics (context) - Ebbinghaus, Flum et al. - 1994
16   Monadic second order graph transductions: A survey (context) - Courcelle - 1994
16   A simple method for undecidability proofs and some applicati.. (context) - Rabin - 1965
13   Annals of Mathematics and Artificial Intelligence (context) - Thalheim, entity-relationship - 1993
9   What does Boyce-Codd normal form do (context) - Bernstein, Goodman - 1980
5   This article was processed using the L a T E X macro package.. (context) - Ullman, Database et al. - 1982
4   volume 40 of Die Grundleheren der mathematischen Wissenschaf.. (context) - Hilbert, Bernays - 1970
3   volume 17 of EATCS Monographs on Theeoretical Computer Scien.. (context) - Paredaens, De Bra et al. - 1989
3   the expressive power of data dependencies (context) - Makowsky, Vardi - 1986
3   Fakultat fur Mathematik (context) - Thalheim, on et al. - 1994
3   volume 126 of Teubner--Texte zur Mathematik (context) - Thalheim, Relational - 1991

Documents on the same site (http://www.cs.technion.ac.il/~admlogic/TR/readme.html):   More
Invariant Definability (Extended Abstract) - Makowsky (1997)   (Correct)
Views and Updates over Distributed Databases (Extended Abstract) - Makowsky, Ravve (1998)   (Correct)
Computable Quantifiers and Logics over Finite Structures - Makowsky, Pnueli (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC