awesome-repositories.com
المدونة
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعحولكيفية ترتيب النتائجالصحافةخادم MCP
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

4 مستودعات

Awesome GitHub RepositoriesIn-Memory Indexes

Systems for maintaining searchable maps of code structures in memory.

Distinguishing note: Designed for rapid cross-referencing of large binary codebases.

Explore 4 awesome GitHub repositories matching data & databases · In-Memory Indexes. Refine with filters or upvote what's useful.

Awesome In-Memory Indexes GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • skylot/jadxالصورة الرمزية لـ skylot

    skylot/jadx

    49,088عرض على GitHub↗

    Jadx is a comprehensive Java decompilation suite designed to transform compiled binary application files into readable source code. It functions as a static analysis workbench, providing a graphical interface for navigating, searching, and inspecting the internal logic of complex software packages. By utilizing a bytecode-to-Java pipeline, the project reconstructs high-level logical structures from low-level binary instructions, making it a primary tool for Android application reverse engineering. The project distinguishes itself through a sophisticated control flow reconstruction engine and

    Maintains a searchable map of classes and methods to enable rapid navigation across large codebases.

    Javaandroiddecompilerdex
    عرض على GitHub↗49,088
  • java-decompiler/jd-guiالصورة الرمزية لـ java-decompiler

    java-decompiler/jd-gui

    15,024عرض على GitHub↗

    This project is a desktop application designed for the reverse engineering and inspection of compiled Java code. It functions as a graphical interface that translates Java bytecode back into readable source code, allowing users to examine the internal logic of class files and archives when original source files are unavailable. The tool provides a structured environment for navigating complex file hierarchies, including nested archives like JAR and WAR files. By maintaining an in-memory representation of loaded classes, it enables rapid searching and cross-referencing of code elements. The ap

    Maintains structured in-memory representations of loaded classes for rapid searching and cross-referencing.

    Java
    عرض على GitHub↗15,024
  • lucaong/minisearchالصورة الرمزية لـ lucaong

    lucaong/minisearch

    5,804عرض على GitHub↗

    Stores term-to-document mappings in a compact in-memory trie for fast full-text lookups without external dependencies.

    TypeScriptautocompleteautosuggestionedge-computing
    عرض على GitHub↗5,804
  • zyedidia/genericالصورة الرمزية لـ zyedidia

    zyedidia/generic

    1,347عرض على GitHub↗

    This project is a comprehensive library of type-safe, high-performance data structures for Go. By leveraging language-level generics, it provides reusable containers and algorithms that eliminate the need for runtime type assertions or interface casting, ensuring efficient and type-safe data management. The library distinguishes itself through its support for persistent data structures and specialized indexing. It utilizes copy-on-write semantics and memory sharing to maintain multiple versions of a collection, allowing for efficient modifications without duplicating entire datasets. Addition

    Provides trie-based indexing for rapid prefix searching and hierarchical data retrieval.

    Godata-structuresgenericsgo
    عرض على GitHub↗1,347
  1. Home
  2. Data & Databases
  3. In-Memory Indexes

استكشف الوسوم الفرعية

  • Code Structure ModelsMaintains structured in-memory representations of loaded classes for rapid searching and cross-referencing. **Distinct from In-Memory Indexes:** Focuses on in-memory class modeling for code analysis, distinct from general-purpose database indexing.
  • Memory Cleanup UtilitiesTools for cleaning up internal references to discarded documents and releasing memory without blocking the main thread. **Distinct from In-Memory Indexes:** Distinct from In-Memory Indexes: focuses on memory reclamation and garbage collection of stale index entries, not on the index structure itself.
  • Recovery ProcessesRebuilding in-memory index structures from persistent storage during startup using producer-consumer patterns. **Distinct from In-Memory Indexes:** Distinct from In-Memory Indexes: focuses on the recovery/rebuild process, not the index structure itself.
  • Trie-Based Inverted IndexesStores term-to-document mappings in a compact trie structure for fast full-text lookups without external dependencies. **Distinct from In-Memory Indexes:** Distinct from In-Memory Indexes: uses a trie structure for term-to-document mappings, not general in-memory indexing.