Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-08-08
2006-08-08
Robinson, Greta (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
07089227
ABSTRACT:
In a full text search retrieval device connected to a plurality of user terminals, a received retrieval condition and terminal device information are stored in a trailing character buffer. If it is determined that a preceding retrieving process is not being performed, then a retrieval pattern variable table and a retrieval request expression variable table are generated. According to the retrieval request expression variable table, a database of the data to be searched is searched to extract a retrieval result matching the retrieval condition transmitted from each of the terminal devices, and the extracted retrieval result is transmitted to each of the plurality of terminal devices. Thus, although retrieval requests are continuously transmitted from respective users, a retrieval result can be returned to each user terminal in the same response time as in the case where a user terminal corresponds to a retrieval device.
REFERENCES:
patent: 5454105 (1995-09-01), Hatakeyama et al.
patent: 6029165 (2000-02-01), Gable
patent: 6094647 (2000-07-01), Kato et al.
patent: 6385605 (2002-05-01), Suzuoka et al.
patent: 6487566 (2002-11-01), Sundaresan
patent: 6487641 (2002-11-01), Cusson et al.
patent: 6493705 (2002-12-01), Kobayashi et al.
patent: 6526400 (2003-02-01), Takata et al.
patent: 6584465 (2003-06-01), Zhu et al.
patent: 2001/0037325 (2001-11-01), Biderman et al.
patent: 0 561 364 (1993-09-01), None
patent: 0 818 741 (1998-01-01), None
patent: 6-60121 (1994-03-01), None
patent: 10-27182 (1998-01-01), None
Alfred V. Aho, et al., “Efficient String Matching: An Aid to Bibliographic Search” Communications of the ACM, vol. 18, No. 6, Jun. 1975, p. 333-340.
Timos K. Sellis, “Multiple-Query Optimization” ACM Transactions on Database Systems, vol. 13, No. Mar. 1, 1988, p. 23-52.
Ando, K. et al., “Efficient multi-attribute pattern matching using the extended Aho-Corasick method”, System, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997, IEEE Int'l Conference on Orlando, FL, Oct. 12-15, 1997, pp. 3936-3941.
Aho, A. V. et al., “Efficient String Matching: An Aid to Bibliographic Search”, Communications of the Association for Computing Machinery, Association for Computing Machinery. New York, US., vol. 18, No. 6, Jun. 1975, pp. 333-340.
Kida T., et al., “A unifying framework for compressed pattern matching”, String Processing and Information Retrieval Symposium, 1999 and International Workshop on Groupware, Cancun, Mexico Sep. 22-24, 1999, Los Alamitos, CA, USA, IEEE Comput. Soc., US, Sep. 22, 1999, pp. 89-96.
European Search Report for corresponding EP application No. 01 3100381 dated May 24, 2004.
Copy of Japanese Office Action (Notice of Rejection Grounds) dated May 18, 2004.
Canadian Office Action dated Nov. 9, 2004.
Masahiro Nakamura, “Textual” structure is advantageous in terms of flexibility and performance, Nikkei Computer, No. 493, Apr. 10, 2000.
Abe Fumirou
Hara Yasuhisa
Matsuura Masataka
Nagata Masahiko
Fujitsu Limited
Lu Kuen S.
Robinson Greta
Staas & Halsey , LLP
LandOfFree
Pattern retrieving method, pattern retrieval apparatus,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Pattern retrieving method, pattern retrieval apparatus,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern retrieving method, pattern retrieval apparatus,... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3660568