Data processing: database and file management or data structures – Database and file access – Query optimization
Reexamination Certificate
2004-09-15
2010-12-07
Jalil, Neveen Abel (Department: 2165)
Data processing: database and file management or data structures
Database and file access
Query optimization
C707S706000
Reexamination Certificate
active
07849075
ABSTRACT:
Processing data includes accepting information characterizing values of a first field in records of a first data source and information characterizing values of a second field in records of a second data source. Quantities characterizing a relationship between the first field and the second field are computed based on the accepted information. Information relating the first field and the second field is presented.
REFERENCES:
patent: 5179643 (1993-01-01), Homma et al.
patent: 5842200 (1998-11-01), Agrawal et al.
patent: 5966072 (1999-10-01), Stanfill et al.
patent: 6741995 (2004-05-01), Chen et al.
patent: 6801938 (2004-10-01), Bookman et al.
patent: 2002/0161778 (2002-10-01), Linstedt
patent: 2002/0198877 (2002-12-01), Wolff et al.
patent: 2003/0023868 (2003-01-01), Parent
patent: 2003/0140027 (2003-07-01), Huttel et al.
patent: WO 00/57312 (2000-09-01), None
patent: WO 00/79415 (2000-12-01), None
Milne, Robert, et al., “Predicting paper making defects on-line using data mining,” Jul. 24, 1998, Knowledge-Based Systems, vol. 11, pp. 331-338.
Apte, Chidanand, et al., “Business Application for Data Mining,” Aug. 2002, Communications of the ACM, vol. 45, No. 8, pp. 49-53.
Mannila, Heikki, “Theoretical Frameworks for Data Mining,” Jan. 2000, SIGKDD Explorations, vol. 1, No. 2, pp. 30-32.
Yao, Hong et al., “Mining functional dependencies from data,” Sep. 15, 2007, Springer Science—Business Media, Data Mining and Knowledge Discovery, vol. 16, No. 2, pp. 197-219.
Yan, Men Hin, et al., “Algorithm for discovering multivalued dependencies,” 2001, ACM Proceedings of the 10th International Conference on Information and Knowledge Management, pp. 556-558.
“Ascential” http://www.ascentialsoftware.com (2003).
“Avellino” http://www.avellino.com (2003).
Chaudhuri, S., “An Overview of Query Optimization in Relational Systems”, XP-000782631, pp. 34-43 (1998).
“Data Profiling: The Foundation for Data Management”, prepared by DataFlux Corporation, XP-002313258, (2004).
“Evoke”, http://www.evokesoftware.com, (2003).
Huhtala et al., “TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies”, The Computer Journal, vol. 42, No. 2 (1999).
Jaedicke, et al., On Parallel Processing of Aggregate and Scalar Functions in Object-Relational DBMS, XP-002313223, pp. 379-389 (1998).
Li et al., “A Practical External Sort for Shared Disk MPPs”, http://www.thearling.com/text/sc93/sc93.
Olson, “Know Your Data: Data Profiling Solutions for Today's Hot Projects”, XP-002313222, p. 1-4, published in DM Review, printed from DMReview.com (Mar. 2000).
Rahm, et al., “Data Cleaning: Problems and Current Approaches”, XP-002284896 (2000).
Bagchi et al.. “Dependency Interference Algorithms for Relational Database Design.”Computers in Industry14 (1990) 319-350.
Bell et al.. “Discovery of Data Dependencies in Relational Databases.” LS-8 Report 14, Dortmund, Apr. 3, 1995 1-18.
Bitton et al.. “A Feasibility and Performance Study of Dependency Inference.” Department of Electrical Engineering and Computer Science, University of Illinois at Chicago (1989) 635-641.
Brown et al. . “BHUNT: Automatic Discovery of Fuzzy Algebraic Constraints in Relational Data.” XP-002333907.
Bruno et al.. “Efficient Creation of Statistics over Query Expressions.” The Computer Society (2003) 201-212.
Dasu et al. “Mining Database Structure; Or, How to Build a Data Quality Browser.” XP-002333902, 240-251.
Henrard et al.. “Data Dependency Elicitation in Database Reverse Engineering.” Institut d'Informattique, University of Namur, Belgium, (2001), 11-19.
Jahnke et al.. “Adaptive Tool Support for Database Reverse Engineering.” AG-Softwaretechnik, Universität Paderborn, Germany (19990, 278-282.
Petit et al.. “Towards the Reverse Engineering of Denormalizes Relational Databases.” Laboratoire d'Ingénierie des Systèmes d'Information, Lyon (1996), 218-227.
Wyss et al.. “FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances.” (Extended Abstract) Computer Science Department, Indiana University XP-002333906 101-110.
Examination Report in Canadian Application No. 2,655,735 dated May 4, 2009, 2 pages.
Canadian Office Action issued in application No. 2,655,731 dated Dec. 3, 2009, 3 pages.
Johnson, T et al., “Comparing Massive High-Dimensional Data Sets,” Proceedings of the 4thInternational Conference on Knowledge Discovery and Data Mining (KDD 98), Aug. 27-31, 1998, pp. 229-233.
Bay Paul
Feynman Carl
Gould Joel
Ab Initio Technology LLC
Abel Jalil Neveen
Fish & Richardson P.C.
Syed Farhan M
LandOfFree
Joint field profiling does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Joint field profiling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint field profiling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4161287