Lucene: Status=Open

[Save this search]

Author relation

Updated ago

Comment count

Reaction count

Review Requested

User

Last comment user

Type

Filters: Status (Open), Issue type, Author relation, Created, Updated, Updated ago, Comment count, Reaction count, Review Requested, Mentioned, Reviewed, Commented, User, Last comment user, Draft, Component, Type, Labels, Commits?, Reporter, Assignee

#15903 PR: Add TurboQuant rotation-based vector quantization codec to sandbox

48.6 minutes ago 15 comments 0 votes 0 watches benwtrent, github-actions[bot], mccullocht, mikemccand, tveasey, xande

# Summary This PR adds a new FlatVectorsFormat implementation based on the TurboQuant algorithm ... This implementation was co-authored with an AI coding agent (Kiro) as an experiment in AI-assisted ... The agent handled the bulk of the code generation, test writing, and iterative debugging while I ...

tveasey 48.6 minutes ago:	> This could be the most interesting direction (and MAY explain our low recall values on internal ... For some data sets the uplift can be dramatic. This is usually the only reason we see bad accuracy with OSQ, although low dimension vectors are ...
xande 1 day ago:	Thanks everyone for the incredibly thorough feedback. This is exactly the kind of review I was hoping for. I spent some time with Kiro going back through the paper, the Elastic OSQ blog posts, and the ...

#15936 PR: Introduce BlockGroupingCollectorManager

6.9 hours ago 0 comments 0 votes 0 watches gaobinlong, github-actions[bot]

Description BlockGroupingCollector in grouping package did not have until now a corresponding ... This PR also implements a new TopGroups.mergeBlockGroup() method to merge blocking TopGroups() ... Relates to https://github.com/apache/lucene/issues/12892.

#15905: ReaderUtil.partitionByLeaf API design: ordinal tracking for scatter/gather pattern

18.2 hours ago 4 comments 0 votes 0 watches gsmiller, mikemccand, zihanx

# Description: Following up on the recently merged ReaderUtil.partitionByLeaf API (https:// ... The doc-values retriever would: - Take an IndexReader, int[] globalDocIds, and DoubleValuesSource[ ... We need ordinal tracking. # Design options: 1.

gsmiller 18.2 hours ago:	With-respect-to ScoreDoc[] vs. int[], I agree with what you're saying about Option 1 vs. Option 3. Ultimately, I'm slightly concerned we're going to end up with four methods proposed by the end of ...
zihanx 21.6 hours ago:	Thanks @gsmiller for the feedback and the benchmark! Really appreciate your help! To answer your questions: 1.

#15854 PR: build(deps): update ansible requirement from <9 to <14 in /dev-tools

19.2 hours ago 1 comments 0 votes 0 watches dependabot[bot], github-actions[bot], rmuir

Updates the requirements on ansible to permit the latest version. <details> <summary>Commits</summary> <ul> <li><a href="https://github.com/ansible-community/ ... </li><li><a href="https://github.com/ansible-community/ansible-build-data/commit/dc578db41525dbc1ee4 ...

github-actions[bot] 19.2 hours ago:

This PR has not had activity in the past 2 weeks, labeling it as stale. If the PR is waiting for review, notify the dev@lucene.apache.org list. Thank you for your contribution!

#15770: Coordinate DocValues skip list evaluation across multiple fields in conjunction queries

22.7 hours ago 1 comments 0 votes 0 watches romseygeek, sgup432

Description When a query combines multiple numeric range filters in a conjunction (e.g., price:[ ... Each field reads its own skip metadata and classifies blocks (4,096 docs each) as YES/NO/MAYBE ... The conjunction is resolved at the document level by ConjunctionDISI.

sgup432 1.2 months ago:

I already wrote most of the logic for this, and tried to create and run a JMH benchmark against my ... Will add the numbers here.

#15934: Explore binary search in ReaderUtil#partitionByLeaf

1 day ago 3 comments 0 votes 0 watches gsmiller

DescriptionIn our current implementation, we linearly scan an array of sorted docIDs and compare ... I'm curious if a binary search approach might work better. The idea would be to iterate the leaves in order (which we're already doing) and bsearch the sorted ...

gsmiller 1 day ago:	I made the binary search approach a bit smarter and reran benchmarks. Providing new results and an AI-generated summary: ` Benchmark ... The difference is only in the partition step: - Linear: scan sorted doc IDs, advance leaf ...
gsmiller 1.1 days ago:	Modified my benchmark and got some results: ` Benchmark ... When leaves greatly outnumber docs (e.g., 200 leaves for 100 docs), the binary search approach ... The linear scan only touches the 100 doc IDs. - In absolute terms, even the largest differences are ...

#15933 PR: Add jmh benchmark for ReaderUtil#partitionByLeaf approaches

1 day ago 0 comments 0 votes 0 watches github-actions[bot], gsmiller

To support discussion in GH#15905 and an idea captured in GH#15934

«
1
2
3
4
5
»

2,554 issues

[21.4 msec search, 22.3 msec total]