Scalable tree builds for content descriptor search
US8756216B1 · kind B1 · utility
23Cited by
3References
26Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 13, 2010 |
| Grant date | Jun 17, 2014 |
| Priority date | — |
| Expiry date | May 29, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/41
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Multiple paths of an index tree may be traversed to discover a set of content descriptors that are match candidates for a set of query descriptors. A size of the set of candidate content descriptors may be optimized, for example, to reduce false positive matching errors, query latencies and/or index tree traversal times, at least in part by determining a number of child nodes to traverse based at least in part on current traverse level and/or traverse neighborhood thresholds. Index trees for large content descriptor sets may be built in resource constrained environments with approximation and/or refining build techniques.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.