[quant]

I use UR on a daily basis, and even though I put inside my main database only the most important info, I start to have problems when inserting new information to keep my db consistent and without repetitions, or simply when trying to search for sth.

The problem is to find to most relevant data based on your search. With a big db, it is simply not enough just to return items with given keywords. For example I try find whether I already have sth similar in the database. Say I'm going to insert sth about Riemann integrable functions, I can try to search for these three keywords, but the search result might return nothing, so I can try to search for Riemann integrable or Riemann functions or integrable functions ... maybe again nothing or too many results ... if there are too many results, it's hard to see which are the most relevant because there is no ranking.

The point is, that the relevance search would be the most appropriate for this, and would help a lot in the process of keeping db "healthy".

The basic "relevance" attribute could simply be based on

1. how many of the searched keywords it has,
2. how often a keyword occurs,
3. and if they occur in the title.

The point 1 is very important, cause it doesn't need to have all of the searched keywords and it is very time consuming or impossible to create a search with all the combinations of the searched keywords.

There are many PIM programs that allow fast insertion of various informations, but the real strength of any of such programs shows only when you want to get sth out of it. The fast indexed search is great, but nothing special by today's standards.

IMHO, the relevance search is the next step in the direction of making a great PIM program.

Thank you! Any ideas?