Performance of database tag schemas
Philipp Keller has done some performance test on 4 different database schemas for storing tagged items. Although his article refers to tagging bookmarks, you can tag pretty much anything.
He tests a one table setup with and without a full text index (tags are just a column in the table), a two table setup (a tag table with a foreign key to the item), and a three table setup (tags, items, and tag item relation table).
I found the results to be somewhat surprising. The full text index is slowest on a small tag set (250 tags) but with (999) tags it was fastest for finding items tagged with two tags.
The three table method was faster than the two table method on all tests except for inserting new rows. The un-normalized one table method is obviously fastest for adding new items. I would guess it would be fastest for update and delete as well.
Note that his tests were done using MySQL, using a different database you might get different results.
Check out his report
Like this? Follow me ↯Tweet Follow @pfreitag
Performance of database tag schemas was first published on June 20, 2005.
If you like reading about tags, folksonomy, performance, mysql, sql, db, or design then you might also like:
- Insert Delayed with MySQL
- Related Posts
- Order by NULL Values in MySQL, Postgresql and SQL Server
- Creating a Derby Datasource with ColdFusion Admin API
- Top 10 Reserved SQL Keywords
- INFORMATION_SCHEMA Support in MySQL, PostgreSQL
- On Tradeoffs
- Calculating Distance in Miles from Latitude and Longitude