Document retrieval by information unit

Details Document retrieval by information unit Document retrieval by information unit

2005-01-25

2005-01-25

Metjahic, Safet (Department: 2171)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

06847960

ABSTRACT:
A method of searching a search space comprising a plurality of pages in response to a query comprising a plurality of keywords includes identifying at least one information unit. Where a query includes exactly two keywords, an information unit comprises one page which contains both keywords in the query or two pages selected from the search space such that the first page in the information unit contains the first keyword in the query and the second page in the information unit contains the second keyword in the query; where an information unit contains two pages, one page is linked, directly or indirectly, to the other page. Relaxed query processing techniques enable the method to identify information units which do not contain every keyword in the query, which have only semantically similar words or synonyms, and which have keywords of differing relative importance. The method is adapted to report the identified information units and to accommodate altered queries provided as a result of a report.

REFERENCES:
patent: 5835905 (1998-11-01), Pirolli et al.
patent: 5855015 (1998-12-01), Shoham
patent: 5875423 (1999-02-01), Matsuoka
patent: 5878423 (1999-03-01), Anderson et al.
patent: 5913215 (1999-06-01), Rubinstein et al.
patent: 5983221 (1999-11-01), Christy
patent: 5987454 (1999-11-01), Hobbs
patent: 6085186 (2000-07-01), Christianson et al.
patent: 6092074 (2000-07-01), Rodkin et al.
patent: 6094649 (2000-07-01), Bowen et al.
patent: 6253198 (2001-06-01), Perkins
patent: 6421675 (2002-07-01), Ryan et al.
Kleinberg, Jon M., “Authoritative Sources in a Hyperlinked Environment”, InProceedings of the 9thACM-SIAM Symposium on Discrete Algorithms, 1998.
Mukherjea, Sougata et al., “Focus+Context Views of World-Wide Web Nodes,” InProceedings of the 1997 ACM Hypertext '97 Conference, pp. 187-196, Southampton, UK, Mar. 1997.
NEC Corporation, “JTOPIC Developer's Kit”, NEC Corporation, Dec. 1997.
Brin, Sergey, et al., “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” InProceedings of the 7thWorld-Wide Web Conference, Brisbane, Queensland, Australia, Apr., 1998.
Suciu, Dan, “Semistructured Data and XML,” InProceedings of 5thInternational Conference of Foundations of Data Organization(FODO '98), Kobe, Japan, Nov. 1998.
Tajima, Keishi, et al., “Cut as a Querying Unit for WWW, Netnews, E-mail,” InProceedings of the 1998 ACM Hypertext Conference, pp. 235-244, Pittsburgh, PA, Jun. 1998.
Li, Wen-Syan, et al., “Facilitating Complex Web Queries Through Visual User Interfaces and Query Relaxation,”Computer Networks and ISDN Systems, 30 (1998), pp. 149-159.
Bharat, Krishna, et al., “Improved Algorithms for Topic Distillation in a Hyperlinked Environment”; InProceedings of the 21st Annual International ACM SIGIR Conference, pp. 104-111, Melbourne, Australia, Aug. 1998.
Chakrabarti, Soumen, et al. “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text,” InProceedings of the 7thWorld-Wide Web Conference, pp. 65-74, Brisbane, Queensland, Australia, Apr. 1998.
Cho, Junghoo, et al. “Efficient Crawling Through URL Ordering,”Computer Networks and ISDN Systems, Special Issue on the Seventh International World-Wide Web Conference, Brisbane, Australia, 30(1-7), Apr. 1998.
Dar, Shaul, et al., “DTL's DataSpot: Database Exploration Using Plain Language,” InProceedings of the 24thInternational Conference on Very Large Data Bases, pp. 645-649, New York City, New York, Aug. 1998.
EGroups, http://www.egroups.com/list/dbword/.
Gibson, David, et al., “Clustering Categorical Data: An Approach Based on Dynamic Systems,” InProceedings of the 24thInternational Conference on Vary Large Data Bases, Sep. 1998.
Gibson, David et al., “Inferring Web Communities from Link Topology,” InProceedings of the 1998 ACM Hypertext Conference, pp. 225-234, Pittsburgh, PA, Jun. 1998.
Goldman, Roy, et al., “Proximity Search in Databases,” InProceedings of the 24thInternational Conference on Very Large Data Bases, pp. 26-37, New York City, New York, Aug. 1998.
C.D. Bateman et al. “Provably Good Routing Tree Construction with Multi-port Terminals”; In proceedings of the ACM/SIGDA International Symposium on Physical Design, Apr. 1997.
S.L. Hakimi “Steiner's Problem in Graphs and its Implications” Networks, 1:113-133, 1971.
E. Ihler “Bounds on the Quality of Approximate Solutions to the Group Steiner Tree Problem”, reprinted from proceedings of the 16thInternational Workshop on Graph Theoretic Concepts in Computer Science; Lecture Notes in Computer Science, pp. 109-118, 1991.
G. Reich et al., “Beyond Steiner's Problem: A VLSI Oriented Generalization”, In proceedings of the 15thInternational Workshop on Graph Theoretic Concepts in Computer Science WG8, Lecture Notes in Computer Science, pp. 196-210, 1990.
W. Bruce Croft et al., “Providing Government Information on the Internet: Experiences with THOMAS”, In proceedings of Digital Libraries (DL '95), 1995.
N. Garg et al., “A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem”, In proceedings of the 9thAnnual ACM-SIAM Symposium on Discrete Algorithms, pp. 253-259, 1998.
Frank K. Hwang et al., “The Steiner Tree Problem”, Annals of Discrete Mathematics, vol. 53, 1992 (Table of Contents).
Wen-Syan Li et al., “PowerBookmarks: A System for Personalizable Web Information Organization, Sharing, and Management”, In proceedings of the 8thWorld-Wide Web Conference, Toronto, Canada, May 1999.
R. Richardson et al., “Using WordNet as a Knowledge Base for Measuring Semantic Similarity Between Words”, In proceedings of Artificial Intelligence and Cognitive Science Conference.
Petr Slavik, “The Errand Scheduling Problem”, Mar. 14, 1997.

Affiliated with

Also associated with

Rating

Document retrieval by information unit does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Document retrieval by information unit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Document retrieval by information unit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3377524