Faster database searches with inverted index

Ancient Geeks contributor Tom Gidden has long obsessed about making database text searches fast and scalable. Your RDBMS may already have full text searching, but that can’t necessarily cope with serious load.

Tom has described his version of an Inverted Index technique in an article in php|Architect magazine, but now he and a colleague have implemented the idea with MySQL stored procedures rather than PHP, and have released an open source project through Google Code. I’ll likely be using this on one of my work projects.


One Response to “Faster database searches with inverted index”

  1. Tom Gidden Says:

    Thanks for the mention 🙂

    I just rewrote a big chunk of the library, so you might want to update your copy if you have already downloaded it.

Leave a Reply

Please log in using one of these methods to post your comment: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: