An efficient approach for discovering Graph Entity Dependencies (GEDs)

Dehua Liu, Selasi Kwashie, Yidi Zhang, Guangtong Zhou, Michael Bewong, Xiaoying Wu, Xi Guo, Keqing He, Zaiwen Feng

Abstract: Highlights•A study of the discovery problem of Graph Entity Dependencies (GEDs).•A new and efficient approach for the discovery of GEDs in property graphs.•A minimum description length inspired definition of interestingness of GEDs to rank discovered rules.•A thorough empirical evaluation of the proposed technique, with examples of useful rules (mined) that are relevant in data quality/management applications.