Improve search result ranking and relevance ordering for campaign and donation queries

[grantfox-oss]

Context

The search service in src/services/search.service.ts currently uses simple contains matching and basic ordering. This works for basic lookup, but it does not rank results by relevance or make the ordering feel intuitive for users searching across campaigns and donations.

Problem statement

Implement a lightweight relevance ranking approach for search results so that more relevant campaign and donation matches appear earlier, while still preserving stable pagination and filtering behavior.

Current behavior

• Campaign and donation searches use simple substring matching and sort by a single field such as creation date.
• There is no relevance-based ranking beyond the raw query match.

Required behavior

• Search results should be ordered by a simple relevance score derived from the query and the matched fields.
• The ranking should remain deterministic and compatible with existing pagination.
• The ranking should not make searches slower than the current basic implementation in a meaningful way.

Constraints

• The change should stay within the current Prisma and service architecture.
• No external search engine is required.

Acceptance criteria

• Search results for a query return the most relevant matches first.
• Pagination remains stable with the new ranking logic.
• Unit tests cover ranking behavior for simple query cases.

Out of scope

• Building a full-text search engine or semantic search system.
• Rewriting the search API schema.

Hints and references

• Review the current contains-based filters and the existing sort logic in the search service.

[felixakintoyese]

I have the necessary experience to execute this task perfectly within a good time frame.

[felixakintoyese]

I have the necessary experience to execute this task perfectly within a good time frame.

[Glam26]

Hi! I'd like to take this on.

I'll start by reviewing the current implementation to understand how this feature fits into the existing codebase, then implement the requested changes in a way that's consistent with the project's architecture and conventions.

My goal is to:

• Implement all requirements outlined in the issue.
• Keep the solution clean, maintainable, and minimally invasive.
• Add or update tests covering the new behavior, including edge cases where appropriate.
• Verify that the implementation satisfies the acceptance criteria and doesn't introduce regressions.

I'll share a PR with a clear summary of the changes, testing performed, and any design decisions made during implementation.

[Menjay7]

Hi! I came across this issue and would love to work on it. I have experience with similar tasks and I'm confident I can investigate, implement a clean solution, and thoroughly test it before submitting a PR. If the issue is still open, I would appreciate it if you could assign it to me. Thank you!

[Glam26]

Hi! I'd like to take this on.

I'll start by reviewing the current implementation to understand how this feature fits into the existing codebase, then implement the requested changes in a way that's consistent with the project's architecture and conventions.

My goal is to:

• Implement all requirements outlined in the issue.
• Keep the solution clean, maintainable, and minimally invasive.
• Add or update tests covering the new behavior, including edge cases where appropriate.
• Verify that the implementation satisfies the acceptance criteria and doesn't introduce regressions.

I'll share a PR with a clear summary of the changes, testing performed, and any design decisions made during implementation.

[jaynomyaro]

Hi! I’m a full-stack developer with a strong blockchain background. I’d love to handle this issue and can deliver a clean, reliable solution. Kindly assign it to me.

[Noubata]

I can submit a PR within 2 days

[DingiDinigi]

I'm a full-stack developer with production experience in Node.js, TypeScript, and Prisma-based backends, including building and optimizing query logic for real-world data services. I've reviewed the current search implementation and understand the gap between basic substring matching and true relevance ordering. I have a clear approach for adding a lightweight, deterministic relevance score that stays within the existing Prisma architecture, preserves stable pagination, and won't introduce meaningful performance overhead. I'll back it with unit tests covering the ranking behavior specified in the acceptance criteria, and can deliver within the timeframe.

[nurudeenheroic]

Hello! I've reviewed the issue and can implement an efficient fix.I'm confident I can deliver a solution that meets your expectations.