Constrained dependencies Export

@article{citeulike:1257601, abstract = {We extend the notions of functional and finiteness dependencies to apply to subsets of a relation that are specified by constraints. These dependencies have many applications. We are able to characterize those constraint domains which admit a polynomial time solution of the implication problem (assuming P/=NP) and give an efficient algorithm for these cases, modulo the cost of constraint manipulation. For other cases we offer approximate algorithms. Finally, we outline some applications of...}, author = {Maher, Michael J.}, citeulike-article-id = {1257601}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8886}, journal = {Theoretical Computer Science}, keywords = {constraints}, number = {1}, pages = {113--149}, posted-at = {2007-04-26 18:36:38}, priority = {2}, title = {Constrained dependencies}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8886}, volume = {173}, year = {1997} }

TY - JOUR ID - citeulike:1257601 L3 - citeulike-article-id:1257601 N2 - We extend the notions of functional and finiteness dependencies to apply to subsets of a relation that are specified by constraints. These dependencies have many applications. We are able to characterize those constraint domains which admit a polynomial time solution of the implication problem (assuming P/=NP) and give an efficient algorithm for these cases, modulo the cost of constraint manipulation. For other cases we offer approximate algorithms. Finally, we outline some applications of... IS - 1 JF - Theoretical Computer Science EP - 149 TI - Constrained dependencies VL - 173 SP - 113 KW - constraints AU - Maher, Michael PY - 1997/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8886 ER -