Unary and n-ary inclusion dependency discovery in relational databases-Reference-Cited by-同舟云学术

Unary and n-ary inclusion dependency discovery in relational databases

Published:2008-01-26 Issue:1 Volume:32 Page:53-73
ISSN:0925-9902
Container-title:Journal of Intelligent Information Systems
language:en
Short-container-title:J Intell Inf Syst

Author:

Marchi Fabien De,Lopes Stéphane,Petit Jean-Marc

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10844-007-0048-x.pdf

Reference36 articles.

1. Abiteboul, S., Hull, R., & Vianu, V. (1995). Foundations of databases. Reading, MA: Addison-Wesley.

2. Afrati, F. N., Gionis, A., & Mannila H. (2004). Approximating a collection of frequent sets. In W. Kim, R. Kohavi, J. Gehrke, & W. DuMouchel (Eds.), International conference on knowledge discovery and data mining (KDD’04) (pp. 2–19). Washington, USA: ACM.

3. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), International conference on very large data bases (VLDB’94) (pp. 487–499). Santiago de Chile, Chile: Morgan Kaufmann.

4. Albrecht, M., Buchholz, E., Düsterhöft, A., & Thalheim, B. (1995). An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. In L. Libkin & B. Thalheim (Eds.), Semantics in databases (Vol. 1358, pp. 1–28). Lecture Notes in Computer Science, Springer.

5. Bauckmann, J., Leser, U., Naumann, F., & Tietz, V. (2007). Efficiently detecting inclusion dependencies. In International conference on data engineering (ICDE’07) (pp. 1448–1450). IEEE Computer Society.

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Measuring Approximate Functional Dependencies: A Comparative Study;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. ARDN: Attention Re-distribution Network for Visual Question Answering;Arabian Journal for Science and Engineering;2024-05-01

3. Extending Desbordante with Probabilistic Functional Dependency Discovery Support;2024 35th Conference of Open Innovations Association (FRUCT);2024-04-24

4. Determining the Largest Overlap between Tables;Proceedings of the ACM on Management of Data;2024-03-12

5. Testing Dependencies and Inference Rules in Databases;Automatic Control and Computer Sciences;2023-12