RediSearch implements a search engine on top of Redis, but unlike other Redis search libraries, it does not use internal data structures like Sorted Sets.
Inverted indexes are stored as a special compressed data type that allows for fast indexing and search speed, and low memory footprint.
This also enables more advanced features, like exact phrase matching and numeric filtering for text queries, that are not possible or efficient with traditional Redis search approaches.
- Full-Text indexing of multiple fields in documents.
- Incremental indexing without performance loss.
- Document ranking (provided manually by the user at index time).
- Complex boolean queries with AND, OR, NOT operators between sub-queries.
- Optional query clauses.
- Prefix based searches.
- Field weights.
- Auto-complete suggestions (with fuzzy prefix suggestions).
- Exact Phrase Search, Slop based search.
- Stemming based query expansion in many languages (using Snowball).
- Support for logographic (Chinese, etc.) tokenization and querying (using Friso)
- Support for custom functions for query expansion and scoring (see Extensions).
- Limiting searches to specific document fields (up to 128 fields supported).
- Numeric filters and ranges.
- Geographical search utilizing Redis’ own Geo commands.
- A powerful aggregations engine.
- Unicode support (UTF-8 input required).
- Retrieve full document content or just ids.
- Automatically index existing HASH keys as documents.
- Document deletion and updating with index garbage collection.
- Partial and conditional document updates.
- Sortable properties (i.e. sorting users by age or name).