Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Embedded dependency

In relational database theory, an embedded dependency (ED) is a certain kind of constraint on a relational database. It is the most general type of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Taxonomies are important knowledge ontologies that underpin numerous applications on a daily basis, but many taxonomies used in… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 3
  • table 2
Is this relevant?
2015
2015
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof… Expand
  • figure 1
  • figure 5
Is this relevant?
2013
2013
We investigate the implication problem for independence atoms $X \bot Y$ of disjoint attribute sets X and Y on database schemata… Expand
  • table 1
Is this relevant?
2012
2012
We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2009
2009
We consider the problem of finding equivalent minimal-size reformulations of SQL queries in presence of embedded dependencies [1… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in… Expand
Is this relevant?
2007
2007
Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in… Expand
  • figure 1
Is this relevant?
2001
2001
Abstract The issue of discovering functional dependencies from populated databases has received a great deal of attention because… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
1982
1982
A common framework is provided for the investigation of various types of integnty constraints for relaaonal databases. The family… Expand
Is this relevant?
1981
1981
We show that functional dependency preservation can be tested in polynomial time. We show further that while finding a cover for… Expand
Is this relevant?