I have a suggestion, a improvement of the search engine. When searching on the internet with ex. Yahoo, you can add “ symbols, witch would be very useful.
I tried to search for a band named The polis, it gave a lot of results, but none of the mp3s were made by the right band.
The result were a lot of “metroPOLIS…oTHErs�
It can be fixed, can’t it?
Improvement of the search engine
Moderator: Moderators
-
- Posts: 1
- Joined: 2003-07-18 16:37
Improvement of the search engine
Bazzi of Dawn - the Carpenter of your street.
A Carpenter for your girl.
<<<<<<<<<<<<<<<*>>>>>>>>>>>>>>>
A Carpenter for your girl.
<<<<<<<<<<<<<<<*>>>>>>>>>>>>>>>
-
- DC++ Contributor
- Posts: 3212
- Joined: 2003-01-07 21:46
- Location: .pa.us
Re: Improvement of the search engine
I think the easiest solution for this would be strict ordering for theBazzi of Dawn wrote:I have a suggestion, a improvement of the search engine. When searching on the internet with ex. Yahoo, you can add ? symbols, witch would be very useful.
I tried to search for a band named The polis, it gave a lot of results, but none of the mp3s were made by the right band.
The result were a lot of ?metroPOLIS?oTHErs?
It can be fixed, can?t it?
substring matches (which in turn would further optimize it).
A search for "The Polis" would match:
THE metroPOLIS
but not "metroPOLIS THE", since THE isn't first...
I wrote QuickDC - A DC++ compatible client for Linux and FreeBSD.
Ehh. I don't like that idea.
Say I want the Loony Toons cartoon starring Bugs Bunny named "The Tortoise and the Hare". Using your method, if I type 'Tortoise Hare', then I wouldn't receive results like "The Hare and the Tortoise".
Granted, neither would the other idea. But, I don't see how the substring ordering will really improve search accuracy.
How about the simple pull-down menu of "all" or "any" or "exact"? I guess the same problems occur. But I don't think there would be any noticable "drag" with somewhat efficient code. Most machines are up above 2 GHz and 512 MB RAM.
Say I want the Loony Toons cartoon starring Bugs Bunny named "The Tortoise and the Hare". Using your method, if I type 'Tortoise Hare', then I wouldn't receive results like "The Hare and the Tortoise".
Granted, neither would the other idea. But, I don't see how the substring ordering will really improve search accuracy.
How about the simple pull-down menu of "all" or "any" or "exact"? I guess the same problems occur. But I don't think there would be any noticable "drag" with somewhat efficient code. Most machines are up above 2 GHz and 512 MB RAM.
most machines eh? lol
http://whyrar.omfg.se - Guide to RAR and DC behaviour!
http://bodstrom.omfg.se - Bodströmsamhället, Länksamling om hoten mot vår personliga integritet
http://bodstrom.omfg.se - Bodströmsamhället, Länksamling om hoten mot vår personliga integritet
Search: "Turtoise Hare" for the file with name: "The Turtoise and the Hare".jbyrd wrote:Ehh. I don't like that idea.
Granted, neither would the other idea. But, I don't see how the substring ordering will really improve search accuracy.
How about the simple pull-down menu of "all" or "any" or "exact"? I guess the same problems occur. But I don't think there would be any noticable "drag" with somewhat efficient code. Most machines are up above 2 GHz and 512 MB RAM.
_WILL_ match, because "Hare" comes AFTER "Toroise", however
Search: "Hare Turtoise" will NOT match.
This way we can reduce CPU _some_, and keep correct search results.
Substring matching is expensive, it's alot less expensive with exact matches but that will not work here unfortunately.
I wrote QuickDC - A DC++ compatible client for Linux and FreeBSD.
DJ Offset wrote:Search: "Turtoise Hare" for the file with name: "The Turtoise and the Hare".
_WILL_ match, because "Hare" comes AFTER "Toroise", however
Search: "Hare Turtoise" will NOT match
You are saying the same thing that I said, except mine has a point to it. My point is, if the file name isn't in the exact order that you *think* it is, then you're going to miss out on files. Some may name it "Tortoise and the Hare", some may name it "Hare and Tortoise". Nevermind.I wrote:Using your method, if I type 'Tortoise Hare', then I wouldn't receive results like "The Hare and the Tortoise".
Again, I don't see how the substring ordering will really improve search accuracy. The method should look at the search terms given, and find them only, not words that ^contain^ the search terms. I'm no c++ wizard, but it seems that if you don't look for names ^containing^ terms, and just those that are the terms, it would take up less cpu.