Functional Dependencies for Graphs

@inproceedings{Fan2016FunctionalDF,
  title={Functional Dependencies for Graphs},
  author={Wenfei Fan and Yinghui Wu and Jingbo Xu},
  booktitle={SIGMOD Conference},
  year={2016}
}
We propose a class of functional dependencies for graphs, referred to as GFDs. GFDs capture both attribute-value dependencies and topological structures of entities, and subsume conditional functional dependencies (CFDs) as a special case. We show that the satisfiability and implication problems for GFDs are coNP-complete and NP-complete, respectively, no worse than their CFD counterparts. We also show that the validation problem for GFDs is coNP-complete. Despite the intractability, we develop… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Similar Papers

Loading similar papers…