Home/ Questions/Q 653855
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-13T22:25:44+00:00

I’m creating a cache which is going to contain records in Delphi 2007. Each

  • 0

I’m creating a cache which is going to contain records in Delphi 2007.

Each record contains a String, 2 Dates and a value.

Type MyRecord = Record
    Location : String;
    Date1 : TDateTime;
    Date2 : TDateTime;
    Value : Double;
End;

There are no guarantees on what the maximum size of the cache will be.

It is highly likely that Location will have several entries for different dates
There are only 13 locations.

The cache needs to be searchable and will be in a performance critical place.

I was thinking of creating a 2 dimensional array for this structure with a sorted string list as an index. So when search I’d access the Stringlist to look up the index I need in the array with name value pairs. (Location = Index)
Then I’d need loop through the items for each location to see if the value is in the cache matching both Date1 and Date2. If the value isn’t in the cache I need to go and get it from a database and add it to the cache.

Something Like

Type MyRecord = Record
    Date1 : TDateTime;
    Date2 : TDateTime;
    Value : Double;
End;
...
Cache: Array[1..13] of Array of MyRecord
Locations: TStringList;

as location would be in the string list.

Would this be an efficient structure to use for caching?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Your structure is efficient enough for caching, but I wouldn’t use this in a performance critical place. If your cache grows, and you have 5000 items on one location, you’re still doing a linear search through 5000 items.

    I think it’s better to sort your list and use a binary search to search for items in the cache.

    If I would implement something like that, I would take a TList with Pointers to the records. The list than would be sorted with TList.Sort which I give a procedure that sorts the list according to the data the records contain. The sorting will take place on the field with the most ‘selectivity’, then on the fields with the second most selectivity and so on.

    If you want to find an entry you perform a binary search on the list and get the value, if it doesn’t exist, you get it from the database and add it to the cache.

    Of course this would all be nicely wrapped in a class which takes care of this and memory allocation issues.

    A hashmap is also possible, but you have to do tests to see which is faster.

    • 0