开源序

Compare projects

Select 2–4 projects to compare on the same basis.

Only identical known values are hidden. Unknown information remains visible.

raptor

The official implementation of RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval

LEANN

Author description: [MLsys2026 Best Paper]: https://arxiv.org/abs/2506.08276. RAG on Everything with LEANN. Enjoy 97% storage savings while running a fast, accurate, and 100% private RAG application on your personal device.

Popularity
Repository stars1,77813,756Highest
7-day net stars——
Fork2361,281Highest
30-day trendInsufficient historyInsufficient history
Maintenance
Last push2024-09-032026-11-02
Maintenance notesNot verifiedNot verified
Repository created2024-02-272025-06-09
License & use
LicenseMIT · PermissiveMIT · Permissive
PricingPricing not verifiedPricing not verified
Basics
Browse by purposeDatabases · Retrieval-augmented generationDatabases · Privacy · Retrieval-augmented generation
TypeApps & systemsApps & systems
SubcategoryDatabases & searchDatabases & search
PlatformNot verifiedNot verified
Cost detailsCheck current official software, hosting, model and infrastructure pricing.Check current official software, hosting, model and infrastructure pricing.
Pricing source——
First collected2026-11-032026-11-03
MetricRepository stars, not unique users or individual-skill installsRepository stars, not unique users or individual-skill installs
LanguagePythonPython
About this projectThe official implementation of RAPTOR: Recursive Abstractive Processing for Tree-Organized RetrievalAuthor description: [MLsys2026 Best Paper]: https://arxiv.org/abs/2506.08276. RAG on Everything with LEANN. Enjoy 97% storage savings while running a fast, accurate, and 100% private RAG application on your personal device.
Measured at2026-11-02 19:03 UTC2026-11-02 19:00 UTC

License tiers are derived from metadata. Check obligations for your use; unknown does not mean prohibited. Ranked by repository stars, one position per repository. Stars and forks are not user counts.