Skip to main content

Joel Liu's Library tagged engine →  View Popular

10 May 09

Hacker News | Follow on: Use DBMS or fs?

  • Another reason to not use a DBMS for a search engine is that typical implementations of transaction-oriented SQL databases are a terrible fit for the performance requirements of a search engine. For example, search engines don't need concurrent writes or ACID transactions, or SQL-like query language; search engines want to optimize for large-scale updates, not small, random writes; typical DBMS index structures (btree) don't work well for search engine indices.

    Eric Brewer has an interesting paper that lays out an architecture for a search engine that is consistent with DBMS design principles, but differs significantly in the implementation details:

    http://www.cs.berkeley.edu/~brewer/papers/SearchDB.pdf

19 May 07

eigenclass - Outperforming Ferret at searching, 3X faster indexing, code online

  • The last time I blogged about the
    FTSearch (simple) full-text search engine, it already indexed the Reuters
    corpus over twice faster than Ferret. I have rewritten a few more methods in C and
    got an extra 50% speed boost, making it now over 3 times faster than Ferret
    when indexing.
1 - 9 of 9
Showing 20▼ items per page

Selected Tags

Related Tags

Highlighter, Sticky notes, Tagging, Groups and Network: integrated suite dramatically boosting research productivity. Learn more »

Join Diigo