stefankroes/ancestry
Ancestry
Ancestry is a materialized path tree library for managing hierarchical data models in relational databases. It provides a framework for organizing records into tree structures, allowing for the efficient retrieval of ancestors and descendants through path-based storage.
The project distinguishes itself through specialized tools for maintaining tree integrity and transforming data. It includes a tree integrity manager to handle orphaned nodes and a JSON tree serializer that converts hierarchical database records into nested hashes or arrays for API responses.
The library covers a broad range of tree navigation and modeling capabilities, including preorder traversal sorting, subtree relocation, and depth filtering. It supports multiple primary key types and provides utilities for migrating flat parent-child references into materialized path formats. Performance is managed through denormalized depth caching and subtree update optimizations.
Features
- Hierarchical Data Models - Implements a data model organized as recursive trees for nested information storage using materialized paths.
- Materialized Path Modeling - Provides a framework for organizing records using materialized path storage for efficient subtree retrieval.
- Orphaned Node Recovery - Defines strategies for children of deleted nodes, including destroying, promoting, or reassigning them.
- Hierarchy-to-Hash Serializers - Transforms a subtree into nested hashes or serializable arrays to simplify conversion into JSON format.
- Hierarchical Relation Navigation - Retrieves parents, children, siblings, ancestors, and descendants using specialized scopes and instance methods.
- Indexed Tree Queries - Retrieves ancestors, descendants, siblings, children, or leaves of a node using single indexed database queries.
- Path-Based Relation Traversals - Uses path-based string matching in the database to fetch all ancestors or descendants without recursive application-level lookups.
- Relational Data Models - Provides structures for managing nested parent-child relationships and hierarchical data dependencies within relational databases.
- Orphan Management Tools - Provides a system for handling orphaned nodes and maintaining structural consistency during parent record deletions.
- Structural Consistency Verifiers - Provides tools to check for structural consistency and apply recovery strategies to manage orphaned nodes.
- Structural Integrity Managers - Manages orphaned nodes and ensures structural consistency when moving subtrees or deleting parent records.
- Hierarchical Data Structures - Implements patterns for managing nested parent-child relationships within data collections using materialized paths.
- Hierarchy Integrity Strategies - Implements configurable behaviors such as promotion or recursive deletion to maintain structural integrity when parent nodes are removed.
- Depth Metadata Caches - Stores the depth of nodes in the hierarchy to enable fast filtering and selection of nodes at specific levels.
- JSON Serializers - Ships a utility to convert application-layer hierarchical data into JSON format for API responses.
- Depth Caching Strategies - Stores the integer depth of each node in a separate column for fast filtering of records at specific levels.
- Hierarchy Migration Utilities - Transforms flat parent ID columns into a materialized path tree format during data migration.
- Hierarchy Node Placement - Changes a node position by setting its parent and automatically updating paths for all descendants.
- Metadata Caching - Maintains denormalized columns for depth and child counts to improve the performance of common tree queries.
- Subtree Relocations - Relocates a node and all its descendants to a new position while maintaining the internal structural hierarchy.
- Recursive Data Transformers - Transforms flat database results into nested data structures by iteratively mapping children to parent objects.
- Data Structure Migration - Provides utilities for transforming flat parent ID columns into modernized materialized path formats during data migration.
- Tree Depth Filtering - Retrieves nodes located at specific depths or within defined depth ranges relative to a root or node.
- Hierarchical Path Propagators - Implements bulk database operations to update the paths of all descendant nodes when a subtree is moved.
- Nested Hash Serializers - Provides utilities to transform database subtrees into nested hashes or arrays for JSON API responses.
- Tree Traversal Utilities - Provides utilities for navigating and retrieving siblings, children, and leaves using indexed database lookups.
- Preorder Traversal Sorting - Orders a collection of nodes in a preorder traversal sequence to reflect their structural positions.
- Materialized Path Update Optimizers - Optimizes descendant path updates during reparenting using single database statements or specific callbacks.
- JSON API Formatters - Transforms database tree structures into nested hashes or arrays suitable for JSON APIs and frontend displays.
- ORM Extensions - Organizes models into trees using materialized paths.
Star history
How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.
