You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Description
An approach I found often online, is to use a full text search engine such as apache solr for creating and querying the database content, in combination with a key value datastore, such as redis for retrieving the matching items, based on the keys returned from the search.
Adding an index, that can be full text searchable or even simple B+ trees, would be a nice feature.
Just to clarify, by FTS I'm going to assume that you're looking for a way to search across all values in the database (that ofc is for binary strings/unicode strings and not lists). Or if I'm getting you wrong, are you referring to searches for keys by prefixes?
Description
An approach I found often online, is to use a
full text search engine
such as apache solr for creating and querying the database content, in combination with a key value datastore, such as redis for retrieving the matching items, based on the keys returned from the search.Adding an index, that can be
full text searchable
or even simpleB+
trees, would be a nice feature.There exist already some libraries for
full text search
written in rust, such as https://github.com/tantivy-search/tantivyNot sure if it supports also geoindexing such as lucene.
The text was updated successfully, but these errors were encountered: