opensearch-project/query-insights

[FEATURE] Incorporate indexed priority queue in query grouping logic

Open

#251 opened on Feb 27, 2025

View on GitHubContributor guide
 (1 comment) (0 reactions) (0 assignees)Java (34 forks)auto 404
enhancementgood first issue

Repository metrics

Stars
 (27 stars)
PR merge metrics
 (PR metrics pending)

Description

Is your feature request related to a problem?

A clear and concise description of what the problem is, e.g. I'm always frustrated when [...]. Currently we use a priority queue, incorporate indexed priority queue in the grouping logic to make the time complexity go from O(n) to O(logn).

What solution would you like?

A clear and concise description of what you want to happen.

What alternatives have you considered?

A clear and concise description of any alternative solutions or features you've considered.

Do you have any additional context?

Add any other context or screenshots about the feature request here.

Contributor guide

Research direction
Start by searching the repository for 'PriorityQueue' or 'grouping' to locate the query grouping logic. Read the implementation to understand how the priority queue is currently used and why the complexity is O(n). Then research indexed priority queues (e.g., with heap and position tracking) and plan how to integrate one, ensuring existing tests are updated.
Tech stack
java
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
GitJava
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
65