argusdusty

5 ms·

1.
by argusdusty 13y ago
I did say "requiring quadratic memory from every word." I'm not sure you can really call that linear - it's O(n m^2), where n is the number of words, and m is the average word length. It's not the O(n m) that Ferret
2.
by argusdusty 13y ago
Because a trie works great for prefix searches, but we want substring searches, so we'd have to modify the trie to be more like a suffix tree, in it's simplest form inserting each possible suffix into the trie and doing a prefix s
3.
by argusdusty 13y ago
This is a good idea :) I'll probably add in a module for phonetic matching when I get the time.
4.
by argusdusty 13y ago
EC2 medium instances come with 480GB space. Our database currently takes roughly 60GB. Ferret isn't running on this entire database, though - it's for auto-complete searches over our artist names, roughly 4MB. EDIT: Since I can&#x
5.
by argusdusty 13y ago
Thanks for the heads-up. It should be working now.
6.
by argusdusty 13y ago
The $150 per month includes several other servers we run. The server running our core app backend costs under half that, and handles our requirements just fine. Spending another $80 per month to save me development time is a cost we, as a p
7.
by argusdusty 13y ago
Author here: They are unrelated. We did take the time to examine writing our own full search engine based on Lucene, like the aforementioned search library. The reasons why we didn't are briefly mentioned in the blog post, but simply p
8.
by argusdusty 14y ago
Looking over the source code, this doesn't really look secure. A few notes: 1. Any decryption key which is shorter than the length of the encrypted data must be fake. This forces fake decrypted data to be the same length as the real decrypt