Evaluate offline full-text search backends and record the decision #20
Labels
No labels
area/deployment
area/governance
area/metadata
area/pipeline
area/search
type/data
type/design
type/implementation
type/testing
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Reference
Arkive/arkive#20
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Goal
Build minimal throwaway evaluations against the actual five-document corpus and M2-01 fixtures.
Measure or compare deterministic build behavior, Python integration, CPU use, RAM use, index size, query latency, Unicode handling, filters, portability, citation metadata support, and maintenance burden.
Document licensing and redistribution implications of each candidate dependency.
Record the selected backend and rejected alternatives in a new ADR.
Define the architectural boundary between the search core and presentation.
Delete or clearly isolate disposable evaluation code that is not part of the selected implementation.
Vector or hybrid retrieval.
LLM evaluation.
A user interface.
Premature optimization for a large corpus.
The decision is supported by recorded evidence rather than popularity alone.
The ADR covers offline use, determinism, resources, Unicode, citation support, portability, licensing, and maintenance.
The selected backend can preserve Arkive source, document, and chunk identifiers.
No vector or LLM dependency is introduced.
Record reproducible evaluation commands and environment details.
Verify the selected backend operates with networking disabled.
Review and approve the ADR.