Tries for text search, that's really the only thing I learned is that if your searching through a body of text for 40,000 odd keyword you need to turn the docum

Tries for text search, that's really the only thing I learned is that if your searching through a body of text for 40,000 odd keyword you need to turn the document in to a trie. But that's something you'd learn as soon as you read any of the research on the topic. It's basically a programming language for text search that's stored in a database. If I had to do it again I'd base if off a parser-generator and use a DSL, possibly using git for versioning. I ended up basically storing an AST in the db and then creating an object for each node in the decision tree. It was written in perl but that was more of a constraint than a choice.