Efficient storage mechanism for representing term occurrence...

Data processing: presentation processing of document – operator i – Presentation processing of document – Edit – composition – or storage control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

07552385

ABSTRACT:
A method and structure converts a document corpus containing an ordered plurality of documents into a compact representation in memory of occurrence data, where the representation is to be based on a dictionary previously developed for the document corpus and where each term in the dictionary has associated therewith a corresponding unique integer. The method includes developing a first vector for the entire document corpus, the first vector being a sequential listing of the unique integers such that each document in the document corpus is sequentially represented in the listing according to the occurrence in the document of the corresponding dictionary terms. A second vector is also developed for the entire document corpus and indicates the location of each of the document's representation in the first vector.

REFERENCES:
patent: 5488725 (1996-01-01), Turtle et al.
patent: 5604910 (1997-02-01), Kojima et al.
patent: 5748953 (1998-05-01), Mizutani et al.
patent: 5818877 (1998-10-01), Tsai et al.
patent: 5826261 (1998-10-01), Spencer
patent: 5895470 (1999-04-01), Pirolli et al.
patent: 5950189 (1999-09-01), Cohen et al.
patent: 5974412 (1999-10-01), Hazlehurst et al.
patent: 6167368 (2000-12-01), Wacholder
patent: 6401088 (2002-06-01), Jagadish et al.
patent: 6542896 (2003-04-01), Gruenwald
patent: 6601026 (2003-07-01), Appelt et al.
patent: 6633868 (2003-10-01), Min et al.
patent: 2002/0165707 (2002-11-01), Call
patent: 2004/0049503 (2004-03-01), Modha et al.
Buckley, Chris, et al, “Optimization of Inverted Vector Searches”, Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jun. 1985, pp. 97-110.
Lee, Joon Ho, “Combining Multiple Evidence From Different Properties of Weighting Schemes”, Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 1995, pp. 180-188.
Viles, Charles L., et al, “On the Update of Term Weights in Dynamic Information Retrieval Systems”, Proceedings of the Fourth International Conference on Information and Knowledge Management, Dec. 1995, pp. 167-174.
Fagan, J., “Automatic Phrase Indexing for Document Retrieval”, Proceedings of the 10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Nov. 1987, pp. 91-101.
George McDaniel, IBM Dictionary of Computer, vii, viii, 212 (10thEd. Aug. 1993).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient storage mechanism for representing term occurrence... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient storage mechanism for representing term occurrence..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient storage mechanism for representing term occurrence... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4144836

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.