Indexes, Hashes & Compression

1 year ago by Phil Dawes

The new triplestore is coming along. It can do substring text searches (using a suffix array) and has a basic relational query engine. It doesn’t optimise the query plans yet, but if you enter the queries in a good order (most selective clauses first) then you get good performance. A few things have changed in my thinking since my last post about indexing. Although using hashes to represent toke ... Continue reading

Source: www.phildawes.net