Method for the prioritization of database entries

Details Method for the prioritization of database entries Method for the prioritization of database entries

2005-01-04

2005-01-04

Bragdon, Reginald G. (Department: 2187)

Electrical computers and digital processing systems: memory

Storage accessing and control

Specific memory composition

C365S049130

Reexamination Certificate

active

06839799

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.

REFERENCES:
patent: 5454094 (1995-09-01), Montove
patent: 5555397 (1996-09-01), Sasama et al.
patent: 5787483 (1998-07-01), Jam et al.
patent: 5883901 (1999-03-01), Chiu et al.
patent: 6069573 (2000-05-01), Clark, II et al.
patent: 6118682 (2000-09-01), Martin
patent: 11-126486 (1999-05-01), None

Affiliated with

Also associated with

Rating

Method for the prioritization of database entries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for the prioritization of database entries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for the prioritization of database entries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3422050