Yes. I think a couple of hash choices would be a good addition to SQLite. I posted recently asking about INTERSECT and whether a "minimal perfect hash" might be worth consideration for that function.
http://www.mail-archive.com/sqlite-users@sqlite.org/msg51046.html And a standard sparse hash would be more suitable than a btree for some lexicographical database applications. Regards Tim Romano On Mon, Apr 5, 2010 at 8:45 AM, Alexey Pechnikov <pechni...@mobigroup.ru>wrote: > Hello! > > The b-tree index is not good choice for high-selective data, but there is > no > hash index in SQLite. The hash index will be useful for many new projects > and will optimize a lot of existing applications. > > Is anyone interested in this feature? > > Best regards, Alexey Pechnikov. > http://pechnikov.tel/ > _______________________________________________ > sqlite-users mailing list > sqlite-users@sqlite.org > http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users > _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
