As matching is expensive, try to avoid applying the full matcher to every element, by first using a fast, coarse match & then a final match
-
-
Replying to @SICPQuotes
The coarse match filters the data base to produce a small set of candidates for the final match.
1 reply 2 retweets 10 likes -
Replying to @SICPQuotes
We can arrange our DB so that some of the work of coarse matching can be done when the DB is constructed. This is called indexing.
1 reply 4 retweets 11 likes
There is a vast technology built around database-indexing schemes. Our implementation contains a simple-minded form of such an optimization.
0 replies
1 retweet
3 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.