Patent · US Active

Relaxation for structured queries

US9158813B2 · kind B2 · utility

15Cited by
3References
19Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJun 9, 2010
Grant dateOct 13, 2015
Priority date
Expiry dateApr 9, 2032

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F16/95
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.