Data processing: database and file management or data structures – Database design – Data structure types
Patent
1995-09-12
1998-07-07
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707203, G06F 1730
Patent
active
057783713
ABSTRACT:
A data retrieval system which updates data quickly. A divider determines the first substring and second substring based on the code string from which a key string is retrieved. For each substring, a generator generates the dictionary data showing the correspondence between a trailing string, which is a trailing part of data in the substring, and the start position of the trailing string within the code string. A retriever a trailing string whose leading string is a key string or a part of the key string, based on the dictionary data. A remover removes duplicate trailing strings. When a changer changes the code string, an updater updates dictionary data associated with the substring based on the contents of the change. A first maintaining device maintains the boundary interval at a maximum key length or longer, and a second maintaining device maintains the boundary interval at a specified length or less.
REFERENCES:
patent: 4754489 (1988-06-01), Bokser
patent: 4967391 (1990-10-01), Hijima
patent: 5062143 (1991-10-01), Schmitt
patent: 5121493 (1992-06-01), Ferguson
patent: 5136289 (1992-08-01), Yoshida et al.
patent: 5150425 (1992-09-01), Martin et al.
patent: 5150430 (1992-09-01), Chu
patent: 5153591 (1992-10-01), Clark
patent: 5276741 (1994-01-01), Aragon
patent: 5293466 (1994-03-01), Bringmann
patent: 5384568 (1995-01-01), Grinberg et al.
patent: 5418948 (1995-05-01), Turtle
patent: 5418951 (1995-05-01), Damashek
patent: 5442350 (1995-08-01), Iyer et al.
patent: 5530975 (1996-07-01), Koenig
patent: 5561421 (1996-10-01), Smith et al.
patent: 5574910 (1996-11-01), Bialkowski et al.
patent: 5600826 (1997-02-01), Ando
patent: 5610603 (1997-03-01), Plambeck
patent: 5614900 (1997-03-01), Watanabe
"A Space-economical Suffix Tree Construction Algorithm" Edward M. McCreight, Journal of the Association, vol. 23, pp. 262-272, Apr. 1976.
"Self-Adjusting Binary Search Trees" D. D. Sleator et al., Journal of the Association for Computer Machinery, vol. 32, pp. 625-686, Jul. 1985.
Kuo et al., "A two-Step String-Matching procedure" Pattern Recognition, vol. 24, pp. 711-716, Mar. 1991.
Reingold et al. "Data Structure . . . " Litle Brown Computer Systems Series pp. 255-262, Jan. 1986.
Proceedings 31st Annual Symposium on Foundations of Computer Science, vol. I, pp. 116-124, Oct. 22-24, 1990, William I. Chang, et al., "Approximate String Matching in Sublinear Expected Time".
Software Practice and Experience, vol. 21, No. 10, pp. 1027-1040, Oct. 1991, John A. Dundas III, "Implementing Dynamic Minimal-Prefix Tries".
Pattern Recognition, vol. 24, No. 7, pp. 711-716, Jan. 1991, Shufen Kuo, et al., "A Two-Step String-Matching Procedure".
Journal of The Association for Computer Machinery, vol. 23, No. 2, pp. 262-272, Apr. 1976, E. McCreight, "A Space-Economical Suffix Tree Construction Algorithm".
Journal of The Association For Computing Machinery, vol. 32, No. 3, pp. 652-686, Jul. 1985, D. Sleator, et al., "Self-Adjusting Binary Search Trees".
Black Thomas G.
Corrielus Jean M.
Kabushiki Kaisha Toshiba
LandOfFree
Code string processing system and method using intervals does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Code string processing system and method using intervals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Code string processing system and method using intervals will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1217988