Hi Y'all,
Please forgive what I think is probably a dumb question, but...
I am porting my app's data model from C++/STL to sqlite. My goal is
scalability - even if I implement my data model in C++ using data
structures that give me good O(N) time (e.g. use trees, hash tables,
etc.) the whole thing has to be in memory, and adding indexing means a
pretty big code churn.
My question is:
If I take all of the sqlite optimizations I should be taking (saving my
SQL query statements in compiled form to avoid recompiling over and
over, having enough pages in memory to avoid disk thrash, using
transactions to limit disk I/O)....
Does anyone have sqlite and STL experience to tel me how the speed of an
indexed column of integers in sqlite would compare to a set<int> in C++?
(I believe my set implementation uses a red-black tree.)
Thanks!
Ben
--
Scenery Home Page: http://scenery.x-plane.com/
Scenery blog: http://xplanescenery.blogspot.com/
Plugin SDK: http://www.xsquawkbox.net/xpsdk/
Scenery mailing list: [EMAIL PROTECTED]
Developer mailing list: [EMAIL PROTECTED]
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
