Approach to generic database design

Question

An application that I'm facing at a customer, looks like this:

• it allows end users to enter "materials".
• To those materials, they can append any number of "properties".
• Properties can have a any value of type: decimal, int, dateTime and varchar (length varying from 5 characters to large chunks of text),

Essentially, the Schema looks like this:

Materials
MaterialID int not null PK
MaterialName varchar(100) not null

Properties
PropertyID
PropertyName varchar(100)

MaterialsProperties
MaterialID
PropertyID
PropertyValue varchar(3000)

An essential feature of the application is the search functionality: end users can search materials by entering queries like:

• [property] inspectionDate > [DateTimeValue]
• [property] serialNr = 35465488

Guess how this performs over the MaterialsProperties-table with nearly 2 million records in it.

Database was initially created under SQL Server 2000 and later on migrated to SQL Server 2005

How can this be done better?

Answer 1

1. Since users can enter their own property names, i guess every query is going to involve a scan of the properties table (in your example i need to find the propertyid of [inspectionDate]). If the properties table is large, your join would also take a long time. You could try and optimize by denormalizing and storing name with propertyID. This would be a denaormalized column in the MaterialsProperties table.
2. You could try adding a property type (int, char etc) to the materialsproperty table and partition the table on the type.
3. Look at Object Relational Mapping/Entity Attribute Value Model techniques for query optimization.
4. Since you already have a lot of data (2 million records) do some data mining as see if there are repeating groups of properties for many materials. You can them put them in one schema and the rest as the EAV table. Look here for details: http://portal.acm.org/citation.cfm?id=509015&dl=GUIDE&coll=GUIDE&CFID=49465839&CFTOKEN=33971901