suffix tree + index [LUCENE-7405]
- Dominant language
- Java
- Stars
- 3.6k
- Forks
- 1.4k
- Avg merge
- 2d 11h
- Merged PRs (30d)
- 88
Description
You can develop a global suffix tree for string fields.
in this way when you are in a node of this tree you can know all nodes field instances with same prefix.
This criterion could be extended also to numeric field for compare all fields (or a subset to define before) of all documents.
comparing the relative positions of 2 nodes you can understand the order (<=>) in fast way.
this could be used for extend query comparation in dynamic way to different document type or fields in different documents.
It is important to define the subset where to apply this algorithm(example: for example : all document with properties 'name' & 'surname' ). This could be used also for joining document of different times.
---
Migrated from [LUCENE-7405](https://issues.apache.org/jira/browse/LUCENE-7405) by Cristian Lorenzetto
Contributor guide
Research direction
The issue names no source files, tests, or entry points; start with the migrated LUCENE-7405 discussion and Lucene's indexing and query documentation. Define the supported string and numeric fields, document subset, ordering comparisons, and cross-document query or join behavior before judging implementation completion.
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