Thank you, Simon. That was an interesting article, and even better, it has a link to a book-length PDF of “Modern B-Tree Techniques” that is *solid gold*. I’ve been wanting to learn more about b-trees, indexing, query planning, etc. and this book goes way beyond anything I’ve found previously.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7269 —Jens > On Dec 9, 2019, at 10:33 AM, Simon Slavin <slav...@bigfraud.org> wrote: > > During the lower-volume weekdays, I beg you indulgence for another off-topic > post. > > <https://www.evanjones.ca/ordered-vs-unordered-indexes.html> > > This article contrasts hash tables vs. indexes, in an attempt to explain why > indexes are the basis of most DBMSes but hash tables are the basis of many > in-memory search systems. > > It's a semi-technical article, but if you don't understand what "O(log n)" > means, don't worry, you can skim over that level and still understand the > discussion. > > SQLite uses hash tables internally, though not for data stored in tables. > But given there's already an embedded LSM library, it's not impossible that > SQLite might use hashing for some data purpose in the future. > _______________________________________________ > sqlite-users mailing list > sqlite-users@mailinglists.sqlite.org > http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users _______________________________________________ sqlite-users mailing list sqlite-users@mailinglists.sqlite.org http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
