FTS use index multi-tree and de-facto has _no_ insert speed degradation. I did do test for 400+ millions of records. With b-tree index there is insert speed degradation: http://geomapx.blogspot.com/2010/04/sqlite-index-degradation-tests.html http://geomapx.blogspot.com/search?q=index+speed
So FTS as hash-index is nice. 2011/10/19 Fabian <fabianpi...@gmail.com>: > Did anyone do some benchmarks how the insert-speed of FTS compares to a TEXT > INDEX column? I don't need many of the extra features of FTS, because I > always need to look up rows by prefix or exact match, and both can be > implemented efficiently via TEXT INDEX too. But if the overhead is > comparable, I'd rather use FTS. > _______________________________________________ > sqlite-users mailing list > sqlite-users@sqlite.org > http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users > -- 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
