Method for the prioritization of database entries
US6839799B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 17, 2001 |
| Grant date | Jan 4, 2005 |
| Priority date | — |
| Expiry date | Mar 20, 2023 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/90339
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method is provided for prioritizing the entries in a database, where each entry is composed of multiple dimensions. Prioritization is required when there are multiple matches in the database. The number of matches can be the same as the number of entries in the database. To prioritize such a huge number of entries in a minimum number of clock cycles, a distributed prioritizer is implemented by partitioning stored binary data into half nibbles comprising of two bits of data each. Each half nibble is encoded into an expanded format allotting priority value to the stored encoded half nibbles. The stored encoded half nibbles are compared across a word array to determine an exact match.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.