36 مستودعات
Organizing strings in tree structures for efficient membership testing.
Distinct from String Processing Algorithms: Focuses on tree-based storage for strings, distinct from general string processing.
Explore 36 awesome GitHub repositories matching software engineering & architecture · Tree-Based Storage. Refine with filters or upvote what's useful.
Fuel Core is a Rust-based implementation of a distributed ledger and a full node for the Fuel v2 protocol. It functions as a layer 2 blockchain client designed to execute binary encoded transactions and synchronize shared state across a decentralized network. The system utilizes a deterministic state machine to ensure all nodes reach the same ledger state and employs a binary-encoded message protocol for network communication. It provides the ability to operate full network nodes or bootstrap private local instances for development and testing. The project covers a broad set of capabilities
Persists ledger states using a Merkle tree structure for efficient cryptographic verification of blockchain data.
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
Implements a radix tree for high-performance string lookups and deletions.
This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin
Organizes strings in tree structures for efficient membership testing.
Dolt is a relational database engine that integrates version control directly into the database management layer. It functions as a version-controlled SQL database that tracks every row and schema change using a commit-based history, allowing users to branch, merge, and audit data modifications. By implementing a wire-protocol-compatible server, the system enables standard SQL clients and tools to interact with versioned data as if they were connecting to a traditional relational database. The platform distinguishes itself by applying repository-style workflows to data management, including s
Organizes data into a content-addressed tree structure to enable efficient snapshots, deduplication, and rapid comparison of database states.
IPFS is a peer-to-peer hypermedia protocol and content-addressed storage system that identifies data by cryptographic hashes rather than network locations. It enables the creation of a decentralized web by organizing files and directories as directed acyclic graphs of linked content identifiers. The project differentiates itself through the use of a distributed hash table for locating peers and a system of signed records to map human-readable names to changing content. It also provides HTTP gateways that translate standard web requests into peer-to-peer queries, allowing decentralized data to
Uses Merkle tree structures and hashing to ensure retrieved data has not been tampered with.
Diem is a distributed ledger technology platform designed for the development of decentralized applications and the execution of programmable financial transactions. It provides a comprehensive framework for operating validator nodes that maintain ledger integrity through a Byzantine fault-tolerant consensus protocol, ensuring consistent state updates across a distributed network of participants. The platform distinguishes itself through a modular node architecture that decouples consensus, execution, and storage to facilitate scalability and maintenance. It utilizes a resource-oriented virtu
A cryptographic data structure that organizes ledger history into hashes to enable efficient verification and integrity checks of state.
ZFS is an enterprise-grade file system and logical volume manager that integrates storage pooling with advanced data protection. It functions as a storage engine that aggregates multiple physical devices into a unified resource pool, allowing for the dynamic allocation of capacity across individual file systems. The system utilizes a transactional, copy-on-write architecture that ensures file system consistency through intent logging and atomic operations. It maintains data integrity by organizing blocks into a hierarchical tree structure, where cryptographic checksums are used to detect and
Organizes data blocks into a hierarchical tree structure where each parent node stores a cryptographic checksum of its children.
Canopy is the official Go implementation of a blockchain node that runs a recursive network architecture, enabling new blockchains to launch as dependent layers that can later graduate into fully independent security roots. The project provides a hybrid consensus mechanism that combines Byzantine fault-tolerant Proof-of-Stake with Verifiable-Delay Functions, delivering instant finality while protecting against long-range attacks through trustless chain age verification. Validators secure multiple chains simultaneously through restaking, where a single bonded stake serves as collateral across t
Generates a single root hash from a sparse Merkle trie and produces cryptographic proofs of data inclusion or non-inclusion.
jemalloc is a general purpose C memory allocator designed as a replacement for the standard library malloc and free functions. It is a multi-threaded allocation library that emphasizes fragmentation avoidance and scalable concurrency for high-performance applications. The project reduces lock contention by using multiple independent memory arenas and thread-local cache layers. It minimizes latency by offloading the reclamation of unused memory pages to asynchronous background threads and utilizes huge page metadata storage to reduce translation lookaside buffer misses. The system includes a
Employs a multi-level radix tree structure to quickly map memory addresses to allocation metadata.
algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec
Compares sequential array-based storage and linked pointer-based storage for binary trees.
libgit2 is a portable, cross-platform C library that provides a programmatic interface for integrating Git version control directly into applications. It serves as a linkable implementation of Git internals, allowing developers to manage repositories and manipulate version control data without requiring a system installation of the Git command line tool. The library functions as an embedded API and object database manager capable of reading and writing commits, trees, blobs, and tags. It includes a network transport client to handle the transfer of repository data over protocols such as SSH a
Uses a hierarchy of hashed trees to represent directory structures for efficient state comparison and snapshots.
atproto is a decentralized social networking protocol implementation and a schema-driven API framework. It provides the networking and data standards required to build interoperable social networks where users control their own identity and data through a personal data server specification. The project distinguishes itself through a DID-based identity system for managing cryptographic keys and verifiable profiles, alongside a lexicon-based protocol definition that uses versioned schemas to ensure consistency across network services. It utilizes Merkle Search Trees for verifiable data storage,
Organizes repository data in a verifiable Merkle Search Tree to enable efficient synchronization.
immudb is a tamperproof database that maintains an immutable record of entries using cryptographic commit logging. It ensures verifiable database integrity by utilizing Merkle trees to generate membership and consistency proofs that detect unauthorized data alterations. The system employs a multi-model storage engine that unifies key-value, document, and relational data structures within a single immutable backend. It provides compatibility with the PostgreSQL wire protocol, allowing it to integrate with standard SQL clients, ORMs, and database tools. The project covers broad capabilities in
Employs Merkle trees to generate cryptographic membership and consistency proofs that verify data integrity.
This project is a comprehensive knowledge base and study resource designed for mastering technical interviews. It provides structured guides, roadmaps, and curricula focused on data structures, algorithms, system design, and frontend engineering to help candidates prepare for software engineering screenings. The repository distinguishes itself by offering a holistic approach to professional advancement. Beyond technical drills, it includes a career development handbook covering resume optimization, salary benchmarking, and strategic negotiation coaching. It also provides detailed methodologie
Explains the use of Merkle trees to repair inconsistencies between replicas by transferring differing data segments.
Orbit DB is a decentralized NoSQL database that utilizes conflict-free replicated data types to ensure eventual consistency across a network of nodes. It functions as a peer-to-peer data store that uses IPFS for content-addressing and synchronization, allowing for the maintenance of application state without a central server or authority. The system is built upon a cryptographically verifiable, immutable operation log, which serves as the foundation for custom decentralized data models. This architecture enables the implementation of various data storage patterns, including JSON document stor
Employs Merkle-tree structures to validate the integrity of the distributed operation log.
Dat is a peer-to-peer file synchronization tool that combines an append-only, hash-addressed log with Merkle tree verification, cryptographic access keys, live streaming replication, and swarm networking for sparse, versioned file sharing. It stores file data and metadata in a cryptographically signed, versioned append-only log where each entry is identified by its hash, and uses public-key cryptography to secure archives with separate read and write keys. The tool enables live streaming replication of data between peers as entries are appended, with Merkle tree integrity verification that su
Uses a Merkle tree structure to verify file integrity and enable sparse replication of data chunks.
Noms is a distributed version control database and content-addressable data store. It identifies data by cryptographic hashes to ensure integrity and deduplication, while tracking dataset state changes through a sequence of immutable commits to enable branching, forking, and historical recovery. The system functions as a peer-to-peer data synchronizer, reconciling state between disconnected database instances to ensure all nodes converge on the same data. It distinguishes itself as a schema-flexible document store that supports self-describing types, allowing schemas to evolve and widen as ne
Utilizes Merkle-tree storage engines to efficiently calculate differences between dataset versions and minimize computational overhead.
bup is a deduplicating backup manager and incremental backup system. It uses a Git packfile-based storage format to eliminate redundant data across files and versions, treating every incremental save as a full backup. The system provides secure remote transport interfaces for transferring and managing backup data on remote servers via SSH. It also includes a backup repository browser available as both a web interface and a filesystem mount for exploring and retrieving files from snapshots. The project covers broad capability areas including disaster recovery, repository administration, and s
Organizes file hierarchies into Merkle trees of hashes to represent snapshots and efficiently track changes over time.
This is an educational resource that provides a comprehensive guide to blockchain and distributed ledger technologies, covering everything from fundamental concepts to practical deployment. The guide systematically explains the core architecture of blockchain systems, including consensus-based distributed ledgers, cryptographic hash chains, Merkle trees, and smart contract execution engines, while also detailing permissioned channel architectures and modular service platforms for enterprise use. The resource distinguishes itself by offering a dual-track learning path that serves both non-tech
Verifies data integrity with Merkle trees by organizing hashes into a tree structure to detect changes.
Parity هو تطبيق لعقدة عميل Ethereum مصمم لتشغيل عقدة كاملة، والتحقق من الكتل، والاحتفاظ بنسخة محلية من البلوكشين. يعمل كمحرك لحالة البلوكشين يقوم بتنفيذ العقود الذكية وإدارة حالة السجل الموزع عبر شبكة من الأقران. يتضمن المشروع محرك مزامنة لتنزيل والتحقق من بيانات الكتل التاريخية للوصول إلى ارتفاع الشبكة الحالي، ومدير مفاتيح تشفيرية لإنشاء وتخزين المفاتيح الخاصة المستخدمة لتوقيع المعاملات. يغطي النظام التفاعل مع السجل الموزع عبر واجهة سطر أوامر للاستعلام عن حالة الشبكة وتنفيذ المعاملات. كما يدمج مراسلة الأقران، وآليات الإجماع، والتخزين الموثق تشفيرياً.
Uses a cryptographically verified key-value tree to store blockchain state for efficient lookup and verification.