Searching documents for successive hashed keywords

Details Searching documents for successive hashed keywords Searching documents for successive hashed keywords

2009-05-11

2011-10-04

Stevens, Robert (Department: 2162)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C707S711000, C707S747000

Reexamination Certificate

active

08032551

ABSTRACT:
A method and system searches documents that contain an ordered pair of keywords using search indices stored in multiple storage locations. In one embodiment, a server receives the search request that includes an ordered pair of keywords. The server hashes each keyword with multiple hash functions to obtain a hash vector pair, which are used to index a chain of search indices. Hash values in the hash vector pair are used to locate the chain of search indices that are stored across multiple storage locations. The last search index in the chain provides identifiers of documents containing the ordered pair of keywords, with a distance between the keywords in the documents below a predetermined limit. The documents can be retrieved from document repositories using the identifiers.

REFERENCES:
patent: 6581075 (2003-06-01), Guturu et al.
patent: 7054867 (2006-05-01), Bosley et al.
patent: 7213013 (2007-05-01), Subramaniam et al.
patent: 7293014 (2007-11-01), Subramaniam et al.
patent: 7324988 (2008-01-01), Altevogt et al.
patent: 2004/0181511 (2004-09-01), Xu et al.
patent: 2004/0205242 (2004-10-01), Xu et al.
patent: 2005/0010560 (2005-01-01), Altevogt et al.
patent: 2005/0027723 (2005-02-01), Jones et al.
patent: 2005/0039036 (2005-02-01), Eisen
patent: 2005/0050028 (2005-03-01), Rose et al.
patent: 2007/0050429 (2007-03-01), Goldring et al.
patent: 2007/0208697 (2007-09-01), Subramaniam et al.
patent: 2007/0260575 (2007-11-01), Robinson et al.
patent: 2008/0021908 (2008-01-01), Trask et al.
patent: 2009/0177610 (2009-07-01), Kawamura et al.
patent: 2010/0094877 (2010-04-01), Garbe
Gnawali, Omprakash D., “A Keyword-Set Search System for Peer-to-Peer Networks”, Massachusetts Institute of Technology, Jun. 2002, 65 pages.
Kronfol, Amr Z., “FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine”, Princeton University, May 6, 2002, 58 pages.
Karasawa, Kei, “Personalized Search using Identity-Based Hashing”, DIM '08, Fairfax, VA, Oct. 31, 2008, pp. 71-79.
Ganesan, Prasanna, et al., “YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology”, INFOCOM 2003, vol. 2, Mar. 30-Apr. 3, 2003, pp. 1250-1260.
Risson, John, et al., “Survey of research towards robust peer-to-peer networks: Search methods”, Computer Networks, vol. 50, Issue 17, Dec. 5, 2006, pp. 3485-3521.
Zhong, Ming, et al., “Correlation-Aware Object Placement for Multi-Object Operations”, ICDCS '08, Beijing, China, Jun. 17-20, 2008, pp. 512-521.
U.S. Appl. No. 11/809,635, Notice of Allowance dated Oct. 7, 2009, 16 pages.

Affiliated with

Also associated with

Rating

Searching documents for successive hashed keywords does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Searching documents for successive hashed keywords, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching documents for successive hashed keywords will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4289622