go-sstables
tantivy
go-sstables | tantivy | |
---|---|---|
4 | 48 | |
255 | 10,017 | |
- | 2.8% | |
4.0 | 9.1 | |
2 months ago | 4 days ago | |
Go | Rust | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
go-sstables
- GitHub - thomasjungblut/go-sstables: Go library for protobuf compatible sstables, a skiplist, a recordio format and other database building blocks like a write-ahead log. Ships now with an embedded key-value store.
-
I want to dive into how to make search engines
I've never worked on a project that encompasses as many computer science algorithms as a search engine. There are a lot of topics you can lookup in "Information Storage and Retrieval":
- Tries (patricia, radix, etc...)
- Trees (b-trees, b+trees, merkle trees, log-structured merge-tree, etc..)
- Consensus (raft, paxos, etc..)
- Block storage (disk block size optimizations, mmap files, delta storage, etc..)
- Probabilistic filters (hyperloloog, bloom filters, etc...)
- Binary Search (sstables, sorted inverted indexes, roaring bitmaps)
- Ranking (pagerank, tf/idf, bm25, etc...)
- NLP (stemming, POS tagging, subject identification, sentiment analysis etc...)
- HTML (document parsing/lexing)
- Images (exif extraction, removal, resizing / proxying, etc...)
- Queues (SQS, NATS, Apollo, etc...)
- Clustering (k-means, density, hierarchical, gaussian distributions, etc...)
- Rate limiting (leaky bucket, windowed, etc...)
- Compression
- Applied linear algebra
- Text processing (unicode-normalization, slugify, sanitation, lossless and lossy hashing like metaphone and document fingerprinting)
- etc...
I'm sure there is plenty more I've missed. There are lots of generic structures involved like hashes, linked-lists, skip-lists, heaps and priority queues and this is just to get 2000's level basic tech.
- https://github.com/quickwit-oss/tantivy
- https://github.com/valeriansaliou/sonic
- https://github.com/mosuka/phalanx
- https://github.com/meilisearch/MeiliSearch
- https://github.com/blevesearch/bleve
- https://github.com/thomasjungblut/go-sstables
A lot of people new to this space mistakenly think you can just throw elastic search or postgres fulltext search in front of terabytes of records and have something decent. The problem is that search with good rankings often requires custom storage so calculations can be sharded among multiple nodes and you can do layered ranking without passing huge blobs of results between systems.
-
What's the big deal about key-value databases like FoundationDB ands RocksDB?
I highly recommend people comfortable with Go checkout the building blocks at https://github.com/thomasjungblut/go-sstables
This codebase shows how SSTables, WAL, memtables, skiplists, segment files, and plenty of other storage engine components work in a digestible way. Includes a demo database showing how it all comes together.
- Understanding LSM Trees: What Powers Write-Heavy Databases
tantivy
-
SeekStorm VS tantivy - a user suggested alternative
2 projects | 22 Mar 2024
-
What is Hybrid Search?
Tantivy - a full-text indexing library written in Rust. Has a great performance and featureset.
- Tantivy – Fast, OSS full-text search library in Rust
-
RAG Using Unstructured Data and Role of Knowledge Graphs
By this I presume you mean build a search index that can retrieve results based on keywords? I know certain databases use Lucene to build a keyword-based index on top of unstructured blobs of data. Another alternative is to use Tantivy (https://github.com/quickwit-oss/tantivy), a Rust version of Lucene, if building search indices via Java isn't your cup of tea :)
Both libraries offer multilingual support for keywords, I believe, so that's a benefit to vector search where multilingual embedding models are rather expensive.
-
Show HN: Quickwit – OSS Alternative to Elasticsearch, Splunk, Datadog
We also implemented our schemaless columnar storage optimized for object storage.
The inverted index and columnar storage are part of tantivy [0], which is the fastest search library out there. We maintain it and we decided to build the distributed engine on top of it.
[0] tantivy github repo: https://github.com/quickwit-oss/tantivy
-
Pg_bm25: Elastic-Quality Full Text Search Inside Postgres
The issue for geo search is here: https://github.com/quickwit-oss/tantivy/issues/44
-
Grimoire - A recipe management application.
Search index : Custom-built using tantivy.
-
A Compressed Indexable Bitset
The roaring bitmap variant is used only for the optional index (1 docid => 0 or 1 value) in the columnar storage (DocValues), not for the inverted index. Since this is used for aggregation, some queries may be a full scan.
The inverted index in tantivy uses bitpacked values of 128 elements with a skip index on top.
> I didn't follow the rest of your comment, select is what EF is good at, every other data structure needs a lot more scanning once you land on the right chunk. With BMI2 you can also use the PDEP instruction to accelerate the final select on a 64-bit block
The select for the sparse codec is a [simple array index access](https://github.com/quickwit-oss/tantivy/blob/main/columnar/s...), that is hard to beat. Compression is not good near the 5k threshold though.
-
Job: Rust + Retrieval Systems at Etsy
Hi /r/rust, I’m a SWE on Etsy’s Retrieval Systems team where we’re building a platform based on rust and tantivy (https://github.com/quickwit-oss/tantivy). We’re looking to bring two new engineers onto the team.
-
Announcing Velo - Your Rust-Powered Brainstorming and Note-Taking Tool
Quick Search: Easily find specific notes with Velo's fuzzy-search feature, powered by tantivy. tantivy might have been a little overkill, but it was really easy to integrate.
What are some alternatives?
search-engines - Reviewing alternative search engines
sonic - 🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM.
phalanx - Phalanx is a cloud-native distributed search engine that provides endpoints through gRPC and traditional RESTful API.
surrealdb - A scalable, distributed, collaborative, document-graph database, for the realtime web
pytai - Kaitai Struct: Visualizer and Hex Viewer GUI in Python
milli - Search engine library for Meilisearch ⚡️
hse - HSE: Heterogeneous-memory storage engine
MeiliSearch - A lightning-fast search API that fits effortlessly into your apps, websites, and workflow
mitta-screenshot - Mitta's Chrome extension for saving the current view of a website.
quickwit - Cloud-native search engine for observability. An open-source alternative to Datadog, Elasticsearch, Loki, and Tempo.
search-lib - A library of classes which can be used to build a search engine.
fselect - Find files with SQL-like queries