Author:
Zhou Guangtong,Kwashie Selasi,Zhang Yidi,Bewong Michael,Nofong Vincent M.,Hu Junwei,Cheng Debo,He Keqing,Liu Shanmei,Feng Zaiwen
Publisher
Springer Nature Singapore
Reference37 articles.
1. Aberger, C.R., Lamb, A., Tu, S., Nötzli, A., Olukotun, K., Ré, C.: Emptyheaded: a relational engine for graph processing. ACM Trans. Database Syst. (TODS) 42(4), 1–44 (2017)
2. Alipourlangouri, M., Chiang, F.: Keyminer: discovering keys for graphs. In: VLDB Workshop TD-LSG (2018)
3. Bleifuß, T., et al.: Approximate discovery of functional dependencies for large datasets. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pp. 1803–1812 (2016)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Bringmann,2008
5. Caruccio, L., Deufemia, V., Polese, G.: Mining relaxed functional dependencies from data. Data Min. Knowl. Disc. 34(2), 443–477 (2020)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献