Re: how to implement a circular buffer in a table

On 15 Aug 2001, oofoofoof_at_ureach.com wrote:

> I'm looking to design a table that has a fixed size.
> When the table reaches this size,

You will need to query the system tables to tell when you've reached the allotted size.

> new records added to the table will replace the oldest records,
> thus creating a circular buffer.

You need some way to recognize the oldest records. I would use a sequence number as a PK, and then delete the record with the min PK.

> How do I implement this efficiently?

By not having the size restriction.

When you submit this to the professor, let us know what grade you got.

-- 
Galen Boyer
It seems to me, I remember every single thing I know.