Membership checking of digital text

Details Membership checking of digital text Membership checking of digital text

2008-06-03

2011-10-11

Morrison, Jay (Department: 2168)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C707S739000, C707S754000, C707S758000

Reexamination Certificate

active

08037069

ABSTRACT:
The described implementations relate to data analysis, such as membership checking. One technique identifies candidate matches between document sub-strings and database members utilizing signatures. The technique further verifies that the candidate matches are true matches.

REFERENCES:
patent: 6029167 (2000-02-01), Evans
patent: 6249784 (2001-06-01), Macke et al.
patent: 6523026 (2003-02-01), Gillis
patent: 6778970 (2004-08-01), Au
patent: 7010522 (2006-03-01), Jagadish et al.
patent: 7181768 (2007-02-01), Ghosh et al.
patent: 7346490 (2008-03-01), Fass et al.
patent: 7444326 (2008-10-01), Jagadish et al.
patent: 7814107 (2010-10-01), Thirumalai et al.
patent: 2004/0260543 (2004-12-01), Horowitz et al.
patent: 2007/0185910 (2007-08-01), Koike et al.
patent: 2008/0016019 (2008-01-01), Loftus et al.
patent: 2008/0040345 (2008-02-01), Cameron
patent: 2008/0183693 (2008-07-01), Arasu et al.
Frieder, et al., “On the Integration of Structured Data and Text: A Review of the SIRE Architecture”, In DELOS Workshop on Information Seeking, Searching, and Querying in Digital Libraries Dec. 2000, pp. 1-6.
Gravano, et al., “Using q-Grams in a DBMS for Approximate String Processing”, 2001, pp. 1-7.
Pevzner, et al., “A Fast Filtration Algorithm for the Substring Matching Problem”, Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, 1993, pp. 1-10.
Aho, et al., “Efficient String Matching: An Aid to Bibliographic Search”, Jun. 1975, vol. 18, Issued: 6, ACM Press, New York, USA, pp. 333-340.
Amir, et al., “Text Indexing and Dictionary Matching with One Error”, Journal of Algorithms, Sep. 27, 1998, pp. 309-325.
Arasu, et al., “Efficient Exact Set-Similarity Joins”, Proceedings of the 32nd international conference on Very large data bases, Sep. 12-15, 2006, pp. 918-929.
Bloom H. Burton, “Space/Time Trade-offs in Hash Coding with Allowable Errors”, Jul. 1970, vol. 13, Issued 7, ACM Press New York, NY, USA, pp. 422-426.
Chakrabarti, et al., “Ranking Objects by Exploiting Relationships”, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, Jun. 27-29, 2006, ACM Press New York, NY, USA, pp. 371-382.
Chandel, et al., “Efficient Batch Top-k Search for Dictionary-Based Entity Recognition”, Proceedings of the 22nd International Conference on Data Engineering, Date 2006, pp. 1-10.
Cohen, et al., “Finding Interesting Associations without Support Pruning”, Jun. 16, 1999, 20 Pages.
Fagin, et al., “Optimal Aggregation Algorithms for Middleware”, Journal of Computer and System Sciences 66, Sep. 6, 2001, pp. 614-656.
Gionis, et al., “Similarity Search in High Dimensions via Hashing”, Proceedings of the -25th VLDB Conference4, Stanford University, 1999, pp. 518-529.
Gravano, et al., “Approximate String Joins in a Database (Almost) for Free”, Proceedings of the 27th VLDB Conferenc, 2001, pp. 491-500.
Haveliwala, et al., “Scalable Techniques for Clustering the Web”, Jun. 2000, vol. 14, Issue 3, pp. 1-6.
Manber, et al., “An Algorithm for Approximate Membership Checking with Application to Password Security”, Appeared in Information Processing Letters, 1994, vol. 50, pp. 1-10.
Narayanan, et al., “Gapped Local Similarity Search with Provable Guarantees”, Algorithms in Bioinformatics, Oct. 29, 2004, vol. 3240/2004, Springer Berlin, pp. 74-86.
Ramaswamy, et al., “Approximate Fingerprinting to Accelerate Pattern Matching”, Algorithms in Bioinformatics, Oct. 29, 2004, vol. 3240/2004, Springer Berlin, pp. 301-306.
Sarawagi, et al., “Efficient Set Joins on Similarity Predicates”, International Conference on Management of Data, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, 2004, ACM Press, New York USA, pp. 743-754.
Singhal Amit, “Modem Information Retrieval: A Brief Overview” IEEE, 2001, pp. 1-9.
Zhou, et al., “MaxMatcher Biological Concept Extraction using Approximate Dictionary Lookup”, PRICAI 2006: Trends in Artificial Intelligence, Jul. 26, 2006, vol. 4099/2006, Springer Berlin, pp. 1145-1149.

Affiliated with

Also associated with

Rating

Membership checking of digital text does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Membership checking of digital text, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Membership checking of digital text will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4278510