Let R(X) be a table with m columns and n rows, where X is the set of columns. A 0-1 matrix T(X) is associated with R(X) as follows. T(X) has m columns and \(\left( \begin{matrix} n\\ 2\end{matrix} \right)\) rows. Let \(u_ i[A_ g]\) denotes the entry at column \(A_ g\) in the ith row of R(X). Similarly, \(t_ i[A_ g]\) denotes the entry at column \(A_ g\) in the ith row of T(X). A mapping is defined between each two rows \(\{u_ i,u_ j\}\) in R(X) and a row \(t_ f\) in T(X) such that \(t_ f[A_ g]=1\) if \(u_ i[A_ g]=u_ j[A_ g]\); otherwise \(t_ f[A_ g]=0\). The two-row constraints realization problem deals with conditions under which there exists a table R(X) that corresponds to a given 0-1 matrix T(X). The solution to this problem and its application in the area of the theory of relational databases, are discussed in this paper.
This page was built for publication: The two-row constraints realization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096396)
