Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Beskales, I. Ilyas, L. Golab (2010)
Sampling the repairs of functional dependency violations under hard constraintsProc. VLDB, 3
M. Arenas, W. Fan, L. Libkin (2008)
On the complexity of verifying consistency of XML specificationsSIAM J. Comput., 38
J. Biskup, D. Embley, J. Lochner (2008)
Reducing inference control to access control for normalized database schemasInf. Proc. Lett., 106
S. Abiteboul, R. Hull, V. Vianu (1995)
Foundations of Databases
J. Biskup, T. Weibert (2008)
Keeping secrets in incomplete databasesInt. J. Inf. Sec., 7
H. Mannila, K.-J. Räihä (1992)
Design of Relational Databases
A. Cali, D. Calvanese, G. De Giacomo, M. Lenzerini (2004)
Data integration under integrity constraintsInf. Syst., 29
C. Beeri, P. Bernstein (1979)
Computational problems related to the design of normal form relational schemasACM Trans. Database Syst., 4
F. De Marchi, S. Lopes, J.-M. Petit, F. Toumani (2003)
Analysis of existing databases at the logical level: the DBA companion projectSIGMOD Rec, 32
W. Fan, F. Geerts, J. Xibei (2008)
A revival of integrity constraints for data cleaningPVLDB, 1
P. Buneman, S. Davidson, W. Fan, C. Hara, W. Tan (2003)
Reasoning about keys for XMLInf. Syst., 28
J. Wijsen (1999)
Temporal FDs on complex objectsACM Trans. Database Syst., 24
B. Thalheim (1991)
Dependencies in relational databases
M. Arenas, L. Libkin (2004)
A normal form for XML documentsACM Trans. Database Syst., 29
R. Miller, M. Hernandez, L. Haas, L.-L. Yan, C. Ho, R. Fagin, L. Popa (2001)
The Clio project: managing heterogeneitySIGMOD Rec., 30
G. Wolf, A. Kalavagattu, H. Khatri, R. Balakrishnan, B. Chokshi, J. Fan, Y. Chen, S. Kambhampati (2009)
Query processing over incomplete autonomous databases: query rewriting using learned data dependenciesVLDB J., 18
M.-S. Kim, K.-Y. Whang, J.-G. Lee, M.-J. Lee (2008)
Structural optimization of a full-text n-gram index using relational normalizationVLDB J., 17
L. Qian, K. LeFevre, H. Jagadish (2011)
CRIUS: user-friendly database designProc. VLDB Endow., 4
K. Vadaparty, S. Naqvi (1995)
Using constraints for efficient query processing in nondeterministic databasesIEEE Trans. Knowl. Data Eng., 7
J. Biskup (2009)
Security in computing systems
C. Beeri, A.O. Mendelzon, Y. Sagiv, J.D. Ullman (1981)
Equivalence of relational database schemesSIAM J. Comput., 10
J. Bisbal, J. Grimson (2001)
Database sampling with functional dependenciesInf. Softw. Technol., 43
M. Levene, G. Loizou (1997)
Null inclusion dependencies in relational databasesInf. Comput., 136
P. Bernstein (1976)
Synthesizing third normal form relations from functional dependenciesACM Trans. Database Syst., 1
B. Marnette, G. Mecca, P. Papotti (2010)
Scalable data exchange with functional dependenciesProc. VLDB, 3
S. Davidson, W. Fan, C. Hara (2007)
Propagating XML constraints to relationsJ. Comput. Syst. Sci., 73
C. Koch, D. Olteanu (2008)
Conditioning probabilistic databasesProc. VLDB, 1
J. Demetrovics (1980)
On the equivalence of candidate keys with Sperner systemsActa Cybern., 4
R. Elmasri, S. Navathe (2010)
Fundamentals of Database Systems
J. Grant (1977)
Null values in a relational data baseInf. Process. Lett., 6
S. Link (2008)
On the implication of multivalued dependencies in partial database relationsInt. J. Found. Comput. Sci., 19
S. Ginsburg, R. Hull (1983)
Characterizations for functional dependency and Boyce-Codd normal form familiesTheor. Comput. Sci., 26
C. Farkas, S. Jajodia (2002)
The inference problem: a surveySIGKDD Explor., 4
H. Mannila, K.-J. Räihä (1994)
Algorithms for inferring functional dependencies from relationsData Knowl. Eng., 12
D. Toman, G. Weddell (2008)
On keys and functional dependencies as first-class citizens in description logicsJ. Autom. Reason., 40
H. Tan, Y. Zhao (2004)
Automated elicitation of functional dependencies from source codes of database transactionsInf. Softw. Technol., 46
W. Fan, F. Geerts, J. Xibei (2008)
Semandaq: a data quality system based on conditional functional dependenciesProc. VLDB, 1
D. Maier (1980)
Minimum covers in relational database modelJ. ACM, 27
C. Molinaro, S. Greco (2010)
Polynomial time queries over inconsistent databases with functional dependencies and foreign keysData Knowl. Eng., 69
B. Boehm (1981)
Software Engineering Economics
C. Jensen, R. Snodgrass, M. Soo (1996)
Extending existing dependency theory to temporal databasesIEEE Trans. Knowl. Data Eng., 8
C. Date (2005)
Database in depth: relational theory for practitioners
G. Gottlob, R. Pichler, F. Wei (2010)
Tractable database design through bounded treewidthInf. Syst., 35
W.W. Armstrong (1974)
Dependency structures of database relationshipsInf. Process., 74
J. Martin (1989)
Information Engineering
G. Weddell (1992)
Reasoning about functional dependencies generalized for semantic data modelsACM Trans. Database Syst., 17
W. Fan, S. Ma, Y. Hu, J. Liu, Y. Wu (2008)
Propagating functional dependencies with conditionsProc. VLDB, 1
P. Atzeni, N. Morfuni (1986)
Functional dependencies and constraints on null values in database relationsInf. Control, 70
B. Thalheim (2000)
Entity–Relationship Modeling
W.-D. Langeveldt, S. Link (2010)
Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependenciesInf. Syst., 35
M. Levene, G. Loizou (1998)
Axiomatisation of functional dependencies in incomplete relationsTheor. Comput. Sci., 206
T. Imielinski, R. Van der Meyden, K. Vadaparty (1995)
Complexity tailored design: a new design methodology for databases with incomplete informationJ. Comput. Syst. Sci., 51
Z. Tari, J. Stokes, S. Spaccapietra (1997)
Object normal forms and dependency constraints for object-oriented schemataACM Trans. Database Syst., 22
J. Lechtenbörger, G. Vossen (2003)
Multidimensional normal forms for data warehouse designInf. Syst., 28
M. Vincent (1999)
Semantic foundations of 4NF in relational database designActa Inf., 36
E.F. Codd (1975)
Understanding relationsACM SIGFIDET FDT Bull., 7
A. Deutsch, B. Ludäscher, A. Nash (2007)
Rewriting queries using views with access patterns under integrity constraintsTheor. Comput. Sci., 371
C. Lucchesi, S. Osborn (1978)
Candidate keys for relationsJ. Comput. Syst. Sci., 17
K. Engel (1997)
Sperner theory
J. Diederich, J. Milton (1988)
New methods and fast algorithms for database normalizationACM Trans. Database Syst., 13
M. Sözat, A. Yazici (2001)
A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relationsACM Fuzzy Sets Syst., 117
O. Rauh, E. Stickel (1996)
Standard transformations for the normalization of ER schemataInf. Syst., 21
C. Yu, H. Jagadish (2008)
XML schema refinement through redundancy detection and normalizationVLDB J., 17
L. Libkin, L. Wong (1996)
Semantic representations and query languages for Or-setsJ. Comput. Syst. Sciences, 52
H. Kimura, G. Huo, A. Rasin, S. Madden, S. Zdonik (2009)
Correlation maps: a compressed access method for exploiting soft functional dependenciesProc. VLDB, 2
C. Zaniolo (1984)
Database relations with null valuesJ. Comput. Syst. Sci., 28
C. Beeri, M. Dowd, R. Fagin, R. Statman (1984)
On the structure of Armstrong relations for functional dependenciesJ. ACM, 31
E.F. Codd (1979)
Extending the database relational model to capture more meaningACM Trans. Database Syst., 4
S. Hartmann, S. Link (2010)
Numerical constraints on XML dataInf. Comput., 208
A. Rosenthal, D. Reiner (1994)
Tools and transformations—rigorous and otherwise—for practical database designACM Trans. Database Syst., 19
A. Klug, R. Price (1982)
Determining view dependencies using tableauxACM Trans. Database Syst., 7
J. Demetrovics, V. Thi (1995)
Some remarks on generating Armstrong and inferring functional dependencies relationActa Cybern., 12
M. Levene, G. Loizou (1999)
Database design for incomplete relationsACM Trans. Database Syst., 24
H. Mannila, K.-J. Räihä (1986)
Design by example: an application of Armstrong relationsJ. Comput. Syst. Sci., 33
G. Miklau, D. Suciu (2007)
A formal analysis of information disclosure in data exchangeJ. Comput. Syst. Sci., 73
R. Fagin, M. Vardi (1983)
Armstrong databases for functional and inclusion dependenciesInf. Process. Lett., 16
A. Deutsch, L. Popa, V. Tannen (2006)
Query reformulation with constraintsSIGMOD Rec., 35
E. Lien (1982)
On the equivalence of database modelsJ. ACM, 29
P.C. Fischer, L.V. Saxton, S.J. Thomas, D. Van Gucht (1985)
Interactions between dependencies and nested relational structuresJ. Comput. Syst. Sci., 31
E.F. Codd (1970)
A relational model of data for large shared data banksCommun. ACM, 13
A. Enders, H. Romback (2003)
A Handbook of Software and Systems Engineering; Empirical Overservations, Laws and Theories
S. Kolahi (2007)
Dependency-preserving normalization of relational and XML dataJ. Comput. Syst. Sci., 73
G. Gottlob, L. Libkin (1990)
Investigation on Armstrong relations, dependency inference, and excluded functional dependenciesActa Cybern., 9
T. Imielinski, W. Lipski (1984)
Incomplete information in relational databasesJ. ACM, 31
M. Schaerf, M. Cadoli (1995)
Tractable reasoning via approximationArtif. Intell., 74
R. Fagin (1982)
Horn clauses and database dependenciesJ. ACM, 29
S. Hartmann, S. Link (2008)
Characterising nested database dependencies by fragments of propositional logicAnn. Pure Appl. Logic, 152
M. Vincent, J. Liu, C. Liu (2004)
Strong functional dependencies and their application to normal forms in XMLACM Trans. Database Syst., 29
F. De Marchi, J.-M. Petit (2007)
Semantic sampling of existing databases through informative Armstrong databasesInf. Syst., 32
A database is C -Armstrong for a given set of constraints in a class C if it satisfies every constraint of the set and violates every constraint in C not implied by the set. Therefore, Armstrong databases are test data that perfectly illustrate the current perceptions about the semantics of a schema. We extend the existing theory of Armstrong relations to a toolbox of Armstrong tables. That is, we investigate structural and computational properties of Armstrong tables for the class of functional dependencies (FDs) over SQL tables. Relations are special instances of SQL tables with no duplicate rows and no null value occurrences. While FDs do not enjoy Armstrong tables, the combined class of standard FDs and NOT NULL constraints does enjoy Armstrong tables. The problem of finding an Armstrong table is shown to be precisely exponential for this combined class. However, we establish an algorithm that computes Armstrong tables with a size at most quadratic in that of a minimum-sized Armstrong table. Our resulting toolbox of Armstrong tables can be applied by data engineers to concisely visualize constraints on SQL data. Such support can lead to designs that guarantee efficient data management in practice.
The VLDB Journal – Springer Journals
Published: Feb 1, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.