Data structure and method for sorting using heap-supernodes

Details Data structure and method for sorting using heap-supernodes Data structure and method for sorting using heap-supernodes

2005-08-17

2008-09-09

LeRoux, Etienne P (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

07424474

ABSTRACT:
An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further described a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for fast, pipelined hardware implementations with increased throughput, making piles practical for a wide variety of new applications; they remove the requirement to track and update the last position in the heap; they reduce the number of memory reads accesses required during a delete operation; they require only ordinary, inexpensive RAM for storage in a fast, pipelined implementation; and they allow a random mixture of back-to-back insert, remove, and swap operations to be performed without stalling the pipeline.

REFERENCES:
patent: 6952696 (2005-10-01), Nadj et al.

Affiliated with

Also associated with

Rating

Data structure and method for sorting using heap-supernodes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data structure and method for sorting using heap-supernodes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data structure and method for sorting using heap-supernodes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3977495