redis / redis/agent-memory-server

docs: empty-text search as the listing/count primitive; relevance cutoff makes semantic search non-enumerating

Open Beginner friendly
#307 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Python
Stars
316
Forks
63
Avg merge
14d 23h
Merged PRs (30d)
1

Description

Summary

Two adjacent behaviors of search_long_term_memory that we live-verified on 0.14.0 and found undocumented:

  1. Empty-text search is a reliable listing primitive. search_long_term_memory(text="", namespace={"eq": ns}, limit=N) returns the namespace's records without semantic filtering — the only dependable way we found to enumerate/count a namespace.
  2. Semantic (non-empty) search applies a relevance cutoff, so it cannot be used to count or enumerate — records that exist simply don't appear for weak queries. We initially misread this as data loss while diagnosing an eventual-consistency question; an explicit doc note would have prevented that.

Ask

Document both: "to list/count a namespace, use empty text; semantic search is top-k with a relevance floor, not an enumeration." If empty-text-as-listing is unintentional and might change, that's even more important to state — consumers (us included: Smart-AI-Memory/attune-ai#666) now depend on it.

Happy to PR the docs note. Context: AMS backs attune-ai's cross-session memory in production.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by locating the documentation for the search_long_term_memory entry point and verify the two behaviors described in the issue. Done means the docs explain empty-text listing/counting and clarify that non-empty semantic search is top-k with a relevance cutoff rather than enumeration.

Written by the indexing model from the issue text.

Assessment

Tech stack
python, redis
Domain
documentation
Issue type
Documentation
Difficulty
2/5
Estimated time
1-3 hours
Activity status
Quiet
Clarity
Mostly clear
Newbie friendliness
68/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.