×

Efficient storage of related sparse data in a search index

  • US 9,720,946 B2
  • Filed: 10/24/2014
  • Issued: 08/01/2017
  • Est. Priority Date: 06/19/2014
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method to store related sparse data within a search index, the method comprising:

  • detecting sparse data within content to be indexed, the sparse data comprising a data point related to an entity by determining if the content matches one or more classification rules;

    determining a number of matches and a confidence of the matches for the one or more classification rules;

    in response to a determination that there is at least one match, creating an integer array for the data point such that a value associated with the data point is one or more of a count value and a confidence value based on the determined number and confidence of the matches;

    in response to receiving a request from a user to perform a query on the search index that includes the data point, transforming the query to a corresponding range based on an identifier of the entity; and

    upon execution of the query, providing query results to the user.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×