My simple SQLite FTS3 implementation currently matches user queries with stored results and returns them as long as these results contain all the words in the user query (in other words, the FTS table was created using a simple tokenizer).
Now, I want to make the search more intelligent in that, I want it to rank/order results based on the number of words in the query that match results. For instance,
SELECT name FROM nametable WHERE name MATCH 'fast food restaurant'
which currently returns
SUBWAY FAST FOOD RESTAURANT
MCDONALDS FAST FOOD RESTAURANT
should return
SUBWAY FAST FOOD RESTAURANT
MCDONALDS FAST FOOD RESTAURANT
CHIPOTLE FAST FOOD
PIZZA FAST FOOD
GOOD FOOD OUTLET
in that order. In other words, the search output should not be restricted to results which necessarily contain all words of user queries, rather, place results that contain all words higher u开发者_如何学运维p in the list while making room for results that return a partial match.
One simple way of doing this is to run multiple queries using all permutations of the user's input and UNION the results in the required order, but that would be rather inefficient.
More easily just do:
SELECT name FROM nametable WHERE name MATCH 'fast OR food OR restaurant'
No need to handle multiple queries.
Here is an untested idea.
SELECT name
FROM (
SELECT name, 1 as matched
FROM nametable
WHERE name MATCH 'fast'
UNION ALL
SELECT name, 1 as matched
FROM nametable
WHERE name MATCH 'food'
UNION ALL
SELECT name, 1 as matched
FROM nametable
WHERE name MATCH 'restaurant'
)
GROUP BY name
ORDER BY SUM(matched) DESC, name
精彩评论