I'm not sure I understand the question, but I'll take a stab at it anyway. If the data is to be loaded by and queried from the same program execution, you may wnat to consider using a temporary table as opposed to a regular (permanent) one that will go to disk. The time you might save has to do with SQLite not bothering to work with (slow) disk. But beware of taking this approach if you expect to exceed the amount of memory available to you.
You can optimize query performance by creating indexes on the field(s) you will be querying on. For example, if the table contains employee data, and one of the columns in that table is the employee's name, and you expect to be retrieving data based on the employee's name, create an index on the name column. Here's a pointer to some good info on performance tuning. It has helped me. http://katastrophos.net/andre/blog/2007/01/04/sqlite-performance-tuning- and-optimization-on-embedded-systems/ Good Luck ! -----Original Message----- From: Lloyd [mailto:[EMAIL PROTECTED] Sent: Wednesday, April 11, 2007 9:12 AM To: sqlite-users@sqlite.org Subject: [sqlite] Data structure Hi, I don't know whether this is an irrelevant question in SQLite list, but I don't see a better place to ask. Which data structure is best to store and retrieve data very fastly? There is a 95% chance that the searched data to be present in the data structure. There will be 1000s of nodes in the data structure and it will be searched millions of times. The data is not in any ordered form. Thanks for your information, Lloyd ______________________________________ Scanned and protected by Email scanner ------------------------------------------------------------------------ ----- To unsubscribe, send email to [EMAIL PROTECTED] ------------------------------------------------------------------------ ----- ----------------------------------------------------------------------------- To unsubscribe, send email to [EMAIL PROTECTED] -----------------------------------------------------------------------------
