Re^4: Efficient search through a huge dataset

Replies are listed 'Best First'.
•Re^5: Efficient search through a huge dataset by merlyn (Sage) on Oct 20, 2004 at 08:32 UTC
True, it's not fair. But then, if you want to be fair, you also have to include the "overhead" of the rest of the ODBC database... namely that you have to use WIndows. {grin} SQLite is small, simple to install, and does the job quickly. Yes, it sucks at transaction start/end, because it's very simple... it's just locking the file as its communication system. But in nearly every other way, it fits this problem space quite nicely. Life is a series of tradeoffs. -- Randal L. Schwartz, Perl hacker Be sure to read my standard disclaimer if this is a reply.	[reply]
Re^5: Efficient search through a huge dataset by Caron (Friar) on Oct 20, 2004 at 08:28 UTC
You don't have to group EVERYTHING. Grouping inserts into chunks of reasonable size make them faster, even if you have to insert one million records. Please refer to the SQL docs.	[reply]