Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Weighted quick search ordering #175

Open
1 of 11 tasks
Kaptard opened this issue Nov 8, 2018 · 1 comment
Open
1 of 11 tasks

Weighted quick search ordering #175

Kaptard opened this issue Nov 8, 2018 · 1 comment

Comments

@Kaptard
Copy link
Member

Kaptard commented Nov 8, 2018

I'm submitting a...

  • Bug report
  • Feature request
  • Documentation issue or request

Current behavior

Returns search results by closest match.


Expected behavior

Should return most popular items first.


Minimal reproduction of the problem

Seems trivial. People want the important stuff first, especially in a quick search,
where they're not likely to look for obscure items.


Environment

Browser:

  • Chrome (desktop) version:
  • Chrome (Android) version:
  • Chrome (iOS) version:
  • Firefox version:
  • Safari (desktop) version:
  • Safari (iOS) version:
  • IE version:
  • Edge version:

For development issues:

  • Node version:
  • Operating System:

Additional Description

I'm suggesting a system where the last viewed item always gets pushed to the top.
On average, that should result in what people want, and is probably the most dynamic
option.

@Nakroma
Copy link
Member

Nakroma commented Jan 22, 2020

How do you imagine the dynamic system in the additional description? Having a big redis list with the top ~200 items inside?
My first thought for implementing that would be a simple searchRank inside the item database

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants