Traverse query

Traverse query #

Term and full-text queries match document content; none of them can ask “what is connected to these documents?” — the question citation graphs, reference data and knowledge graphs are made of. The traverse query answers it: a bounded graph traversal over a relation-typed edge field — starting from seed documents, walk the edges up to max_depth hops and emit every reached node as a hit.

Scores encode distance — 1.0 / (1.0 + depth) — so seeds outrank 1-hop neighbors, which outrank 2-hop neighbors, and the standard top-K collector orders the results.