Title:
SUFFIX ARRAY CANDIDATE SELECTION AND INDEX DATA STRUCTURE
Document Type and Number:
WIPO Patent Application WO/2012/064826
Kind Code:
A3
Abstract:
A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix.
Inventors:
AUSTERMANN PATRICK (US)
Application Number:
PCT/US2011/059940
Publication Date:
July 05, 2012
Filing Date:
November 09, 2011
Export Citation:
Assignee:
TIBCO SOFTWARE INC (US)
AUSTERMANN PATRICK (US)
AUSTERMANN PATRICK (US)
International Classes:
G06F17/30
Foreign References:
| US20060218170A1 | 2006-09-28 | |||
| US20070083495A1 | 2007-04-12 | |||
| US20020087510A1 | 2002-07-04 | |||
| US6141655A | 2000-10-31 |
Attorney, Agent or Firm:
MCCORMACK, Brian, C. et al. (2001 Ross Ave. Suite 230, Dallas TX, US)
Download PDF:
Previous Patent: METHODS AND SYSTEMS FOR MEDIA CONSUMPTION
Next Patent: METHODS AND COMPOSITIONS TO REGULATE PLANT TRANSFORMATION SUSCEPTIBILITY
Next Patent: METHODS AND COMPOSITIONS TO REGULATE PLANT TRANSFORMATION SUSCEPTIBILITY