PaulSchrum
Registered User.
- Local time
- Today, 12:36
- Joined
- Jul 30, 2011
- Messages
- 20
All,
I have a large database in which I am currently writing and DELETE *'ing a table using it as a temporary table. The code is too complex to post here, but here is a summary of benchmarks:
#ofRecords RecordProcessedPerSecond
1,000 219 rec/sec
10,000 137 rec/sec
100,000 22 rec/sec
Well the real database has over two million records, so it is really crawling after 100,000 records.
I was thinking, though, that since I do not have to do any queries or sorting on the temp table, that it might run faster if I switch from storing that temp data in a table to storing it either a collection or a dynamic array. (It's nature is that it actually gets sorted the way I need it as I am building it from other data.)
Does anyone out there know which of the three types of temporary structured data stores is most efficient timewise? Any other tidbits of advice would also be appreciated.
- Paul Schrum
North Carolina, USA
I have a large database in which I am currently writing and DELETE *'ing a table using it as a temporary table. The code is too complex to post here, but here is a summary of benchmarks:
#ofRecords RecordProcessedPerSecond
1,000 219 rec/sec
10,000 137 rec/sec
100,000 22 rec/sec
Well the real database has over two million records, so it is really crawling after 100,000 records.
I was thinking, though, that since I do not have to do any queries or sorting on the temp table, that it might run faster if I switch from storing that temp data in a table to storing it either a collection or a dynamic array. (It's nature is that it actually gets sorted the way I need it as I am building it from other data.)
Does anyone out there know which of the three types of temporary structured data stores is most efficient timewise? Any other tidbits of advice would also be appreciated.
- Paul Schrum
North Carolina, USA