We wrote our own search engine in Erlang. It didnt need to have all the features of lucene, since in our problem space,<br>we only needed to do simple boolean search. <br><br>Writing a inverted index based search engine in Erlang is quite straightforward, mainly due to two reasons:
<br>1. Mnesia and dets can easily handle "the last n additions" problem. This allows you to structure a search engine as a combination<br>of merging responses from two queries -- the last n additions to the index which havent been merged into the file based index,
<br>and the results from the file based inverted index.<br><br>2. For file based inverted indexes (like the segments in lucene), the bit syntax allows you to write very efficient (Golomb coded) structures, while the standard library has some really nice modules like file_sorter which are useful..
<br><br>For us, the problem was even simpler, since typically PowerPoint documents do not contain large amounts of text, so a simple<br>mnesia based inverted index with some clever optimizations suffices. It also solves the problem of making the search engine highly available.
<br><br>Regards,<br>Vijay<br><br><br><div><span class="gmail_quote">On 4/19/07, <b class="gmail_sendername">Christian S</b> <<a href="mailto:firstname.lastname@example.org">email@example.com</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
What did you replace lucene with in the new heterogene erlang version?<br></blockquote></div><br>