BTree index [LUCENE-5009]
- Dominant language
- Java
- Stars
- 3.6k
- Forks
- 1.4k
- Avg merge
- 2d 11h
- Merged PRs (30d)
- 88
Description
Currently Lucene use skip list index for better index speed. Some use case need B Tree index, such as Patent search . Documents add by day. It not need real time search , but need large volume search.
There are some B Tree index implement . such as http://algs4.cs.princeton.edu/62btrees/BTree.java.html .
---
Migrated from [LUCENE-5009](https://issues.apache.org/jira/browse/LUCENE-5009) by Gang Luo
Contributor guide
Research direction
The issue names no Lucene files, tests, or entry points. Start by locating the current skip-list indexing path, then review the referenced Princeton BTree.java example and Lucene's indexing architecture. Done would require an agreed B-tree design, implementation scope, and tests showing it supports the stated large-volume search use case.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- backend, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 15/100