Experience pattern recognition search with unmatched speed and typo tolerance.
v3.3.0.5 $ dotnet add package IndxSearchLib
This demo shows out-of-box performance. The dataset has not been altered in any way.
The core technology of traditional search systems has remained unchanged for decades.
Indx introduces a fundamental change in search technology, and a significant leap forward.
Punctuation
Language
Indx's unique approach doesn't rely on traditional linguistic structures.
The system operates without knowing what a word or a comma is. Instead it uses pattern recognition, a method more similar to the human brain.
Indx redefines the search technology landscape, rendering traditional search principles like stop-words and tuning increasingly obsolete.
Indx is exceptionally adept at handling spelling errors. It also uniquely matches queries across words.
See benefits
When indexing, a relevancy model is generated by extracting features from all documents.
The features contains essential parameters like frequency and rarity which are mapped as vectors into a multi-dimensional hypersphere.
![A black and white image of vectors mapped into a multi-dimensional hypersphere](/images/hypersphere.webp)
When searching, the features of the search query are mapped into this space, and the search results are arranged in the order of the applied distance measure.
Indx performs a search on entire sentences, not just the underlying keywords. This means better matching across words, for incomplete names, and spelling variations.
Why develop with Indx?
Indx is a better starting point for enterprise search applications.
Read the docsBenchmarks
indx | solr | elastic | |
Index ~44000 airports | 0,5 seconds 4x faster | 2,1 seconds 4x slower | 3,7 seconds 7x slower |
Search 44K records | 0,08 ms 200x faster | 16-50 ms 200x slower | 53-155 ms 660x slower |
Index ~1 Million music artists | 3,8 seconds 4x faster | 15,7 seconds 4x slower | 30,5 seconds 8x slower |
Search 1M records | 0,55 ms 38x faster | 88-205 ms 160x slower | 21-340 ms 38x slower |
Fuzzy algorithm | Relevancy Ranking | Levenshtein | Levenshtein |
Fuzzy limitation | Unlimited | Max 2 characters | Max 2 characters |
Installation size | 178 kB | 583 MB | 706 MB |
Benchmarks were performed with identical datasets and hardware.
OurAirports -> 44.015 medium and large airports
MusicBrainz -> 1.001.018 music artists
Indx features an unmatched fault–tolerance and answers in microseconds
Benefits
Development options
.NET C# class library
- Self hosted with unlimited usage
- Recommended for .NET projects and projects with a large volume of data to index and search
- GDPR compliance by self-hosting
REST API on Azure
![Microsoft Azure logo](/images/azure.png)
- Easy to get started
- Highly compatible with your existing tech stack
- EU Norway East servers