Approximate and exact unary inclusion dependency discovery

Details Approximate and exact unary inclusion dependency discovery Approximate and exact unary inclusion dependency discovery

2008-03-25

2008-03-25

Mofiz, Apu (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

10861298

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

REFERENCES:
patent: 6496819 (2002-12-01), Bello et al.
patent: 6615206 (2003-09-01), Jakobsson et al.
patent: 7007032 (2006-02-01), Chen et al.
patent: 2005/0097072 (2005-05-01), Brown et al.
patent: 2005/0102325 (2005-05-01), Gould et al.
patent: 2005/0240615 (2005-10-01), Barsness et al.
Y. Huhtala, et al., “TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies”, The Computer Journal vol. 42, No. 2, 1999, pp. 100-111.
S. Bell and P. Brockhausen, “Discovery of Data Dependencies in Relational Databases”,Statistics, Machine Learning and Knowledge Discovery in Databases, ed. Yves Kodratoff, et al., Apr. 1995, pp. 53-58, ML—Familiarization Workshop.

Affiliated with

Also associated with

Rating

Approximate and exact unary inclusion dependency discovery does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Approximate and exact unary inclusion dependency discovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate and exact unary inclusion dependency discovery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3931266