J.A. Makowsky, E.V. Ravve  Home/Search
Context Related
| cs.technion.ac.il/~admlogic/...iER96.ps cs.technion.ac.il/~admlogic/...iER96.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~admlo...readme (more) From: cs.technion.ac.il/~admlo...readme (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We introduce a new point of view into database schemes by applying systematically an old logical technique: translation schemes, and their induced formula and structure transformations. This allows us to re-examine the notion of dependency preserving decomposition and its generalization refinement. The most important aspect of this approach lies in laying the groundwork for a formulation of the Fundamental Problem of Database Design, namely to exhibit desirable differences between... (Update)
Context of citations to this paper: More
...patiently listening to our draft presentations and providing many valuable comments. An earlier version of this paper appeared as [MR96b]. Unfortunately this version contains various inaccuracies and misleading misprints. The current version is completely rewritten and...
Cited by: More
Dependency Preserving Refinements and the Fundamental Problem .. - Makowsky, Ravve (1998) (Correct)
Similar documents (at the sentence level):
21.5%: Dependency preserving refinements of relational database.. - Makowsky, Ravve (1996) (Correct)
Active bibliography (related documents): More All
0.5: Databases and Finite-Model Theory - Vianu (1997) (Correct)
0.3: An overview of Interpretability Logic - Visser (1997) (Correct)
0.3: Views and Updates over Distributed Databases (Extended Abstract) - Makowsky, Ravve (1998) (Correct)
Similar documents based on text: More All
0.2: Algebraic and Descriptive Complexity of Combinatorial . . . - Gathen, Makowsky (1997) (Correct)
0.2: A New Normal Form for the Design of Relational Database Schemata - Zaniolo (1982) (Correct)
0.2: Incremental Model Checking for Decomposable Structures - Makowsky, Ravve (1995) (Correct)
BibTeX entry: (Update)
J.A. Makowsky and E. Ravve. Translation schemes and the fundamental problem of database design. In Conceptual Modeling - ER'96, volume 1157 of Lecture Notes in Computer Science, pages 5--26. Springer Verlag, 1996. http://citeseer.ist.psu.edu/makowsky96translation.html More
@inproceedings{ makowsky96translation,
author = "Johann A. Makowsky and Elena V. Ravve",
title = "Translation Schemes and the Fundamental Problem of Database Design",
booktitle = "International Conference on Conceptual Modeling / the Entity Relationship Approach",
pages = "5-26",
year = "1996",
url = "citeseer.ist.psu.edu/makowsky96translation.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
81 Update semantics of relational views (context) - Bancilhon, Spyratos - 1981
64 The Design of Relational Databases (context) - Mannila, Raiha - 1992
37 Feasible Computation Through Model Theory - Dawar - 1993
26 A uniform method for proving lower bounds on the computation.. (context) - Compton, Henson - 1990
20 Fundamentals of dependency theory (context) - Vardi - 1987
20 Implicit definability on finite structures and unambiguous c.. (context) - Kolaitis - 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 Formal systems for tuple and equality generating dependencie.. (context) - Beeri, Vardi - 1984
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
6 Principles of Computer Science Series (context) - Ullman, Database - 1982
4 volume 40 of Die Grundleheren der mathematischen Wissenschaf.. (context) - Hilbert, Bernays - 1970
4 The theory of data dependencies (context) - Fagin, Vardi - 1986
3 volume 126 of Teubner-- Texte zur Mathematik (context) - Thalheim, Relational - 1991
3 the expressive power of data dependencies (context) - Makowsky, Vardi - 1986
3 Fakultat fur Mathematik (context) - Thalheim, on et al. - 1994
3 volume 426 of Memoirs of the American Mathematical Society (context) - Mycielski, Pudl'ak et al. - 1990
3 volume 17 of EATCS Monographs on Theeoretical Computer Scien.. (context) - Paredaens, De Bra et al. - 1989
2 ACM SIGMOD Symp (context) - Keller, Ullman et al. - 1984
2 Capturing complexity classes with Lindstrom quantifiers - Makowsky - 1994
2 Dependency preserving refinment of database schemes (context) - Makowsky, Ravve - 1996
2 the ubdecidability of implication between embedded multivalu.. (context) - Herrmann - 1995
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