-
Website
http://phildawes.net/blog/ -
Original page
http://www.phildawes.net/blog/2005/01/01/suffix-array-performance-problems/ -
Subscribe
All Comments -
Community
-
Top Commenters
-
danja
4 comments · 4 points
-
phildawes
5 comments · 1 points
-
Dominic Sayers
1 comment · 1 points
-
David W.
2 comments · 1 points
-
ryantm
1 comment · 1 points
-
-
Popular Threads
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
2 weeks ago · 3 comments
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
This reduces the accuracy of the suffix match (meaning that substring searches > 4 chars need to join and filter with the nodes table (containing the literals). The width of the suffix field could be increased if this becomes a bottleneck, trading off more space for speed.
Have got the query down to 30ms on my laptop (down from 82.61 seconds on the original scheme). Other queries are looking good as well (mostly in the 10-30ms mark). Should fly on the 10GB 8 proc box at work :-)
The reason this is so much faster is that the mysql query optimiser gets a better view of the number of literals each substring will match, and so correctly identifies the best match order. Also, by indexing the new suffix table both ways (suffix-literal and literal-suffix), the query analyser can chose to impose other constraints in between substring filtering
(e.g. reducing the literal matches to those that are rdfs:labels).
Now I just need to update the veudastore code to use the new scheme...
To use this with veudas, replace the cgi-bin/veudas-0.6/veudastore directory with this release
Looking for a suffix index that would tell me what programs open files with what suffix. Such that it would tell me what program created on what programs would open files say with .jpg suffix.
Probably totally in the wrong place, but could you help?
Ed.