Approximate and exact unary inclusion dependency discovery

作者: Zandro Luis Gonzalez

DOI:

关键词:

摘要: A method and apparatus for analyzing potential inclusion dependencies between columns of database tables is provided. client issues a command, e.g., SQL statement, to server. The command processed at the server without performance join. Result data that indicates any exact or approximate identified in transmitted from client. In processing values stored are converted into integer representations require fewer resources analyze. Disclosed techniques provide use an index on single table rather than defining each table, which can be impractical. Further, only one pass required identify tables.

参考文章(8)
Peter Brockhausen, Siegfried Bell, Discovery of data dependencies in relational databases Universität Dortmund. ,(1999) , 10.17877/DE290R-8395
Paul Bay, Joel Gould, Carl Feynman, Functional dependency data profiling ,(2004)
Peter Jay Haas, Paul Geoffrey Brown, Method for discovering undeclared and fuzzy rules in databases ,(2007)
Eric L. Barsness, Randy W. Ruhlow, Michael P. Koranda, Peter J. Johnson, John M. Santosuosso, Techniques for identifying mergeable data ,(2004)
Yka Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen, Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies The Computer Journal. ,vol. 42, pp. 100- 111 ,(1999) , 10.1093/COMJNL/42.2.100
Hakan Jakobsson, Ari Mozes, Fei Ge, Andrew Witkowski, Techniques for eliminating database table joins based on a join index ,(2002)
Liman Wei, Partha Bhattacharya, Shigang Chen, Method and apparatus for removing redundancies from a list of data structures ,(2002)