How should I make searching a relational database more efficient?
- by Travis J
This is in the scope of a web application. I have a database which has a few nested relations. There is a feature which depicts the history of a large chain of relations. It is essentially a data analysis feature. The issue is that in order to search, a large object graph must be loaded - the loading time for this object graph is not quick enough to be viable. The problem is that without loading the whole graph it makes searching from a single string nearly impossible. In order to search, explicit fields must be specified and the search data supplied.
Is there a design pattern for exposing the data in a way which facilitates a single string search instead of having to explicitly define parameters?
