Data processing: database and file management or data structures – Database design – Data structure types
Patent
1997-10-16
2000-02-15
Lintz, Paul R.
Data processing: database and file management or data structures
Database design
Data structure types
707 3, 707 4, 707 6, 707536, 704 1, 704 8, 704200, 395898, G06F 1730
Patent
active
060263989
ABSTRACT:
In a database data processing system, input search data is matched against an index of a database to determine database records which either closely or exactly match the input search data. The input search data is broken down into elements, and elements are converted to terms having a finite set of possible values. The Soundex function may be used to convert elements to terms. The terms are compared against an index of terms to determine which database records relate to the input search data. Through statistical analysis, match records are given a record weight which may be used to calculate how closely the input data actually is to each match record. The invention provides a fast and efficient way of accurately searching for data in extremely large databases, while not requiring precise input search data entry. The invention may also be used to compare or supplement one database against another.
REFERENCES:
patent: 5758314 (1998-05-01), Mckenna
patent: 5787452 (1998-07-01), McKenna
patent: 5799302 (1998-08-01), Johnson et al.
Brooks, Peter L., "Looking for data in all the wrong places," DBMS, vol. 10, No. 11, pp. 70-75, Oct. 1997.
Rosen, Jeff, "A simple Soundex program," C/C++ Users Journal, vol. 12, No. 9, pp. 49-51, Sep. 1994.
Zobel, J. and Dart, P., "Finding Approximate MAtches in Large Lexicons," Software-Practice and Experience, 25(3): 331-345 (Mar. 1995).
Tarhio, J. and Ukkonen, E., "Boyer-Moore Approach to Approximate String Matching," Proc. 2.sup.nd Scandinavian Workshop on Algorithm Theory, 447: 348-359 (1990).
Wright, A. H., "Approximate String Matching using Within-word Parallelism," Software-Practice and Experience, 24(4): 337-362 (Apr. 1994).
Witten, I. H. et al., "Inverted File Indexing" In Managing Gigabytes; (NY: Van Nostrand Reinhold), pp. 79-115 (1994).
Harman, D., "Ranking Algorithms" In Information Retrieval Data Structures and Algorithms, W. B. Frakes et al., eds. (NJ: PTR Prentice-Hall, Inc.) pp. 363-382 (1992).
Frakes, W.B., "Stemming Algorithms" In Information Retrieval Data Structures and Algorithms, W. B. Frakes et al., eds. (NJ: PTR Prentice-Hall, Inc.) pp. 131-150 (1992).
Du, M.-W. and Chang, S.C., "An Approach to Designing Very Fast Approximate String Matching Algorithms," IEEE Transactions on Knowledge and Data Engineering, 6(4): 620-633 (Aug. 1994).
Ukkonen, E., "Finding Approximate Patterns in Strings," in Journal of Algorithms, 6: 132-137 (1985).
Ukkonen, E., "Approximate String-matching with q-grams and Maximal Matches*," Theoretical Computer Science, 92: 191-211 (1992).
http://www.genealogysf.com/glenda.html.
Kim, J. Y. and Shawe-Taylor, J., "An Approximate String-matching Algorithm," Theoretical Computer Science, 92: 107-117 (1992).
Ukkonen, E., "Approximate String-Matching over Suffix Trees*," 4.sup.th Annual Symposium on Combinatorial Pattern Matching, 684: 228-242 (1993).
Galil, Z. and Giancarlo, R., "Data Structures and Algorithms for Approximate String Matching," Journal of Complexity, 4: 33-72 (1988).
Schuff, F., "The Sound of Speed," Database Programming & Design, 8,2: 46(3) (Feb. 1995).
Prosise, J., "No Matter how you Spell it, Soundex Finds it" PC Magazine, 14,10: 261(3) (May 1995).
Beckingham Paul
Brown David
Corrielus Jean M.
iMarket, Incorporated
Lintz Paul R.
LandOfFree
System and methods for searching and matching databases does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and methods for searching and matching databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and methods for searching and matching databases will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1914638