Re: Fulltext query with custom rank

Tech-Archive recommends: Repair Windows Errors & Optimize Windows Performance



Hi Yuri,

very interesting, were you able to manipulate the fulltext index
ranking, i.e. would

containstable(Products, Name, '"Screw*"', 10)

return the top 10 results as calculated by your algorithm?

Do you maybe have a link or a topic to look for about this kind of CLR
integration?

Regards
DC


On 15 Mai, 20:41, ynogin <yno...@xxxxxxxxxxxxxxxxxxxxxxxxx> wrote:
DC,
I've created my own CLR function and use it instead of FTS rank. It gives
much better result (by similarity)
I use Levenshtein Edit distance to calculate the score.

Thanks,

Yuri



"DC" wrote:
Hi,

I brought this up once ago, but I read something which might open a
new possibility. What I am trying to do is this:

select p.Name, p.Score, ft.Rank
from Products p
join (
select [key], rank from
containstable(Products, Name, '"Screw*"', 10)
) as ft
on ft.[key]= p.ProductId
order by p.Score desc

Let's say "Products" contains one million products and there are 20000
matching products containing "screw" as a part of their name. What I
want to get are the top 10 products matching the query, but the FT
rank should equal the Score rank. I don't want this:

containstable(Products, Name, '"Screw*"', 50000)

and then join the resulting 20000 rows with products and order the set
by Score, since that will be too expensive.

Best would be, if I could actually set the value that the ranking
algorithm is based on. The indexer would simply use Score as the
predominant factor for the ranking. So

containstable(Products, Name, '"Screw*"', 10)

would return the first 10 matches but sorted by Score.

From what I know this is not possible with FT in 2000 or 2005, but I
read that it is possible to use CLR integration to customize the
indexing process. However, I could not find anything in the docs about
that. Maybe one can only create indexes and stuff like that, but I am
still hoping that someone has a clue on how to possibly manipulate FT
rank in SQL Server 2005.

Kind regards
DC- Zitierten Text ausblenden -

- Zitierten Text anzeigen -


.



Relevant Pages

  • RE: How EXACTLY does Indexing Service determine rank
    ... the point that they are adjacent becoming a phrase and raising the rank ... The ranking mechanism is weighted so that the more highly inflected ... the linguistic engine and ranking algorithm ... Indexing Service is based on ranking formulas that are used everywhere from ...
    (microsoft.public.inetserver.indexserver)
  • Questions about ranking theory
    ... I hav a question about the ranking theory (the thing Google ... V:=eigenvector of A corresponding to largest real eigenvalue ... V contains some measure of the rank. ... algorithm that would consider the verticies appearing sooner ...
    (sci.math)
  • Re: Increasing your PAGE RANK
    ... >> Participating in link schemes is a way to increase page rank, ... so the site 'spam ranking' will ... I have a "useful links" page on one site for people who want ... > to do a link exchange. ...
    (alt.internet.search-engines)
  • Re: Integrating results from different pages? (No luck w/ INDEX &
    ... ranking for every player that has a ranking. ... Most of my source come in the format "Rank. ... Lastname" match a cell that is a formula that gives the same result? ... > Now you have all the names in sheet3 ...
    (microsoft.public.excel.misc)
  • Re: A letter want to disprove my paper which submitted recently
    ... The rank of binary matrix could be simplify obtaining by Echolon ... so my background in Mathematics ... Symposium on Graph Theory and Combinatorial Algorithms ". ... algorithm and use it to crack every RSA crypto on the planet. ...
    (comp.theory)