Method for comparing a first data set with a second data set

• US 20070097755A1
• Filed: 07/24/2006
• Published: 05/03/2007
• Est. Priority Date: 10/27/2005
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Marndi, Raj, Commen, Sachin, Venkat, Maheedhar
• Application Number:
  US11/491,753
• Publication Number:
  US 20070097755A1
• Time in Patent Office: Days
• US Class Current: 365/189.07
• CPC Class Codes: G06F 18/00 Pattern recognition
• CPC Class Codes: G06F 2218/16 by matching signal segments

Abstract

A method for comparing a first data set with a second data set, where each comprises one or more corresponding segments. The method comprises determining the difference between corresponding pairs of end points of corresponding segments, and deeming the first data set to match the second data set if the difference is less than a predetermined tolerance for all of the corresponding pairs of end points, and deeming the first data set not to match the second data set if the difference is greater than the predetermined tolerance for any one of the corresponding pairs of end points.

Claims

1. A method for comparing a first data set with a second data set, each comprising one or more corresponding segments, said method comprising:

determining the difference between corresponding pairs of end points of corresponding segments; and

deeming said first data set to match said second data set if said difference is less than a predetermined tolerance for all of said corresponding pairs of end points, and deeming said first data set not to match said second data set if said difference is greater than said predetermined tolerance for any one of said corresponding pairs of end points.

2. A method as claimed in claim 1, including determining said difference for all of said end points of said segments, then identifying whether said difference exceeds said predetermined tolerance for any of said end points of said segments.

3. A method as claimed in claim 1, including determining said difference until either said difference has been determined to be less than said predetermined tolerance for all of said corresponding pairs of end points or said difference has been determined to be greater than said predetermined tolerance for any one of said corresponding pairs of end points.

4. A method as claimed in claim 1, including identifying a maximum and a minimum value in each of segments of said first data set and of said second data set, performing a comparison of said maxima of said pairs of corresponding segments, said minima of said pairs of corresponding segments, or both said maxima of said pairs of corresponding segments and said minima of said pairs of corresponding segments, and deeming said first data set not to match said second data set if a mismatch is identified.

5. A method as claimed in claim 4, including ceasing said. comparison once a mismatch in either said maxima or said minima is identified.

6. A method as claimed in claim 1, including, if a mismatch is identified, advancing said first data set relative to said second data set by an integral number of segments until a first segment of said first data set is convergent with a segment of said second data set and a start point of said first segment differs from an end point of said corresponding segment by less than said predetermined tolerance, then reversed until said start point of said first segment differs from said second data set by said predetermined tolerance.

7. A computer readable medium provided with program data that, when executed on a computing system, implements the method of claim 1.

8. A computer provided with program data that, when executed, implements the method of claim 1.

10. A computer readable medium provided with program data that, when executed on a computing system, implements the method of claim 8.

9. A method of processing a sequence query, comprising:

specifying first and second sequences;

segmenting said first and second sequences so that said first and second sequences comprise a plurality of corresponding segments;

determining the difference between corresponding pairs of end points of corresponding segments; and

deeming said first sequence to match said second sequence if said difference is less than a predetermined tolerance for all of said corresponding pairs of end point'"'"'s, and deeming said first sequence not to match said second sequence if said difference is greater than said predetermined tolerance for any one of said corresponding pairs of end points.