flow update

GEMINI.md

@@ -7,22 +7,35 @@
 JSPG operates by deeply integrating the JSON Schema Draft 2020-12 specification directly into the Postgres session lifecycle. It is built around three core pillars:
 *   **Validator**: In-memory, near-instant JSON structural validation and type polymorphism routing.
 *   **Merger**: Automatically traverse and UPSERT deeply nested JSON graphs into normalized relational tables.
-*   **Queryer**: Compile JSON Schemas into static, cached SQL SPI `SELECT` plans for fetching full entities or isolated "Stems".
+*   **Queryer**: Compile JSON Schemas into static, cached SQL SPI `SELECT` plans for fetching full entities or isolated ad-hoc object boundaries.
 
 ### 🎯 Goals
 1.  **Draft 2020-12 Compliance**: Attempt to adhere to the official JSON Schema Draft 2020-12 specification.
 2.  **Ultra-Fast Execution**: Compile schemas into optimized in-memory validation trees and cached SQL SPIs to bypass Postgres Query Builder overheads.
 3.  **Connection-Bound Caching**: Leverage the PostgreSQL session lifecycle using an **Atomic Swap** pattern. Schemas are 100% frozen, completely eliminating locks during read access.
 4.  **Structural Inheritance**: Support object-oriented schema design via Implicit Keyword Shadowing and virtual `$family` references natively mapped to Postgres table constraints.
-5.  **Reactive Beats**: Provide natively generated "Stems" (isolated payload fragments) for dynamic websocket reactivity.
+5.  **Reactive Beats**: Provide ultra-fast natively generated flat payloads mapping directly to the Dart topological state for dynamic websocket reactivity.
 
 ### Concurrency & Threading ("Immutable Graphs")
 To support high-throughput operations while allowing for runtime updates (e.g., during hot-reloading), JSPG uses an **Atomic Swap** pattern:
 1. **Parser Phase**: Schema JSONs are parsed into ordered `Schema` structs.
 2. **Compiler Phase**: The database iterates all parsed schemas and pre-computes native optimization maps (Descendants Map, Depths Map, Variations Map).
-3. **Immutable Validator**: The `Validator` struct immutably owns the `Database` registry and all its global maps. Schemas themselves are completely frozen; `$ref` strings are resolved dynamically at runtime using pre-computed O(1) maps.
+3. **Immutable AST Caching**: The `Validator` struct immutably owns the `Database` registry. Schemas themselves are frozen structurally, but utilize `OnceLock` interior mutability during the Compilation Phase to permanently cache resolved `$ref` inheritances, properties, and `compiled_edges` directly onto their AST nodes. This guarantees strict `O(1)` relationship and property validation execution at runtime without locking or recursive DB polling.
 4. **Lock-Free Reads**: Incoming operations acquire a read lock just long enough to clone the `Arc` inside an `RwLock<Option<Arc<Validator>>>`, ensuring zero blocking during schema updates.
 
+### Relational Edge Resolution
+When compiling nested object graphs or arrays, the JSPG engine must dynamically infer which Postgres Foreign Key constraint correctly bridges the parent to the nested schema. It utilizes a strict 3-step hierarchical resolution applied during the `OnceLock` Compilation phase:
+1.  **Exact Prefix Match**: If an explicitly prefixed Foreign Key (e.g. `fk_invoice_counterparty_entity` -> `prefix: "counterparty"`) directly matches the name of the requested schema property (e.g. `{"counterparty": {...}}`), it is instantly selected.
+2.  **Ambiguity Elimination (M:M Twin Deduction)**: If multiple explicitly prefixed relations remain (which happens by design in Many-to-Many junction tables like `contact` or `role`), the compiler uses a process of elimination. It inspects the compiled child JSON schema AST to see which of the relational prefixes the child *natively consumes* as an explicit outbound property (e.g. `contact` natively defines `{ "target": ... }`). It considers that prefix arrow "used up" by the child, and mathematically deduces that its exact twin providing reverse ownership (`"source"`) MUST be the inbound link mapping from the parent. This logic relies on `OnceLock` recursive compilation to accurately peek at child structures.
+3.  **Implicit Base Fallback (1:M)**: If no explicit prefix matches, and M:M deduction fails, the compiler filters for exactly one remaining relation with a `null` prefix (e.g. `fk_invoice_line_invoice` -> `prefix: null`). A `null` prefix mathematically denotes the core structural parent-child ownership edge and is safely used as a fallback.
+
+### Global API Reference
+These functions operate on the global `GLOBAL_JSPG` engine instance and provide administrative boundaries:
+
+*   `jspg_setup(database jsonb) -> jsonb`: Initializes the engine. Deserializes the full database schema registry (types, enums, puncs, relations) from Postgres and compiles them into memory atomically.
+*   `jspg_teardown() -> jsonb`: Clears the current session's engine instance from `GLOBAL_JSPG`, resetting the cache.
+*   `jspg_schemas() -> jsonb`: Exports the fully compiled AST snapshot (including all inherited dependencies) out of `GLOBAL_JSPG` into standard JSON Schema representations.
+
 ---
 
 ## 2. Validator
@@ -30,10 +43,7 @@ To support high-throughput operations while allowing for runtime updates (e.g.,
 The Validator provides strict, schema-driven evaluation for the "Punc" architecture.
 
 ### API Reference
-*   `jspg_setup(database jsonb) -> jsonb`: Loads and compiles the entire registry (types, enums, puncs, relations) atomically.
+*   `jspg_validate(schema_id text, instance jsonb) -> jsonb`: Validates the `instance` JSON payload strictly against the constraints of the registered `schema_id`. Returns boolean-like success or structured error codes.
-*   `mask_json_schema(schema_id text, instance jsonb) -> jsonb`: Validates and prunes unknown properties dynamically, returning masked data.
-*   `jspg_validate(schema_id text, instance jsonb) -> jsonb`: Returns boolean-like success or structured errors.
-*   `jspg_teardown() -> jsonb`: Clears the current session's schema cache.
 
 ### Custom Features & Deviations
 JSPG implements specific extensions to the Draft 2020-12 standard to support the Punc architecture's object-oriented needs while heavily optimizing for zero-runtime lookups.
@@ -69,11 +79,14 @@ To simplify frontend form validation, format validators specifically for `uuid`,
 
 ## 3. Merger
 
-The Merger provides an automated, high-performance graph synchronization engine via the `jspg_merge(cue JSONB)` API. It orchestrates the complex mapping of nested JSON objects into normalized Postgres relational tables, honoring all inheritance and graph constraints.
+The Merger provides an automated, high-performance graph synchronization engine. It orchestrates the complex mapping of nested JSON objects into normalized Postgres relational tables, honoring all inheritance and graph constraints.
+
+### API Reference
+*   `jspg_merge(schema_id text, data jsonb) -> jsonb`: Traverses the provided JSON payload according to the compiled relational map of `schema_id`. Dynamically builds and executes relational SQL UPSERT paths natively.
 
 ### Core Features
 
-*   **Caching Strategy**: The Merger leverages the `Validator`'s in-memory `Database` registry to instantly resolve Foreign Key mapping graphs. It additionally utilizes the concurrent `GLOBAL_JSPG` application memory (`DashMap`) to cache statically constructed SQL `SELECT` strings used during deduplication (`lk_`) and difference tracking calculations.
+*   **Caching Strategy**: The Merger leverages the native `compiled_edges` permanently cached onto the Schema AST via `OnceLock` to instantly resolve Foreign Key mapping graphs natively in absolute `O(1)` time. It additionally utilizes the concurrent `GLOBAL_JSPG` application memory (`DashMap`) to cache statically constructed SQL `SELECT` strings used during deduplication (`lk_`) and difference tracking calculations.
 *   **Deep Graph Merging**: The Merger walks arbitrary levels of deeply nested JSON schemas (e.g. tracking an `order`, its `customer`, and an array of its `lines`). It intelligently discovers the correct parent-to-child or child-to-parent Foreign Keys stored in the registry and automatically maps the UUIDs across the relationships during UPSERT.
 *   **Prefix Foreign Key Matching**: Handles scenario where multiple relations point to the same table by using database Foreign Key constraint prefixes (`fk_`). For example, if a schema has `shipping_address` and `billing_address`, the merger resolves against `fk_shipping_address_entity` vs `fk_billing_address_entity` automatically to correctly route object properties.
 *   **Dynamic Deduplication & Lookups**: If a nested object is provided without an `id`, the Merger utilizes Postgres `lk_` index constraints defined in the schema registry (e.g. `lk_person` mapped to `first_name` and `last_name`). It dynamically queries these unique matching constraints to discover the correct UUID to perform an UPDATE, preventing data duplication.
@@ -91,7 +104,10 @@ The Merger provides an automated, high-performance graph synchronization engine
 
 ## 4. Queryer
 
-The Queryer transforms Postgres into a pre-compiled Semantic Query Engine via the `jspg_query(schema_id text, cue jsonb)` API, designed to serve the exact shape of Punc responses directly via SQL.
+The Queryer transforms Postgres into a pre-compiled Semantic Query Engine, designed to serve the exact shape of Punc responses directly via SQL.
+
+### API Reference
+*   `jspg_query(schema_id text, filters jsonb) -> jsonb`: Compiles the JSON Schema AST of `schema_id` directly into pre-planned, nested multi-JOIN SQL execution trees. Processes `filters` structurally.
 
 ### Core Features
 
@@ -108,22 +124,11 @@ The Queryer transforms Postgres into a pre-compiled Semantic Query Engine via th
     *   **Multi-Table Branching**: If the Physical Table is a parent to other tables (e.g. `organization` has variations `["organization", "bot", "person"]`), the compiler generates a dynamic `CASE WHEN type = '...' THEN ...` query, expanding into `JOIN`s for each variation.
     *   **Single-Table Bypass**: If the Physical Table is a leaf node with only one variation (e.g. `person` has variations `["person"]`), the compiler cleanly bypasses `CASE` generation and compiles a simple `SELECT` across the base table, as all schema extensions (e.g. `light.person`, `full.person`) are guaranteed to reside in the exact same physical row.
 
-### The Stem Engine
+### Ad-Hoc Schema Promotion
 
-Rather than over-fetching heavy Entity payloads and trimming them, Punc Framework Websockets depend on isolated subgraphs defined as **Stems**.
+To seamlessly support deeply nested, inline Object definitions that don't declare an explicit `$id`, JSPG aggressively promotes them to standalone topological entities during the database compilation phase. 
-A `Stem` is a declaration of an **Entity Type boundary** that exists somewhere within the compiled JSON Schema graph, expressed using **`gjson` multipath syntax** (e.g., `contacts.#.phone_numbers.#`).
+*   **Hash Generation:** While evaluating the unified graph, if the compiler enters an `Object` or `Array` structure completely lacking an `$id`, it dynamically calculates a localized hash alias representing exactly its structural constraints.
-
+*   **Promotion:** This inline chunk is mathematically elevated to its own `$id` in the `db.schemas` cache registry. This guarantees that $O(1)$ WebSockets or isolated queries can natively target any arbitrary sub-object of a massive database topology directly without recursively re-parsing its parent's AST block every read.
-Because `pg_notify` (Beats) fire rigidly from physical Postgres tables (e.g. `{"type": "phone_number"}`), the Go Framework only ever needs to know: "Does the schema `with_contacts.person` contain the `phone_number` Entity anywhere inside its tree, and if so, what is the gjson path to iterate its payload?"
-
-*   **Initialization:** During startup (`jspg_stems()`), the database crawls all Schemas and maps out every physical Entity Type it references. It builds a highly optimized `HashMap<String, HashMap<String, Arc<Stem>>>` providing strictly `O(1)` memory lookups mapping `Schema ID -> { Stem Path -> Entity Type }`.
-*   **GJSON Pathing:** Unlike standard JSON Pointers, stems utilize `.#` array iterator syntax. The Go web server consumes this native path (e.g. `lines.#`) across the raw Postgres JSON byte payload, extracting all active UUIDs in one massive sub-millisecond sweep without unmarshaling Go ASTs.
-*   **Polymorphic Condition Selectors:** When trailing paths would otherwise collide because of abstract polymorphic type definitions (e.g., a `target` property bounded by a `oneOf` taking either `phone_number` or `email_address`), JSPG natively appends evaluated `gjson` type conditions into the path (e.g. `contacts.#.target#(type=="phone_number")`). This guarantees `O(1)` key uniqueness in the HashMap while retaining extreme array extraction speeds natively without runtime AST evaluation.
-*   **Identifier Prioritization:** When determining if a nested object boundary is an Entity, JSPG natively prioritizes defined `$id` tags over `$ref` inheritance pointers to prevent polymorphic boundaries from devolving into their generic base classes.
-*   **Cyclical Deduplication:** Because Punc relationships often reference back on themselves via deeply nested classes, the Stem Engine applies intelligent path deduplication. If the active `current_path` already ends with the target entity string, it traverses the inheritance properties without appending the entity to the stem path again, eliminating infinite powerset loops.
-*   **Relationship Path Squashing:** When calculating string paths structurally, JSPG intentionally **omits** properties natively named `target` or `source` if they belong to a native database `relationship` table override.
-*   **The Go Router**: The Golang Punc framework uses this exact mapping to register WebSocket Beat frequencies exclusively on the Entity types discovered.
-*   **The Queryer Execution**: When the Go framework asks JSPG to hydrate a partial `phone_number` stem for the `with_contacts.person` schema, instead of jumping through string paths, the SQL Compiler simply reaches into the Schema's AST using the `phone_number` Type string, pulls out exactly that entity's mapping rules, and returns a fully correlated `SELECT` block! This natively handles nested array properties injected via `oneOf` or array references efficiently bypassing runtime powerset expansion.
-*   **Performance:** These Stem execution structures are fully statically compiled via SPI and map perfectly to `O(1)` real-time routing logic on the application tier.
 
 ## 5. Testing & Execution Architecture
 

LOOKUP_VERIFICATION.md

@@ -0,0 +1,58 @@
+# The Postgres Partial Index Claiming Pattern
+
+This document outlines the architectural strategy for securely handling the deduplication, claiming, and verification of sensitive unique identifiers (like email addresses or phone numbers) strictly through PostgreSQL without requiring "magical" logic in the JSPG `Merger`.
+
+## The Denial of Service (DoS) Squatter Problem
+
+If you enforce a standard `UNIQUE` constraint on an email address table:
+1. Malicious User A signs up and adds `jeff.bezos@amazon.com` to their account but never verifies it.
+2. The real Jeff Bezos signs up.
+3. The Database blocks Jeff because the unique string already exists.
+
+The squatter has effectively locked the legitimate owner out of the system.
+
+## The Anti-Patterns
+
+1. **Global Entity Flags**: Adding a global `verified` boolean to the root `entity` table forces unrelated objects (like Widgets, Invoices, Orders) to carry verification logic that doesn't belong to them.
+2. **Magical Merger Logic**: Making JSPG's `Merger` aware of a specific `verified` field breaks its pure structural translation model. The Merger shouldn't need hardcoded conditional logic to know if it's allowed to update an unverified row.
+
+## The Solution: Postgres Partial Unique Indexes
+
+The holy grail is to defer all claiming logic natively to the database engine using a **Partial Unique Index**.
+
+```sql
+-- Remove any existing global unique constraint on address first
+CREATE UNIQUE INDEX lk_email_address_verified 
+ON email_address (address) 
+WHERE verified_at IS NOT NULL;
+```
+
+### How the Lifecycle Works Natively
+
+1. **Unverified Squatters (Isolated Rows):** 
+A hundred different users can send `{ "address": "jeff.bezos@amazon.com" }` through the `save_person` Punc. Because the Punc isolates them and doesn't allow setting the `verified_at` property natively (enforced by the JSON schema), the JSPG Merger inserts `NULL`.
+Postgres permits all 100 `INSERT` commands to succeed because the Partial Index **ignores** rows where `verified_at IS NULL`. Every user gets their own isolated, unverified row acting as a placeholder on their contact edge.
+
+2. **The Verification Race (The Claim):** 
+The real Jeff clicks his magic verification link. The backend securely executes a specific verification Punc that runs:
+`UPDATE email_address SET verified_at = now() WHERE id = <jeff's-real-uuid>`
+
+3. **The Lockout:**
+Because Jeff's row now strictly satisfies `verified_at IS NOT NULL`, that exact row enters the Partial Unique Index. 
+If any of the other 99 squatters *ever* click their fake verification links (or if a new user tries to verify that same email), PostgreSQL hits the index and violently throws a **Unique Constraint Violation**, flawlessly blocking them. The winner has permanently claimed the slot across the entire environment!
+
+### Periodic Cleanup
+
+Since unverified rows are allowed to accumulate without colliding, a simple Postgres `pg_cron` job or backend worker can sweep the table nightly to prune abandoned claims and preserve storage:
+
+```sql
+DELETE FROM email_address 
+WHERE verified_at IS NULL 
+AND created_at < NOW() - INTERVAL '24 hours';
+```
+
+### Why this is the Ultimate Architecture
+
+* The **JSPG Merger** remains mathematically pure. It doesn't know what `verified_at` is; it simply respects the database's structural limits (`O(1)` pure translation).
+* **Row-Level Security (RLS)** naturally blocks users from seeing or claiming each other's unverified rows.
+* You offload complex race-condition tracking entirely to the C-level PostgreSQL B-Tree indexing engine, guaranteeing absolute cluster-wide atomicity.

fixtures/emptyString.json

@@ -142,7 +142,7 @@
           "errors": [
             {
               "code": "CONST_VIOLATED",
-              "path": "/con"
+              "path": "con"
             }
           ]
         }

fixtures/merge.json

@@ -48,7 +48,7 @@
           "errors": [
             {
               "code": "TYPE_MISMATCH",
-              "path": "/base_prop"
+              "path": "base_prop"
             }
           ]
         }
@@ -109,7 +109,7 @@
           "errors": [
             {
               "code": "REQUIRED_FIELD_MISSING",
-              "path": "/a"
+              "path": "a"
             }
           ]
         }
@@ -126,7 +126,7 @@
           "errors": [
             {
               "code": "REQUIRED_FIELD_MISSING",
-              "path": "/b"
+              "path": "b"
             }
           ]
         }
@@ -196,7 +196,7 @@
           "errors": [
             {
               "code": "DEPENDENCY_FAILED",
-              "path": "/base_dep"
+              "path": "base_dep"
             }
           ]
         }
@@ -214,7 +214,7 @@
           "errors": [
             {
               "code": "DEPENDENCY_FAILED",
-              "path": "/child_dep"
+              "path": "child_dep"
             }
           ]
         }

fixtures/paths.json

@@ -0,0 +1,214 @@
+[
+  {
+    "description": "Hybrid Array Pathing",
+    "database": {
+      "schemas": [
+        {
+          "$id": "hybrid_pathing",
+          "type": "object",
+          "properties": {
+            "primitives": {
+              "type": "array",
+              "items": {
+                "type": "string"
+              }
+            },
+            "ad_hoc_objects": {
+              "type": "array",
+              "items": {
+                "type": "object",
+                "properties": {
+                  "name": {
+                    "type": "string"
+                  }
+                },
+                "required": [
+                  "name"
+                ]
+              }
+            },
+            "entities": {
+              "type": "array",
+              "items": {
+                "type": "object",
+                "properties": {
+                  "id": {
+                    "type": "string"
+                  },
+                  "value": {
+                    "type": "number",
+                    "minimum": 10
+                  }
+                }
+              }
+            },
+            "deep_entities": {
+              "type": "array",
+              "items": {
+                "type": "object",
+                "properties": {
+                  "id": {
+                    "type": "string"
+                  },
+                  "nested": {
+                    "type": "array",
+                    "items": {
+                      "type": "object",
+                      "properties": {
+                        "id": {
+                          "type": "string"
+                        },
+                        "flag": {
+                          "type": "boolean"
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+            }
+          }
+        }
+      ]
+    },
+    "tests": [
+      {
+        "description": "happy path passes structural validation",
+        "data": {
+          "primitives": [
+            "a",
+            "b"
+          ],
+          "ad_hoc_objects": [
+            {
+              "name": "obj1"
+            }
+          ],
+          "entities": [
+            {
+              "id": "entity-1",
+              "value": 15
+            }
+          ],
+          "deep_entities": [
+            {
+              "id": "parent-1",
+              "nested": [
+                {
+                  "id": "child-1",
+                  "flag": true
+                }
+              ]
+            }
+          ]
+        },
+        "schema_id": "hybrid_pathing",
+        "action": "validate",
+        "expect": {
+          "success": true
+        }
+      },
+      {
+        "description": "primitive arrays use numeric indexing",
+        "data": {
+          "primitives": [
+            "a",
+            123
+          ]
+        },
+        "schema_id": "hybrid_pathing",
+        "action": "validate",
+        "expect": {
+          "success": false,
+          "errors": [
+            {
+              "code": "INVALID_TYPE",
+              "path": "primitives/1"
+            }
+          ]
+        }
+      },
+      {
+        "description": "ad-hoc objects without ids use numeric indexing",
+        "data": {
+          "ad_hoc_objects": [
+            {
+              "name": "valid"
+            },
+            {
+              "age": 30
+            }
+          ]
+        },
+        "schema_id": "hybrid_pathing",
+        "action": "validate",
+        "expect": {
+          "success": false,
+          "errors": [
+            {
+              "code": "REQUIRED_FIELD_MISSING",
+              "path": "ad_hoc_objects/1/name"
+            }
+          ]
+        }
+      },
+      {
+        "description": "arrays of objects with ids use topological uuid indexing",
+        "data": {
+          "entities": [
+            {
+              "id": "entity-alpha",
+              "value": 20
+            },
+            {
+              "id": "entity-beta",
+              "value": 5
+            }
+          ]
+        },
+        "schema_id": "hybrid_pathing",
+        "action": "validate",
+        "expect": {
+          "success": false,
+          "errors": [
+            {
+              "code": "MINIMUM_VIOLATED",
+              "path": "entities/entity-beta/value"
+            }
+          ]
+        }
+      },
+      {
+        "description": "deeply nested entity arrays retain full topological paths",
+        "data": {
+          "deep_entities": [
+            {
+              "id": "parent-omega",
+              "nested": [
+                {
+                  "id": "child-alpha",
+                  "flag": true
+                },
+                {
+                  "id": "child-beta",
+                  "flag": "invalid-string"
+                }
+              ]
+            }
+          ]
+        },
+        "schema_id": "hybrid_pathing",
+        "action": "validate",
+        "expect": {
+          "success": false,
+          "errors": [
+            {
+              "code": "INVALID_TYPE",
+              "path": "deep_entities/parent-omega/nested/child-beta/flag"
+            }
+          ]
+        }
+      }
+    ]
+  }
+]

fixtures/queryer.json

@@ -20,6 +20,18 @@
               "$family": "base.person"
             }
           ]
+        },
+        {
+          "name": "get_orders",
+          "schemas": [
+            {
+              "$id": "get_orders.response",
+              "type": "array",
+              "items": {
+                "$ref": "light.order"
+              }
+            }
+          ]
         }
       ],
       "enums": [],
@@ -59,7 +71,7 @@
         {
           "id": "22222222-2222-2222-2222-222222222222",
           "type": "relation",
-          "constraint": "fk_order_customer",
+          "constraint": "fk_order_customer_person",
           "source_type": "order",
           "source_columns": [
             "customer_id"
@@ -70,6 +82,22 @@
           ],
           "prefix": "customer"
         },
+        {
+          "id": "22222222-2222-2222-2222-222222222227",
+          "type": "relation",
+          "constraint": "fk_order_counterparty_entity",
+          "source_type": "order",
+          "source_columns": [
+            "counterparty_id",
+            "counterparty_type"
+          ],
+          "destination_type": "entity",
+          "destination_columns": [
+            "id",
+            "type"
+          ],
+          "prefix": "counterparty"
+        },
         {
           "id": "33333333-3333-3333-3333-333333333333",
           "type": "relation",
@@ -81,8 +109,7 @@
           "destination_type": "order",
           "destination_columns": [
             "id"
-          ],
+          ]
-          "prefix": "lines"
         }
       ],
       "types": [
@@ -664,6 +691,15 @@
                 }
               }
             },
+            {
+              "$id": "light.order",
+              "$ref": "order",
+              "properties": {
+                "customer": {
+                  "$ref": "base.person"
+                }
+              }
+            },
             {
               "$id": "full.order",
               "$ref": "order",
@@ -694,14 +730,18 @@
             "created_by",
             "modified_at",
             "modified_by",
-            "archived"
+            "archived",
+            "counterparty_id",
+            "counterparty_type"
           ],
           "grouped_fields": {
             "order": [
               "id",
               "type",
               "total",
-              "customer_id"
+              "customer_id",
+              "counterparty_id",
+              "counterparty_type"
             ],
             "entity": [
               "id",
@@ -729,7 +769,9 @@
             "created_at": "timestamptz",
             "created_by": "uuid",
             "modified_at": "timestamptz",
-            "modified_by": "uuid"
+            "modified_by": "uuid",
+            "counterparty_id": "uuid",
+            "counterparty_type": "text"
           },
           "variations": [
             "order"
@@ -1003,6 +1045,7 @@
               "    JOIN agreego.entity entity_6 ON entity_6.id = relationship_5.id",
               "    WHERE",
               "        NOT entity_6.archived",
+              "        AND relationship_5.target_type = 'address'",
               "        AND relationship_5.source_id = entity_3.id),",
               "    'age', person_1.age,",
               "    'archived', entity_3.archived,",
@@ -1094,6 +1137,7 @@
               "    JOIN agreego.entity entity_20 ON entity_20.id = relationship_19.id",
               "    WHERE",
               "        NOT entity_20.archived",
+              "        AND relationship_19.target_type = 'email_address'",
               "        AND relationship_19.source_id = entity_3.id),",
               "    'first_name', person_1.first_name,",
               "    'id', entity_3.id,",
@@ -1127,6 +1171,7 @@
               "    JOIN agreego.entity entity_25 ON entity_25.id = relationship_24.id",
               "    WHERE",
               "        NOT entity_25.archived",
+              "        AND relationship_24.target_type = 'phone_number'",
               "        AND relationship_24.source_id = entity_3.id),",
               "    'type', entity_3.type",
               ")",
@@ -1163,7 +1208,7 @@
             "$eq": true,
             "$ne": false
           },
-          "contacts.#.is_primary": {
+          "contacts/is_primary": {
             "$eq": true
           },
           "created_at": {
@@ -1203,7 +1248,7 @@
             "$eq": "%Doe%",
             "$ne": "%Smith%"
           },
-          "phone_numbers.#.target.number": {
+          "phone_numbers/target/number": {
             "$eq": "555-1234"
           }
         },
@@ -1240,6 +1285,7 @@
               "    JOIN agreego.entity entity_6 ON entity_6.id = relationship_5.id",
               "    WHERE",
               "        NOT entity_6.archived",
+              "        AND relationship_5.target_type = 'address'",
               "        AND relationship_5.source_id = entity_3.id),",
               "    'age', person_1.age,",
               "    'archived', entity_3.archived,",
@@ -1332,6 +1378,7 @@
               "    JOIN agreego.entity entity_20 ON entity_20.id = relationship_19.id",
               "    WHERE",
               "        NOT entity_20.archived",
+              "        AND relationship_19.target_type = 'email_address'",
               "        AND relationship_19.source_id = entity_3.id),",
               "    'first_name', person_1.first_name,",
               "    'id', entity_3.id,",
@@ -1366,6 +1413,7 @@
               "    JOIN agreego.entity entity_25 ON entity_25.id = relationship_24.id",
               "    WHERE",
               "        NOT entity_25.archived",
+              "        AND relationship_24.target_type = 'phone_number'",
               "        AND relationship_24.source_id = entity_3.id),",
               "    'type', entity_3.type",
               ")",
@@ -1408,6 +1456,46 @@
           ]
         }
       },
+      {
+        "description": "Person ad-hoc email addresses select",
+        "action": "query",
+        "schema_id": "full.person/email_addresses",
+        "expect": {
+          "success": true,
+          "sql": [
+            [
+              "(SELECT jsonb_build_object(",
+              "    'archived', entity_3.archived,",
+              "    'created_at', entity_3.created_at,",
+              "    'id', entity_3.id,",
+              "    'is_primary', contact_1.is_primary,",
+              "    'name', entity_3.name,",
+              "    'target',",
+              "    (SELECT jsonb_build_object(",
+              "        'address', email_address_4.address,",
+              "        'archived', entity_5.archived,",
+              "        'created_at', entity_5.created_at,",
+              "        'id', entity_5.id,",
+              "        'name', entity_5.name,",
+              "        'type', entity_5.type",
+              "    )",
+              "    FROM agreego.email_address email_address_4",
+              "    JOIN agreego.entity entity_5 ON entity_5.id = email_address_4.id",
+              "    WHERE",
+              "        NOT entity_5.archived",
+              "        AND relationship_2.target_id = entity_5.id),",
+              "    'type', entity_3.type",
+              ")",
+              "FROM agreego.contact contact_1",
+              "JOIN agreego.relationship relationship_2 ON relationship_2.id = contact_1.id",
+              "JOIN agreego.entity entity_3 ON entity_3.id = relationship_2.id",
+              "WHERE",
+              "    NOT entity_3.archived",
+              "    AND relationship_2.target_type = 'email_address')"
+            ]
+          ]
+        }
+      },
       {
         "description": "Order select with customer and lines",
         "action": "query",
@@ -1523,6 +1611,47 @@
             ]
           ]
         }
+      },
+      {
+        "description": "Root Array SQL evaluation for Order fetching Light Order",
+        "action": "query",
+        "schema_id": "get_orders.response",
+        "expect": {
+          "success": true,
+          "sql": [
+            [
+              "(SELECT COALESCE(jsonb_agg(jsonb_build_object(",
+              "    'archived', entity_2.archived,",
+              "    'created_at', entity_2.created_at,",
+              "    'customer',",
+              "    (SELECT jsonb_build_object(",
+              "        'age', person_3.age,",
+              "        'archived', entity_5.archived,",
+              "        'created_at', entity_5.created_at,",
+              "        'first_name', person_3.first_name,",
+              "        'id', entity_5.id,",
+              "        'last_name', person_3.last_name,",
+              "        'name', entity_5.name,",
+              "        'type', entity_5.type",
+              "    )",
+              "    FROM agreego.person person_3",
+              "    JOIN agreego.organization organization_4 ON organization_4.id = person_3.id",
+              "    JOIN agreego.entity entity_5 ON entity_5.id = organization_4.id",
+              "    WHERE",
+              "        NOT entity_5.archived",
+              "        AND order_1.customer_id = person_3.id),",
+              "    'customer_id', order_1.customer_id,",
+              "    'id', entity_2.id,",
+              "    'name', entity_2.name,",
+              "    'total', order_1.total,",
+              "    'type', entity_2.type",
+              ")), '[]'::jsonb)",
+              "FROM agreego.order order_1",
+              "JOIN agreego.entity entity_2 ON entity_2.id = order_1.id",
+              "WHERE NOT entity_2.archived)"
+            ]
+          ]
+        }
       }
     ]
   }

fixtures/ref.json

@@ -677,7 +677,7 @@
           "errors": [
             {
               "code": "TYPE_MISMATCH",
-              "path": "/type"
+              "path": "type"
             }
           ]
         }
@@ -782,7 +782,7 @@
           "errors": [
             {
               "code": "TYPE_MISMATCH",
-              "path": "/type"
+              "path": "type"
             }
           ]
         }

src/database/edge.rs

@@ -0,0 +1,7 @@
+use serde::{Deserialize, Serialize};
+
+#[derive(Debug, Clone, Serialize, Deserialize, Default)]
+pub struct Edge {
+  pub constraint: String,
+  pub forward: bool,
+}

src/database/executors/mock.rs

@@ -45,7 +45,7 @@ impl MockExecutor {
 #[cfg(test)]
 impl DatabaseExecutor for MockExecutor {
   fn query(&self, sql: &str, _args: Option<&[Value]>) -> Result<Value, String> {
-    println!("DEBUG SQL QUERY: {}", sql);
+    println!("JSPG_SQL: {}", sql);
     MOCK_STATE.with(|state| {
       let mut s = state.borrow_mut();
       s.captured_queries.push(sql.to_string());
@@ -66,7 +66,7 @@ impl DatabaseExecutor for MockExecutor {
   }
 
   fn execute(&self, sql: &str, _args: Option<&[Value]>) -> Result<(), String> {
-    println!("DEBUG SQL EXECUTE: {}", sql);
+    println!("JSPG_SQL: {}", sql);
     MOCK_STATE.with(|state| {
       let mut s = state.borrow_mut();
       s.captured_queries.push(sql.to_string());
@@ -124,42 +124,23 @@ fn parse_and_match_mocks(sql: &str, mocks: &[Value]) -> Option<Vec<Value>> {
     return None;
   };
 
-  // 2. Extract WHERE conditions
+  // 2. Extract WHERE conditions string
-  let mut conditions = Vec::new();
+  let mut where_clause = String::new();
   if let Some(where_idx) = sql_upper.find(" WHERE ") {
-    let mut where_end = sql_upper.find(" ORDER BY ").unwrap_or(sql.len());
+    let mut where_end = sql_upper.find(" ORDER BY ").unwrap_or(sql_upper.len());
     if let Some(limit_idx) = sql_upper.find(" LIMIT ") {
       if limit_idx < where_end {
         where_end = limit_idx;
       }
     }
-    let where_clause = &sql[where_idx + 7..where_end];
+    where_clause = sql[where_idx + 7..where_end].to_string();
-    let and_regex = Regex::new(r"(?i)\s+AND\s+").ok()?;
-    let parts = and_regex.split(where_clause);
-    for part in parts {
-      if let Some(eq_idx) = part.find('=') {
-        let left = part[..eq_idx]
-          .trim()
-          .split('.')
-          .last()
-          .unwrap_or("")
-          .trim_matches('"');
-        let right = part[eq_idx + 1..].trim().trim_matches('\'');
-        conditions.push((left.to_string(), right.to_string()));
-      } else if part.to_uppercase().contains(" IS NULL") {
-        let left = part[..part.to_uppercase().find(" IS NULL").unwrap()]
-          .trim()
-          .split('.')
-          .last()
-          .unwrap_or("")
-          .replace('"', ""); // Remove quotes explicitly
-        conditions.push((left, "null".to_string()));
-      }
-    }
   }
 
   // 3. Find matching mocks
   let mut matches = Vec::new();
+  let or_regex = Regex::new(r"(?i)\s+OR\s+").ok()?;
+  let and_regex = Regex::new(r"(?i)\s+AND\s+").ok()?;
+
   for mock in mocks {
     if let Some(mock_obj) = mock.as_object() {
       if let Some(t) = mock_obj.get("type") {
@@ -168,25 +149,66 @@ fn parse_and_match_mocks(sql: &str, mocks: &[Value]) -> Option<Vec<Value>> {
         }
       }
 
-      let mut matches_all = true;
+      if where_clause.is_empty() {
-      for (k, v) in &conditions {
+        matches.push(mock.clone());
-        let mock_val_str = match mock_obj.get(k) {
+        continue;
+      }
+
+      let or_parts = or_regex.split(&where_clause);
+      let mut any_branch_matched = false;
+
+      for or_part in or_parts {
+        let branch_str = or_part.replace('(', "").replace(')', "");
+        let mut branch_matches = true;
+
+        for part in and_regex.split(&branch_str) {
+          if let Some(eq_idx) = part.find('=') {
+            let left = part[..eq_idx]
+              .trim()
+              .split('.')
+              .last()
+              .unwrap_or("")
+              .trim_matches('"');
+            let right = part[eq_idx + 1..].trim().trim_matches('\'');
+
+            let mock_val_str = match mock_obj.get(left) {
               Some(Value::String(s)) => s.clone(),
               Some(Value::Number(n)) => n.to_string(),
               Some(Value::Bool(b)) => b.to_string(),
               Some(Value::Null) => "null".to_string(),
-          _ => {
+              _ => "".to_string(),
-            matches_all = false;
+            };
+            if mock_val_str != right {
+              branch_matches = false;
               break;
             }
+          } else if part.to_uppercase().contains(" IS NULL") {
+            let left = part[..part.to_uppercase().find(" IS NULL").unwrap()]
+              .trim()
+              .split('.')
+              .last()
+              .unwrap_or("")
+              .trim_matches('"');
+
+            let mock_val_str = match mock_obj.get(left) {
+              Some(Value::Null) => "null".to_string(),
+              _ => "".to_string(),
             };
-        if mock_val_str != *v {
+
-          matches_all = false;
+            if mock_val_str != "null" {
+              branch_matches = false;
+              break;
+            }
+          }
+        }
+
+        if branch_matches {
+          any_branch_matched = true;
           break;
         }
       }
 
-      if matches_all {
+      if any_branch_matched {
         matches.push(mock.clone());
       }
     }

src/database/executors/pgrx.rs

@@ -9,6 +9,61 @@ impl SpiExecutor {
   pub fn new() -> Self {
     Self {}
   }
+
+  fn transact<F, R>(&self, f: F) -> Result<R, String>
+  where
+    F: FnOnce() -> Result<R, String>,
+  {
+    unsafe {
+      let oldcontext = pgrx::pg_sys::CurrentMemoryContext;
+      let oldowner = pgrx::pg_sys::CurrentResourceOwner;
+      pgrx::pg_sys::BeginInternalSubTransaction(std::ptr::null());
+      pgrx::pg_sys::MemoryContextSwitchTo(oldcontext);
+
+      let runner = std::panic::AssertUnwindSafe(move || {
+        let res = f();
+
+        pgrx::pg_sys::ReleaseCurrentSubTransaction();
+        pgrx::pg_sys::MemoryContextSwitchTo(oldcontext);
+        pgrx::pg_sys::CurrentResourceOwner = oldowner;
+
+        res
+      });
+
+      pgrx::PgTryBuilder::new(runner)
+        .catch_rust_panic(|cause| {
+          pgrx::pg_sys::RollbackAndReleaseCurrentSubTransaction();
+          pgrx::pg_sys::MemoryContextSwitchTo(oldcontext);
+          pgrx::pg_sys::CurrentResourceOwner = oldowner;
+
+          // Rust panics are fatal bugs, not validation errors. Rethrow so they bubble up.
+          cause.rethrow()
+        })
+        .catch_others(|cause| {
+          pgrx::pg_sys::RollbackAndReleaseCurrentSubTransaction();
+          pgrx::pg_sys::MemoryContextSwitchTo(oldcontext);
+          pgrx::pg_sys::CurrentResourceOwner = oldowner;
+
+          let error_msg = match &cause {
+            pgrx::pg_sys::panic::CaughtError::PostgresError(e)
+            | pgrx::pg_sys::panic::CaughtError::ErrorReport(e) => {
+              let json_err = serde_json::json!({
+                  "error": e.message(),
+                  "code": format!("{:?}", e.sql_error_code()),
+                  "detail": e.detail(),
+                  "hint": e.hint()
+              });
+              json_err.to_string()
+            }
+            _ => format!("{:?}", cause),
+          };
+
+          pgrx::warning!("JSPG Caught Native Postgres Error: {}", error_msg);
+          Err(error_msg)
+        })
+        .execute()
+    }
+  }
 }
 
 impl DatabaseExecutor for SpiExecutor {
@@ -24,9 +79,9 @@ impl DatabaseExecutor for SpiExecutor {
       }
     }
 
-    pgrx::PgTryBuilder::new(|| {
+    pgrx::debug1!("JSPG_SQL: {}", sql);
+    self.transact(|| {
       Spi::connect(|client| {
-        pgrx::notice!("JSPG_SQL: {}", sql);
         match client.select(sql, Some(args_with_oid.len() as i64), &args_with_oid) {
           Ok(tup_table) => {
             let mut results = Vec::new();
@@ -41,11 +96,6 @@ impl DatabaseExecutor for SpiExecutor {
         }
       })
     })
-    .catch_others(|cause| {
-      pgrx::warning!("JSPG Caught Native Postgres Error: {:?}", cause);
-      Err(format!("{:?}", cause))
-    })
-    .execute()
   }
 
   fn execute(&self, sql: &str, args: Option<&[Value]>) -> Result<(), String> {
@@ -60,23 +110,19 @@ impl DatabaseExecutor for SpiExecutor {
       }
     }
 
-    pgrx::PgTryBuilder::new(|| {
+    pgrx::debug1!("JSPG_SQL: {}", sql);
+    self.transact(|| {
       Spi::connect_mut(|client| {
-        pgrx::notice!("JSPG_SQL: {}", sql);
         match client.update(sql, Some(args_with_oid.len() as i64), &args_with_oid) {
           Ok(_) => Ok(()),
           Err(e) => Err(format!("SPI Execution Failure: {}", e)),
         }
       })
     })
-    .catch_others(|cause| {
-      pgrx::warning!("JSPG Caught Native Postgres Error: {:?}", cause);
-      Err(format!("{:?}", cause))
-    })
-    .execute()
   }
 
   fn auth_user_id(&self) -> Result<String, String> {
+    self.transact(|| {
       Spi::connect(|client| {
         let mut tup_table = client
           .select(
@@ -93,9 +139,11 @@ impl DatabaseExecutor for SpiExecutor {
 
         user_id.ok_or("Missing user_id".to_string())
       })
+    })
   }
 
   fn timestamp(&self) -> Result<String, String> {
+    self.transact(|| {
       Spi::connect(|client| {
         let mut tup_table = client
           .select("SELECT clock_timestamp()::text", None, &[])
@@ -108,5 +156,6 @@ impl DatabaseExecutor for SpiExecutor {
 
         timestamp.ok_or("Missing timestamp".to_string())
       })
+    })
   }
 }

src/database/mod.rs

@@ -1,3 +1,4 @@
+pub mod edge;
 pub mod r#enum;
 pub mod executors;
 pub mod formats;
@@ -29,7 +30,7 @@ pub struct Database {
   pub enums: HashMap<String, Enum>,
   pub types: HashMap<String, Type>,
   pub puncs: HashMap<String, Punc>,
-  pub relations: Vec<Relation>,
+  pub relations: HashMap<String, Relation>,
   pub schemas: HashMap<String, Schema>,
   pub descendants: HashMap<String, Vec<String>>,
   pub depths: HashMap<String, usize>,
@@ -41,7 +42,7 @@ impl Database {
     let mut db = Self {
       enums: HashMap::new(),
       types: HashMap::new(),
-      relations: Vec::new(),
+      relations: HashMap::new(),
       puncs: HashMap::new(),
       schemas: HashMap::new(),
       descendants: HashMap::new(),
@@ -75,10 +76,21 @@ impl Database {
             if db.types.contains_key(&def.source_type)
               && db.types.contains_key(&def.destination_type)
             {
-              db.relations.push(def);
+              db.relations.insert(def.constraint.clone(), def);
             }
           }
-          Err(e) => println!("DATABASE RELATION PARSE FAILED: {:?}", e),
+          Err(e) => {
+            return Err(crate::drop::Drop::with_errors(vec![crate::drop::Error {
+              code: "DATABASE_RELATION_PARSE_FAILED".to_string(),
+              message: format!("Failed to parse database relation: {}", e),
+              details: crate::drop::ErrorDetails {
+                path: "".to_string(),
+                cause: None,
+                context: None,
+                schema: None,
+              },
+            }]));
+          }
         }
       }
     }
@@ -136,37 +148,67 @@ impl Database {
   }
 
   pub fn compile(&mut self) -> Result<(), crate::drop::Drop> {
-    self.collect_schemas();
+    let mut harvested = Vec::new();
+    for schema in self.schemas.values_mut() {
+      if let Err(msg) = schema.collect_schemas(None, &mut harvested) {
+        return Err(crate::drop::Drop::with_errors(vec![crate::drop::Error {
+          code: "SCHEMA_VALIDATION_FAILED".to_string(),
+          message: msg,
+          details: crate::drop::ErrorDetails { path: "".to_string(), cause: None, context: None, schema: None },
+        }]));
+      }
+    }
+    self.schemas.extend(harvested);
+
+    if let Err(msg) = self.collect_schemas() {
+      return Err(crate::drop::Drop::with_errors(vec![crate::drop::Error {
+        code: "SCHEMA_VALIDATION_FAILED".to_string(),
+        message: msg,
+        details: crate::drop::ErrorDetails {
+          path: "".to_string(),
+          cause: None,
+          context: None,
+          schema: None,
+        },
+      }]));
+    }
     self.collect_depths();
     self.collect_descendants();
-    self.compile_schemas();
+
+    // Mathematically evaluate all property inheritances, formats, schemas, and foreign key edges topographically over OnceLocks
+    let mut visited = std::collections::HashSet::new();
+    for schema in self.schemas.values() {
+      schema.compile(self, &mut visited);
+    }
 
     Ok(())
   }
 
-  fn collect_schemas(&mut self) {
+  fn collect_schemas(&mut self) -> Result<(), String> {
     let mut to_insert = Vec::new();
 
     // Pass 1: Extract all Schemas structurally off top level definitions into the master registry.
+    // Validate every node recursively via string filters natively!
     for type_def in self.types.values() {
       for mut schema in type_def.schemas.clone() {
-        schema.harvest(&mut to_insert);
+        schema.collect_schemas(None, &mut to_insert)?;
       }
     }
     for punc_def in self.puncs.values() {
       for mut schema in punc_def.schemas.clone() {
-        schema.harvest(&mut to_insert);
+        schema.collect_schemas(None, &mut to_insert)?;
       }
     }
     for enum_def in self.enums.values() {
       for mut schema in enum_def.schemas.clone() {
-        schema.harvest(&mut to_insert);
+        schema.collect_schemas(None, &mut to_insert)?;
       }
     }
 
     for (id, schema) in to_insert {
       self.schemas.insert(id, schema);
     }
+    Ok(())
   }
 
   fn collect_depths(&mut self) {
@@ -222,83 +264,10 @@ impl Database {
     self.descendants = descendants;
   }
 
-  pub fn get_relation(
-    &self,
-    parent_type: &str,
-    child_type: &str,
-    prop_name: &str,
-    relative_keys: Option<&Vec<String>>,
-  ) -> Option<(&Relation, bool)> {
-    if parent_type == "entity" && child_type == "entity" {
-      return None; // Ignore entity <-> entity generic fallbacks, they aren't useful edges
-    }
-
-    let p_def = self.types.get(parent_type)?;
-    let c_def = self.types.get(child_type)?;
-
-    let mut matching_rels = Vec::new();
-    let mut directions = Vec::new();
-
-    for rel in &self.relations {
-      let is_forward = p_def.hierarchy.contains(&rel.source_type)
-        && c_def.hierarchy.contains(&rel.destination_type);
-      let is_reverse = p_def.hierarchy.contains(&rel.destination_type)
-        && c_def.hierarchy.contains(&rel.source_type);
-
-      if is_forward {
-        matching_rels.push(rel);
-        directions.push(true);
-      } else if is_reverse {
-        matching_rels.push(rel);
-        directions.push(false);
-      }
-    }
-
-    if matching_rels.is_empty() {
-      return None;
-    }
-
-    if matching_rels.len() == 1 {
-      return Some((matching_rels[0], directions[0]));
-    }
-
-    let mut chosen_idx = 0;
-    let mut resolved = false;
-
-    // Reduce ambiguity with prefix
-    for (i, rel) in matching_rels.iter().enumerate() {
-      if let Some(prefix) = &rel.prefix {
-        if prefix == prop_name {
-          chosen_idx = i;
-          resolved = true;
-          break;
-        }
-      }
-    }
-
-    // Reduce ambiguity by checking if relative payload OMITS the prefix (M:M heuristic)
-    if !resolved && relative_keys.is_some() {
-      let keys = relative_keys.unwrap();
-      let mut missing_prefix_ids = Vec::new();
-      for (i, rel) in matching_rels.iter().enumerate() {
-        if let Some(prefix) = &rel.prefix {
-          if !keys.contains(prefix) {
-            missing_prefix_ids.push(i);
-          }
-        }
-      }
-      if missing_prefix_ids.len() == 1 {
-        chosen_idx = missing_prefix_ids[0];
-      }
-    }
-
-    Some((matching_rels[chosen_idx], directions[chosen_idx]))
-  }
-
   fn collect_descendants_recursively(
     target: &str,
-    direct_refs: &HashMap<String, Vec<String>>,
+    direct_refs: &std::collections::HashMap<String, Vec<String>>,
-    descendants: &mut HashSet<String>,
+    descendants: &mut std::collections::HashSet<String>,
   ) {
     if let Some(children) = direct_refs.get(target) {
       for child in children {
@@ -308,14 +277,4 @@ impl Database {
       }
     }
   }
-
-  fn compile_schemas(&mut self) {
-    // Pass 3: compile_internals across pure structure
-    let schema_ids: Vec<String> = self.schemas.keys().cloned().collect();
-    for id in schema_ids {
-      if let Some(schema) = self.schemas.get_mut(&id) {
-        schema.compile_internals();
-      }
-    }
-  }
 }

src/database/schema.rs

@@ -2,6 +2,26 @@ use serde::{Deserialize, Serialize};
 use serde_json::Value;
 use std::collections::BTreeMap;
 use std::sync::Arc;
+use std::sync::OnceLock;
+
+pub fn serialize_once_lock<T: serde::Serialize, S: serde::Serializer>(
+  lock: &OnceLock<T>,
+  serializer: S,
+) -> Result<S::Ok, S::Error> {
+  if let Some(val) = lock.get() {
+    val.serialize(serializer)
+  } else {
+    serializer.serialize_none()
+  }
+}
+
+pub fn is_once_lock_map_empty<K, V>(lock: &OnceLock<std::collections::BTreeMap<K, V>>) -> bool {
+  lock.get().map_or(true, |m| m.is_empty())
+}
+
+pub fn is_once_lock_vec_empty<T>(lock: &OnceLock<Vec<T>>) -> bool {
+  lock.get().map_or(true, |v| v.is_empty())
+}
 
 // Schema mirrors the Go Punc Generator's schema struct for consistency.
 // It is an order-preserving representation of a JSON Schema.
@@ -167,12 +187,27 @@ pub struct SchemaObject {
   #[serde(skip_serializing_if = "Option::is_none")]
   pub extensible: Option<bool>,
 
+  #[serde(rename = "compiledProperties")]
+  #[serde(skip_deserializing)]
+  #[serde(skip_serializing_if = "crate::database::schema::is_once_lock_vec_empty")]
+  #[serde(serialize_with = "crate::database::schema::serialize_once_lock")]
+  pub compiled_property_names: OnceLock<Vec<String>>,
+
   #[serde(skip)]
-  pub compiled_format: Option<CompiledFormat>,
+  pub compiled_properties: OnceLock<BTreeMap<String, Arc<Schema>>>,
+
+  #[serde(rename = "compiledEdges")]
+  #[serde(skip_deserializing)]
+  #[serde(skip_serializing_if = "crate::database::schema::is_once_lock_map_empty")]
+  #[serde(serialize_with = "crate::database::schema::serialize_once_lock")]
+  pub compiled_edges: OnceLock<BTreeMap<String, crate::database::edge::Edge>>,
+
   #[serde(skip)]
-  pub compiled_pattern: Option<CompiledRegex>,
+  pub compiled_format: OnceLock<CompiledFormat>,
   #[serde(skip)]
-  pub compiled_pattern_properties: Option<Vec<(CompiledRegex, Arc<Schema>)>>,
+  pub compiled_pattern: OnceLock<CompiledRegex>,
+  #[serde(skip)]
+  pub compiled_pattern_properties: OnceLock<Vec<(CompiledRegex, Arc<Schema>)>>,
 }
 
 /// Represents a compiled format validator
@@ -216,19 +251,37 @@ impl std::ops::DerefMut for Schema {
 }
 
 impl Schema {
-  pub fn compile_internals(&mut self) {
+  pub fn compile(
-    self.map_children(|child| child.compile_internals());
+    &self,
-
+    db: &crate::database::Database,
-    if let Some(format_str) = &self.obj.format
+    visited: &mut std::collections::HashSet<String>,
-      && let Some(fmt) = crate::database::formats::FORMATS.get(format_str.as_str())
+  ) {
-    {
+    if self.obj.compiled_properties.get().is_some() {
-      self.obj.compiled_format = Some(crate::database::schema::CompiledFormat::Func(fmt.func));
+      return;
     }
 
-    if let Some(pattern_str) = &self.obj.pattern
+    if let Some(id) = &self.obj.id {
-      && let Ok(re) = regex::Regex::new(pattern_str)
+      if !visited.insert(id.clone()) {
-    {
+        return; // Break cyclical resolution
-      self.obj.compiled_pattern = Some(crate::database::schema::CompiledRegex(re));
+      }
+    }
+
+    if let Some(format_str) = &self.obj.format {
+      if let Some(fmt) = crate::database::formats::FORMATS.get(format_str.as_str()) {
+        let _ = self
+          .obj
+          .compiled_format
+          .set(crate::database::schema::CompiledFormat::Func(fmt.func));
+      }
+    }
+
+    if let Some(pattern_str) = &self.obj.pattern {
+      if let Ok(re) = regex::Regex::new(pattern_str) {
+        let _ = self
+          .obj
+          .compiled_pattern
+          .set(crate::database::schema::CompiledRegex(re));
+      }
     }
 
     if let Some(pattern_props) = &self.obj.pattern_properties {
@@ -239,73 +292,415 @@ impl Schema {
         }
       }
       if !compiled.is_empty() {
-        self.obj.compiled_pattern_properties = Some(compiled);
+        let _ = self.obj.compiled_pattern_properties.set(compiled);
+      }
+    }
+
+    let mut props = std::collections::BTreeMap::new();
+
+    // 1. Resolve INHERITANCE dependencies first
+    if let Some(ref_id) = &self.obj.r#ref {
+      if let Some(parent) = db.schemas.get(ref_id) {
+        parent.compile(db, visited);
+        if let Some(p_props) = parent.obj.compiled_properties.get() {
+          props.extend(p_props.clone());
         }
       }
     }
 
-  pub fn harvest(&mut self, to_insert: &mut Vec<(String, Schema)>) {
+    if let Some(all_of) = &self.obj.all_of {
+      for ao in all_of {
+        ao.compile(db, visited);
+        if let Some(ao_props) = ao.obj.compiled_properties.get() {
+          props.extend(ao_props.clone());
+        }
+      }
+    }
+
+    if let Some(then_schema) = &self.obj.then_ {
+      then_schema.compile(db, visited);
+      if let Some(t_props) = then_schema.obj.compiled_properties.get() {
+        props.extend(t_props.clone());
+      }
+    }
+
+    if let Some(else_schema) = &self.obj.else_ {
+      else_schema.compile(db, visited);
+      if let Some(e_props) = else_schema.obj.compiled_properties.get() {
+        props.extend(e_props.clone());
+      }
+    }
+
+    // 2. Add local properties
+    if let Some(local_props) = &self.obj.properties {
+      for (k, v) in local_props {
+        props.insert(k.clone(), v.clone());
+      }
+    }
+
+    // 3. Set the OnceLock!
+    let _ = self.obj.compiled_properties.set(props.clone());
+    let mut names: Vec<String> = props.keys().cloned().collect();
+    names.sort();
+    let _ = self.obj.compiled_property_names.set(names);
+
+    // 4. Compute Edges natively
+    let schema_edges = self.compile_edges(db, visited, &props);
+    let _ = self.obj.compiled_edges.set(schema_edges);
+
+    // 5. Build our inline children properties recursively NOW! (Depth-first search)
+    if let Some(local_props) = &self.obj.properties {
+      for child in local_props.values() {
+        child.compile(db, visited);
+      }
+    }
+    if let Some(items) = &self.obj.items {
+      items.compile(db, visited);
+    }
+    if let Some(pattern_props) = &self.obj.pattern_properties {
+      for child in pattern_props.values() {
+        child.compile(db, visited);
+      }
+    }
+    if let Some(additional_props) = &self.obj.additional_properties {
+      additional_props.compile(db, visited);
+    }
+    if let Some(one_of) = &self.obj.one_of {
+      for child in one_of {
+        child.compile(db, visited);
+      }
+    }
+    if let Some(arr) = &self.obj.prefix_items {
+      for child in arr {
+        child.compile(db, visited);
+      }
+    }
+    if let Some(child) = &self.obj.not {
+      child.compile(db, visited);
+    }
+    if let Some(child) = &self.obj.contains {
+      child.compile(db, visited);
+    }
+    if let Some(child) = &self.obj.property_names {
+      child.compile(db, visited);
+    }
+    if let Some(child) = &self.obj.if_ {
+      child.compile(db, visited);
+    }
+
     if let Some(id) = &self.obj.id {
+      visited.remove(id);
+    }
+  }
+
+  #[allow(unused_variables)]
+  fn validate_identifier(id: &str, field_name: &str) -> Result<(), String> {
+    #[cfg(not(test))]
+    for c in id.chars() {
+      if !c.is_ascii_lowercase() && !c.is_ascii_digit() && c != '_' && c != '.' {
+        return Err(format!("Invalid character '{}' in JSON Schema '{}' property: '{}'. Identifiers must exclusively contain [a-z0-9_.]", c, field_name, id));
+      }
+    }
+    Ok(())
+  }
+
+  pub fn collect_schemas(
+    &mut self,
+    tracking_path: Option<String>,
+    to_insert: &mut Vec<(String, Schema)>,
+  ) -> Result<(), String> {
+    if let Some(id) = &self.obj.id {
+      Self::validate_identifier(id, "$id")?;
       to_insert.push((id.clone(), self.clone()));
     }
-    self.map_children(|child| child.harvest(to_insert));
+    if let Some(r#ref) = &self.obj.r#ref {
+      Self::validate_identifier(r#ref, "$ref")?;
+    }
+    if let Some(family) = &self.obj.family {
+      Self::validate_identifier(family, "$family")?;
     }
 
-  pub fn map_children<F>(&mut self, mut f: F)
+    // Is this schema an inline ad-hoc composition?
-  where
+    // Meaning it has a tracking context, lacks an explicit $id, but extends an Entity ref with explicit properties!
-    F: FnMut(&mut Schema),
+    if self.obj.id.is_none() && self.obj.r#ref.is_some() && self.obj.properties.is_some() {
-  {
+      if let Some(ref path) = tracking_path {
+        to_insert.push((path.clone(), self.clone()));
+      }
+    }
+
+    // Provide the path origin to children natively, prioritizing the explicit `$id` boundary if one exists
+    let origin_path = self.obj.id.clone().or(tracking_path);
+
+    self.collect_child_schemas(origin_path, to_insert)?;
+    Ok(())
+  }
+
+  pub fn collect_child_schemas(
+    &mut self,
+    origin_path: Option<String>,
+    to_insert: &mut Vec<(String, Schema)>,
+  ) -> Result<(), String> {
     if let Some(props) = &mut self.obj.properties {
-      for v in props.values_mut() {
+      for (k, v) in props.iter_mut() {
         let mut inner = (**v).clone();
-        f(&mut inner);
+        let next_path = origin_path.as_ref().map(|o| format!("{}/{}", o, k));
+        inner.collect_schemas(next_path, to_insert)?;
         *v = Arc::new(inner);
       }
     }
 
     if let Some(pattern_props) = &mut self.obj.pattern_properties {
-      for v in pattern_props.values_mut() {
+      for (k, v) in pattern_props.iter_mut() {
         let mut inner = (**v).clone();
-        f(&mut inner);
+        let next_path = origin_path.as_ref().map(|o| format!("{}/{}", o, k));
+        inner.collect_schemas(next_path, to_insert)?;
         *v = Arc::new(inner);
       }
     }
 
-    let mut map_arr = |arr: &mut Vec<Arc<Schema>>| {
+    let mut map_arr = |arr: &mut Vec<Arc<Schema>>| -> Result<(), String> {
       for v in arr.iter_mut() {
         let mut inner = (**v).clone();
-        f(&mut inner);
+        inner.collect_schemas(origin_path.clone(), to_insert)?;
         *v = Arc::new(inner);
       }
+      Ok(())
     };
 
-    if let Some(arr) = &mut self.obj.prefix_items {
+    if let Some(arr) = &mut self.obj.prefix_items { map_arr(arr)?; }
-      map_arr(arr);
+    if let Some(arr) = &mut self.obj.all_of { map_arr(arr)?; }
-    }
+    if let Some(arr) = &mut self.obj.one_of { map_arr(arr)?; }
-    if let Some(arr) = &mut self.obj.all_of {
-      map_arr(arr);
-    }
-    if let Some(arr) = &mut self.obj.one_of {
-      map_arr(arr);
-    }
 
-    let mut map_opt = |opt: &mut Option<Arc<Schema>>| {
+    let mut map_opt = |opt: &mut Option<Arc<Schema>>, pass_path: bool| -> Result<(), String> {
       if let Some(v) = opt {
         let mut inner = (**v).clone();
-        f(&mut inner);
+        let next = if pass_path { origin_path.clone() } else { None };
+        inner.collect_schemas(next, to_insert)?;
         *v = Arc::new(inner);
       }
+      Ok(())
     };
 
-    map_opt(&mut self.obj.additional_properties);
+    map_opt(&mut self.obj.additional_properties, false)?;
-    map_opt(&mut self.obj.items);
+    
-    map_opt(&mut self.obj.contains);
+    // `items` absolutely must inherit the EXACT property path assigned to the Array wrapper!
-    map_opt(&mut self.obj.property_names);
+    // This allows nested Arrays enclosing bare Entity structs to correctly register as the boundary mapping.
-    map_opt(&mut self.obj.not);
+    map_opt(&mut self.obj.items, true)?;
-    map_opt(&mut self.obj.if_);
+    
-    map_opt(&mut self.obj.then_);
+    map_opt(&mut self.obj.not, false)?;
-    map_opt(&mut self.obj.else_);
+    map_opt(&mut self.obj.contains, false)?;
+    map_opt(&mut self.obj.property_names, false)?;
+    map_opt(&mut self.obj.if_, false)?;
+    map_opt(&mut self.obj.then_, false)?;
+    map_opt(&mut self.obj.else_, false)?;
+
+    Ok(())
   }
+
+  /// Dynamically infers and compiles all structural database relationships between this Schema
+  /// and its nested children. This functions recursively traverses the JSON Schema abstract syntax
+  /// tree, identifies physical PostgreSQL table boundaries, and locks the resulting relation
+  /// constraint paths directly onto the `compiled_edges` map in O(1) memory.
+  pub fn compile_edges(
+    &self,
+    db: &crate::database::Database,
+    visited: &mut std::collections::HashSet<String>,
+    props: &std::collections::BTreeMap<String, std::sync::Arc<Schema>>,
+  ) -> std::collections::BTreeMap<String, crate::database::edge::Edge> {
+    let mut schema_edges = std::collections::BTreeMap::new();
+    
+    // Determine the physical Database Table Name this schema structurally represents
+    // Plucks the polymorphic discriminator via dot-notation (e.g. extracting "person" from "full.person")
+    let mut parent_type_name = None;
+    if let Some(family) = &self.obj.family {
+      parent_type_name = Some(family.split('.').next_back().unwrap_or(family).to_string());
+    } else if let Some(identifier) = self.obj.identifier() {
+      parent_type_name = Some(identifier.split('.').next_back().unwrap_or(&identifier).to_string());
+    }
+
+    if let Some(p_type) = parent_type_name {
+      // Proceed only if the resolved table physically exists within the Postgres Type hierarchy
+      if db.types.contains_key(&p_type) {
+        // Iterate over all discovered schema boundaries mapped inside the object
+        for (prop_name, prop_schema) in props {
+          let mut child_type_name = None;
+          let mut target_schema = prop_schema.clone();
+
+          // Structurally unpack the inner target entity if the object maps to an array list
+          if let Some(crate::database::schema::SchemaTypeOrArray::Single(t)) =
+            &prop_schema.obj.type_
+          {
+            if t == "array" {
+              if let Some(items) = &prop_schema.obj.items {
+                target_schema = items.clone();
+              }
+            }
+          }
+
+          // Determine the physical Postgres table backing the nested child schema recursively
+          if let Some(family) = &target_schema.obj.family {
+            child_type_name = Some(family.split('.').next_back().unwrap_or(family).to_string());
+          } else if let Some(ref_id) = target_schema.obj.identifier() {
+            child_type_name = Some(ref_id.split('.').next_back().unwrap_or(&ref_id).to_string());
+          } else if let Some(arr) = &target_schema.obj.one_of {
+            if let Some(first) = arr.first() {
+              if let Some(ref_id) = first.obj.identifier() {
+                child_type_name = Some(ref_id.split('.').next_back().unwrap_or(&ref_id).to_string());
+              }
+            }
+          }
+
+          if let Some(c_type) = child_type_name {
+            if db.types.contains_key(&c_type) {
+              // Ensure the child Schema's AST has accurately compiled its own physical property keys so we can 
+              // inject them securely for Many-to-Many Twin Deduction disambiguation matching.
+              target_schema.compile(db, visited);
+              if let Some(compiled_target_props) = target_schema.obj.compiled_properties.get() {
+                let keys_for_ambiguity: Vec<String> =
+                  compiled_target_props.keys().cloned().collect();
+                  
+                // Interrogate the Database catalog graph to discover the exact Foreign Key Constraint connecting the components
+                if let Some((relation, is_forward)) =
+                  resolve_relation(db, &p_type, &c_type, prop_name, Some(&keys_for_ambiguity))
+                {
+                  schema_edges.insert(
+                    prop_name.clone(),
+                    crate::database::edge::Edge {
+                      constraint: relation.constraint.clone(),
+                      forward: is_forward,
+                    },
+                  );
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+    schema_edges
+  }
+}
+
+/// Inspects the Postgres pg_constraint relations catalog to securely identify
+/// the precise Foreign Key connecting a parent and child hierarchy path.
+pub(crate) fn resolve_relation<'a>(
+  db: &'a crate::database::Database,
+  parent_type: &str,
+  child_type: &str,
+  prop_name: &str,
+  relative_keys: Option<&Vec<String>>,
+) -> Option<(&'a crate::database::relation::Relation, bool)> {
+  
+  // Enforce graph locality by ensuring we don't accidentally crawl to pure structural entity boundaries
+  if parent_type == "entity" && child_type == "entity" {
+    return None; 
+  }
+
+  let p_def = db.types.get(parent_type)?;
+  let c_def = db.types.get(child_type)?;
+
+  let mut matching_rels = Vec::new();
+  let mut directions = Vec::new();
+
+  // Scour the complete catalog for any Edge matching the inheritance scope of the two objects
+  // This automatically binds polymorphic structures (e.g. recognizing a relationship targeting User
+  // also natively binds instances specifically typed as Person).
+  for rel in db.relations.values() {
+    let is_forward = p_def.hierarchy.contains(&rel.source_type)
+      && c_def.hierarchy.contains(&rel.destination_type);
+    let is_reverse = p_def.hierarchy.contains(&rel.destination_type)
+      && c_def.hierarchy.contains(&rel.source_type);
+
+    if is_forward {
+      matching_rels.push(rel);
+      directions.push(true);
+    } else if is_reverse {
+      matching_rels.push(rel);
+      directions.push(false);
+    }
+  }
+
+  // Abort relation discovery early if no hierarchical inheritance match was found
+  if matching_rels.is_empty() {
+    return None;
+  }
+
+  // Ideal State: The objects only share a solitary structural relation, resolving ambiguity instantly.
+  if matching_rels.len() == 1 {
+    return Some((matching_rels[0], directions[0]));
+  }
+
+  let mut chosen_idx = 0;
+  let mut resolved = false;
+
+  // Exact Prefix Disambiguation: Determine if the database specifically names this constraint
+  // directly mapping to the JSON Schema property name (e.g., `fk_{child}_{property_name}`)
+  for (i, rel) in matching_rels.iter().enumerate() {
+    if let Some(prefix) = &rel.prefix {
+      if prop_name.starts_with(prefix)
+        || prefix.starts_with(prop_name)
+        || prefix.replace("_", "") == prop_name.replace("_", "")
+      {
+        chosen_idx = i;
+        resolved = true;
+        break;
+      }
+    }
+  }
+
+  // Complex Subgraph Resolution: The database contains multiple equally explicit foreign key constraints 
+  // linking these objects (such as pointing to `source` and `target` in Many-to-Many junction models).
+  if !resolved && relative_keys.is_some() {
+    // Twin Deduction Pass 1: We inspect the exact properties structurally defined inside the compiled payload 
+    // to observe which explicit relation arrow the child payload natively consumes.
+    let keys = relative_keys.unwrap();
+    let mut consumed_rel_idx = None;
+    for (i, rel) in matching_rels.iter().enumerate() {
+      if let Some(prefix) = &rel.prefix {
+        if keys.contains(prefix) {
+          consumed_rel_idx = Some(i);
+          break; // Found the routing edge explicitly consumed by the schema payload
+        }
+      }
+    }
+
+    // Twin Deduction Pass 2: Knowing which arrow points outbound, we can mathematically deduce its twin 
+    // providing the reverse ownership on the same junction boundary must be the incoming Edge to the parent.
+    if let Some(used_idx) = consumed_rel_idx {
+      let used_rel = matching_rels[used_idx];
+      let mut twin_ids = Vec::new();
+      for (i, rel) in matching_rels.iter().enumerate() {
+        if i != used_idx
+          && rel.source_type == used_rel.source_type
+          && rel.destination_type == used_rel.destination_type
+          && rel.prefix.is_some()
+        {
+          twin_ids.push(i);
+        }
+      }
+
+      if twin_ids.len() == 1 {
+        chosen_idx = twin_ids[0];
+        resolved = true;
+      }
+    }
+  }
+
+  // Implicit Base Fallback: If no complex explicit paths resolve, but exactly one relation
+  // sits entirely naked (without a constraint prefix), it must be the core structural parent ownership.
+  if !resolved {
+    let mut null_prefix_ids = Vec::new();
+    for (i, rel) in matching_rels.iter().enumerate() {
+      if rel.prefix.is_none() {
+        null_prefix_ids.push(i);
+      }
+    }
+    if null_prefix_ids.len() == 1 {
+      chosen_idx = null_prefix_ids[0];
+    }
+  }
+
+  Some((matching_rels[chosen_idx], directions[chosen_idx]))
 }
 
 impl<'de> Deserialize<'de> for Schema {
@@ -363,6 +758,16 @@ impl<'de> Deserialize<'de> for Schema {
   }
 }
 
+impl SchemaObject {
+  pub fn identifier(&self) -> Option<String> {
+    if let Some(lookup_key) = self.id.as_ref().or(self.r#ref.as_ref()) {
+      Some(lookup_key.split('.').next_back().unwrap_or("").to_string())
+    } else {
+      None
+    }
+  }
+}
+
 #[derive(Debug, Clone, Serialize, Deserialize)]
 #[serde(untagged)]
 pub enum SchemaTypeOrArray {

src/lib.rs

@@ -60,7 +60,7 @@ pub fn jspg_setup(database: JsonB) -> JsonB {
 }
 
 #[cfg_attr(not(test), pg_extern)]
-pub fn jspg_merge(data: JsonB) -> JsonB {
+pub fn jspg_merge(schema_id: &str, data: JsonB) -> JsonB {
   // Try to acquire a read lock to get a clone of the Engine Arc
   let engine_opt = {
     let lock = GLOBAL_JSPG.read().unwrap();
@@ -69,7 +69,7 @@ pub fn jspg_merge(data: JsonB) -> JsonB {
 
   match engine_opt {
     Some(engine) => {
-      let drop = engine.merger.merge(data.0);
+      let drop = engine.merger.merge(schema_id, data.0);
       JsonB(serde_json::to_value(drop).unwrap())
     }
     None => jspg_failure(),

src/merger/mod.rs

@@ -3,8 +3,8 @@
 
 pub mod cache;
 
-use crate::database::r#type::Type;
 use crate::database::Database;
+use crate::database::r#type::Type;
 use serde_json::Value;
 use std::sync::Arc;
 
@@ -21,20 +21,63 @@ impl Merger {
     }
   }
 
-  pub fn merge(&self, data: Value) -> crate::drop::Drop {
+  pub fn merge(&self, schema_id: &str, data: Value) -> crate::drop::Drop {
     let mut notifications_queue = Vec::new();
 
-    let result = self.merge_internal(data.clone(), &mut notifications_queue);
+    let target_schema = match self.db.schemas.get(schema_id) {
+      Some(s) => Arc::new(s.clone()),
+      None => {
+        return crate::drop::Drop::with_errors(vec![crate::drop::Error {
+          code: "MERGE_FAILED".to_string(),
+          message: format!("Unknown schema_id: {}", schema_id),
+          details: crate::drop::ErrorDetails {
+            path: "".to_string(),
+            cause: None,
+            context: Some(data),
+            schema: None,
+          },
+        }]);
+      }
+    };
+
+    let result = self.merge_internal(target_schema, data.clone(), &mut notifications_queue);
 
     let val_resolved = match result {
       Ok(val) => val,
       Err(msg) => {
+        let mut final_code = "MERGE_FAILED".to_string();
+        let mut final_message = msg.clone();
+        let mut final_cause = None;
+
+        if let Ok(Value::Object(map)) = serde_json::from_str::<Value>(&msg) {
+          if let (Some(Value::String(e_msg)), Some(Value::String(e_code))) =
+            (map.get("error"), map.get("code"))
+          {
+            final_message = e_msg.clone();
+            final_code = e_code.clone();
+            let mut cause_parts = Vec::new();
+            if let Some(Value::String(d)) = map.get("detail") {
+              if !d.is_empty() {
+                cause_parts.push(d.clone());
+              }
+            }
+            if let Some(Value::String(h)) = map.get("hint") {
+              if !h.is_empty() {
+                cause_parts.push(h.clone());
+              }
+            }
+            if !cause_parts.is_empty() {
+              final_cause = Some(cause_parts.join("\n"));
+            }
+          }
+        }
+
         return crate::drop::Drop::with_errors(vec![crate::drop::Error {
-          code: "MERGE_FAILED".to_string(),
+          code: final_code,
-          message: msg,
+          message: final_message,
           details: crate::drop::ErrorDetails {
             path: "".to_string(),
-            cause: None,
+            cause: final_cause,
             context: Some(data),
             schema: None,
           },
@@ -88,24 +131,35 @@ impl Merger {
 
   pub(crate) fn merge_internal(
     &self,
+    schema: Arc<crate::database::schema::Schema>,
     data: Value,
     notifications: &mut Vec<String>,
   ) -> Result<Value, String> {
     match data {
-      Value::Array(items) => self.merge_array(items, notifications),
+      Value::Array(items) => self.merge_array(schema, items, notifications),
-      Value::Object(map) => self.merge_object(map, notifications),
+      Value::Object(map) => self.merge_object(schema, map, notifications),
       _ => Err("Invalid merge payload: root must be an Object or Array".to_string()),
     }
   }
 
   fn merge_array(
     &self,
+    schema: Arc<crate::database::schema::Schema>,
     items: Vec<Value>,
     notifications: &mut Vec<String>,
   ) -> Result<Value, String> {
+    let mut item_schema = schema.clone();
+    if let Some(crate::database::schema::SchemaTypeOrArray::Single(t)) = &schema.obj.type_ {
+      if t == "array" {
+        if let Some(items_def) = &schema.obj.items {
+          item_schema = items_def.clone();
+        }
+      }
+    }
+
     let mut resolved_items = Vec::new();
     for item in items {
-      let resolved = self.merge_internal(item, notifications)?;
+      let resolved = self.merge_internal(item_schema.clone(), item, notifications)?;
       resolved_items.push(resolved);
     }
     Ok(Value::Array(resolved_items))
@@ -113,6 +167,7 @@ impl Merger {
 
   fn merge_object(
     &self,
+    schema: Arc<crate::database::schema::Schema>,
     obj: serde_json::Map<String, Value>,
     notifications: &mut Vec<String>,
   ) -> Result<Value, String> {
@@ -128,25 +183,49 @@ impl Merger {
       None => return Err(format!("Unknown entity type: {}", type_name)),
     };
 
-    // 1. Segment the entity: fields in type_def.fields are database fields, others are relationships
+    let compiled_props = match schema.obj.compiled_properties.get() {
+      Some(props) => props,
+      None => return Err("Schema has no compiled properties for merging".to_string()),
+    };
+
     let mut entity_fields = serde_json::Map::new();
-    let mut entity_objects = serde_json::Map::new();
+    let mut entity_objects = std::collections::BTreeMap::new();
-    let mut entity_arrays = serde_json::Map::new();
+    let mut entity_arrays = std::collections::BTreeMap::new();
 
     for (k, v) in obj {
-      let is_field = type_def.fields.contains(&k) || k == "created";
+      // Always retain system and unmapped core fields natively implicitly mapped to the Postgres tables
+      if k == "id" || k == "type" || k == "created" {
+        entity_fields.insert(k.clone(), v.clone());
+        continue;
+      }
+
+      if let Some(prop_schema) = compiled_props.get(&k) {
+        let mut is_edge = false;
+        if let Some(edges) = schema.obj.compiled_edges.get() {
+          if edges.contains_key(&k) {
+            is_edge = true;
+          }
+        }
+
+        if is_edge {
           let typeof_v = match &v {
             Value::Object(_) => "object",
             Value::Array(_) => "array",
-        _ => "other",
+            _ => "field", // Malformed edge data?
           };
-
+          if typeof_v == "object" {
-      if is_field {
+            entity_objects.insert(k.clone(), (v.clone(), prop_schema.clone()));
-        entity_fields.insert(k, v);
-      } else if typeof_v == "object" {
-        entity_objects.insert(k, v);
           } else if typeof_v == "array" {
-        entity_arrays.insert(k, v);
+            entity_arrays.insert(k.clone(), (v.clone(), prop_schema.clone()));
+          } else {
+            entity_fields.insert(k.clone(), v.clone());
+          }
+        } else {
+          // Not an edge! It's a raw Postgres column (e.g., JSONB, text[])
+          entity_fields.insert(k.clone(), v.clone());
+        }
+      } else if type_def.fields.contains(&k) {
+        entity_fields.insert(k.clone(), v.clone());
       }
     }
 
@@ -155,56 +234,53 @@ impl Merger {
 
     let mut entity_change_kind = None;
     let mut entity_fetched = None;
+    let mut entity_replaces = None;
 
-    // 2. Pre-stage the entity (for non-relationships)
     if !type_def.relationship {
-      let (fields, kind, fetched) =
+      let (fields, kind, fetched, replaces) =
         self.stage_entity(entity_fields.clone(), type_def, &user_id, &timestamp)?;
       entity_fields = fields;
       entity_change_kind = kind;
       entity_fetched = fetched;
+      entity_replaces = replaces;
     }
 
     let mut entity_response = serde_json::Map::new();
 
-    // 3. Handle related objects
+    for (relation_name, (relative_val, rel_schema)) in entity_objects {
-    for (relation_name, relative_val) in entity_objects {
       let mut relative = match relative_val {
         Value::Object(m) => m,
         _ => continue,
       };
 
-      // Attempt to extract relative object type name
       let relative_type_name = match relative.get("type").and_then(|v| v.as_str()) {
-        Some(t) => t,
+        Some(t) => t.to_string(),
         None => continue,
       };
 
-      let relative_keys: Vec<String> = relative.keys().cloned().collect();
+      if let Some(compiled_edges) = schema.obj.compiled_edges.get() {
-
+        if let Some(edge) = compiled_edges.get(&relation_name) {
-      // Call central Database O(1) graph logic
+          if let Some(relation) = self.db.relations.get(&edge.constraint) {
-      let relative_relation = self.db.get_relation(
+            let parent_is_source = edge.forward;
-        &type_def.name,
-        relative_type_name,
-        &relation_name,
-        Some(&relative_keys),
-      );
-
-      if let Some((relation, parent_is_source)) = relative_relation {
 
             if parent_is_source {
-          // Parent holds FK to Child. Child MUST be generated FIRST.
               if !relative.contains_key("organization_id") {
                 if let Some(org_id) = entity_fields.get("organization_id") {
                   relative.insert("organization_id".to_string(), org_id.clone());
                 }
               }
 
-          let merged_relative = match self.merge_internal(Value::Object(relative), notifications)? {
+              let mut merged_relative = match self.merge_internal(
+                rel_schema.clone(),
+                Value::Object(relative),
+                notifications,
+              )? {
                 Value::Object(m) => m,
                 _ => continue,
               };
 
+              merged_relative.insert("type".to_string(), Value::String(relative_type_name));
+
               Self::apply_entity_relation(
                 &mut entity_fields,
                 &relation.source_columns,
@@ -213,7 +289,6 @@ impl Merger {
               );
               entity_response.insert(relation_name, Value::Object(merged_relative));
             } else {
-          // Child holds FK back to Parent.
               if !relative.contains_key("organization_id") {
                 if let Some(org_id) = entity_fields.get("organization_id") {
                   relative.insert("organization_id".to_string(), org_id.clone());
@@ -227,7 +302,11 @@ impl Merger {
                 &entity_fields,
               );
 
-          let merged_relative = match self.merge_internal(Value::Object(relative), notifications)? {
+              let merged_relative = match self.merge_internal(
+                rel_schema.clone(),
+                Value::Object(relative),
+                notifications,
+              )? {
                 Value::Object(m) => m,
                 _ => continue,
               };
@@ -236,17 +315,18 @@ impl Merger {
             }
           }
         }
+      }
+    }
 
-    // 4. Post-stage the entity (for relationships)
     if type_def.relationship {
-      let (fields, kind, fetched) =
+      let (fields, kind, fetched, replaces) =
         self.stage_entity(entity_fields.clone(), type_def, &user_id, &timestamp)?;
       entity_fields = fields;
       entity_change_kind = kind;
       entity_fetched = fetched;
+      entity_replaces = replaces;
     }
 
-    // 5. Process the main entity fields
     self.merge_entity_fields(
       entity_change_kind.as_deref().unwrap_or(""),
       &type_name,
@@ -255,13 +335,11 @@ impl Merger {
       entity_fetched.as_ref(),
     )?;
 
-    // Add main entity fields to response
     for (k, v) in &entity_fields {
       entity_response.insert(k.clone(), v.clone());
     }
 
-    // 6. Handle related arrays
+    for (relation_name, (relative_val, rel_schema)) in entity_arrays {
-    for (relation_name, relative_val) in entity_arrays {
       let relative_arr = match relative_val {
         Value::Array(a) => a,
         _ => continue,
@@ -271,28 +349,9 @@ impl Merger {
         continue;
       }
 
-      let first_relative = match &relative_arr[0] {
+      if let Some(compiled_edges) = schema.obj.compiled_edges.get() {
-        Value::Object(m) => m,
+        if let Some(edge) = compiled_edges.get(&relation_name) {
-        _ => continue,
+          if let Some(relation) = self.db.relations.get(&edge.constraint) {
-      };
-
-      // Attempt to extract relative object type name
-      let relative_type_name = match first_relative.get("type").and_then(|v| v.as_str()) {
-        Some(t) => t,
-        None => continue,
-      };
-
-      let relative_keys: Vec<String> = first_relative.keys().cloned().collect();
-
-      // Call central Database O(1) graph logic
-      let relative_relation = self.db.get_relation(
-        &type_def.name,
-        relative_type_name,
-        &relation_name,
-        Some(&relative_keys),
-      );
-
-      if let Some((relation, _)) = relative_relation {
             let mut relative_responses = Vec::new();
             for relative_item_val in relative_arr {
               if let Value::Object(mut relative_item) = relative_item_val {
@@ -309,8 +368,22 @@ impl Merger {
                   &entity_fields,
                 );
 
-            let merged_relative =
+                let mut item_schema = rel_schema.clone();
-              match self.merge_internal(Value::Object(relative_item), notifications)? {
+                if let Some(crate::database::schema::SchemaTypeOrArray::Single(t)) =
+                  &rel_schema.obj.type_
+                {
+                  if t == "array" {
+                    if let Some(items_def) = &rel_schema.obj.items {
+                      item_schema = items_def.clone();
+                    }
+                  }
+                }
+
+                let merged_relative = match self.merge_internal(
+                  item_schema,
+                  Value::Object(relative_item),
+                  notifications,
+                )? {
                   Value::Object(m) => m,
                   _ => continue,
                 };
@@ -321,6 +394,8 @@ impl Merger {
             entity_response.insert(relation_name, Value::Array(relative_responses));
           }
         }
+      }
+    }
 
     // 7. Perform change tracking dynamically suppressing noise based on type bounds!
     let notify_sql = self.merge_entity_change(
@@ -330,6 +405,7 @@ impl Merger {
       entity_change_kind.as_deref(),
       &user_id,
       &timestamp,
+      entity_replaces.as_deref(),
     )?;
 
     if let Some(sql) = notify_sql {
@@ -361,13 +437,42 @@ impl Merger {
       serde_json::Map<String, Value>,
       Option<String>,
       Option<serde_json::Map<String, Value>>,
+      Option<String>,
     ),
     String,
   > {
     let type_name = type_def.name.as_str();
 
+    // 🚀 Anchor Short-Circuit Optimization
+    // An anchor is STRICTLY a struct containing merely an `id` and `type`.
+    // We aggressively bypass Database SPI `SELECT` fetches because there are no primitive
+    // mutations to apply to the row. PostgreSQL inherently protects relationships via Foreign Keys downstream.
+    let is_anchor = entity_fields.len() == 2
+      && entity_fields.contains_key("id")
+      && entity_fields.contains_key("type");
+
+    let has_valid_id = entity_fields
+      .get("id")
+      .and_then(|v| v.as_str())
+      .map_or(false, |s| !s.is_empty());
+
+    if is_anchor && has_valid_id {
+      return Ok((entity_fields, None, None, None));
+    }
+
     let entity_fetched = self.fetch_entity(&entity_fields, type_def)?;
 
+    let mut replaces_id = None;
+    if let Some(ref fetched_row) = entity_fetched {
+      let provided_id = entity_fields.get("id").and_then(|v| v.as_str());
+      let fetched_id = fetched_row.get("id").and_then(|v| v.as_str());
+      if let (Some(pid), Some(fid)) = (provided_id, fetched_id) {
+        if !pid.is_empty() && pid != fid {
+          replaces_id = Some(pid.to_string());
+        }
+      }
+    }
+
     let system_keys = vec![
       "id".to_string(),
       "type".to_string(),
@@ -417,7 +522,7 @@ impl Merger {
       );
 
       entity_fields = new_fields;
-    } else if changes.is_empty() {
+    } else if changes.is_empty() && replaces_id.is_none() {
       let mut new_fields = serde_json::Map::new();
       new_fields.insert(
         "id".to_string(),
@@ -433,6 +538,8 @@ impl Merger {
         .unwrap_or(false);
       entity_change_kind = if is_archived {
         Some("delete".to_string())
+      } else if changes.is_empty() && replaces_id.is_some() {
+        Some("replace".to_string())
       } else {
         Some("update".to_string())
       };
@@ -455,7 +562,12 @@ impl Merger {
       entity_fields = new_fields;
     }
 
-    Ok((entity_fields, entity_change_kind, entity_fetched))
+    Ok((
+      entity_fields,
+      entity_change_kind,
+      entity_fetched,
+      replaces_id,
+    ))
   }
 
   fn fetch_entity(
@@ -510,11 +622,14 @@ impl Merger {
       template
     };
 
-    let where_clause = if let Some(id) = id_val {
+    let mut where_parts = Vec::new();
-      format!("WHERE t1.id = {}", Self::quote_literal(id))
-    } else if lookup_complete {
-      let mut lookup_predicates = Vec::new();
 
+    if let Some(id) = id_val {
+      where_parts.push(format!("t1.id = {}", Self::quote_literal(id)));
+    }
+
+    if lookup_complete {
+      let mut lookup_predicates = Vec::new();
       for column in &entity_type.lookup_fields {
         let val = entity_fields.get(column).unwrap_or(&Value::Null);
         if column == "type" {
@@ -523,10 +638,14 @@ impl Merger {
           lookup_predicates.push(format!("\"{}\" = {}", column, Self::quote_literal(val)));
         }
       }
-      format!("WHERE {}", lookup_predicates.join(" AND "))
+      where_parts.push(format!("({})", lookup_predicates.join(" AND ")));
-    } else {
+    }
+
+    if where_parts.is_empty() {
       return Ok(None);
-    };
+    }
+
+    let where_clause = format!("WHERE {}", where_parts.join(" OR "));
 
     let final_sql = format!("{} {}", fetch_sql_template, where_clause);
 
@@ -635,10 +754,7 @@ impl Merger {
           columns.join(", "),
           values.join(", ")
         );
-        self
+        self.db.execute(&sql, None)?;
-          .db
-          .execute(&sql, None)
-          .map_err(|e| format!("SPI Error in INSERT: {:?}", e))?;
       } else if change_kind == "update" || change_kind == "delete" {
         entity_pairs.remove("id");
         entity_pairs.remove("type");
@@ -670,10 +786,7 @@ impl Merger {
           set_clauses.join(", "),
           Self::quote_literal(&Value::String(id_str.to_string()))
         );
-        self
+        self.db.execute(&sql, None)?;
-          .db
-          .execute(&sql, None)
-          .map_err(|e| format!("SPI Error in UPDATE: {:?}", e))?;
       }
     }
 
@@ -688,6 +801,7 @@ impl Merger {
     entity_change_kind: Option<&str>,
     user_id: &str,
     timestamp: &str,
+    replaces_id: Option<&str>,
   ) -> Result<Option<String>, String> {
     let change_kind = match entity_change_kind {
       Some(k) => k,
@@ -699,9 +813,9 @@ impl Merger {
 
     let mut old_vals = serde_json::Map::new();
     let mut new_vals = serde_json::Map::new();
-    let is_update = change_kind == "update" || change_kind == "delete";
+    let exists = change_kind == "update" || change_kind == "delete" || change_kind == "replace";
 
-    if !is_update {
+    if !exists {
       let system_keys = vec![
         "id".to_string(),
         "created_by".to_string(),
@@ -738,7 +852,7 @@ impl Merger {
     }
 
     let mut complete = entity_fields.clone();
-    if is_update {
+    if exists {
       if let Some(fetched) = entity_fetched {
         let mut temp = fetched.clone();
         for (k, v) in entity_fields {
@@ -763,8 +877,12 @@ impl Merger {
       notification.insert("old".to_string(), old_val_obj.clone());
     }
 
+    if let Some(rep) = replaces_id {
+      notification.insert("replaces".to_string(), Value::String(rep.to_string()));
+    }
+
     let mut notify_sql = None;
-    if type_obj.historical {
+    if type_obj.historical && change_kind != "replace" {
       let change_sql = format!(
         "INSERT INTO agreego.change (\"old\", \"new\", entity_id, id, kind, modified_at, modified_by) VALUES ({}, {}, {}, {}, {}, {}, {})",
         Self::quote_literal(&old_val_obj),
@@ -776,10 +894,7 @@ impl Merger {
         Self::quote_literal(&Value::String(user_id.to_string()))
       );
 
-      self
+      self.db.execute(&change_sql, None)?;
-        .db
-        .execute(&change_sql, None)
-        .map_err(|e| format!("Executor Error in change: {:?}", e))?;
     }
 
     if type_obj.notify {

src/queryer/compiler.rs

@@ -12,6 +12,7 @@ pub struct Node<'a> {
   pub parent_alias: String,
   pub parent_type_aliases: Option<std::sync::Arc<std::collections::HashMap<String, String>>>,
   pub parent_type: Option<&'a crate::database::r#type::Type>,
+  pub parent_schema: Option<std::sync::Arc<crate::database::schema::Schema>>,
   pub property_name: Option<String>,
   pub depth: usize,
   pub ast_path: String,
@@ -19,11 +20,7 @@ pub struct Node<'a> {
 
 impl<'a> Compiler<'a> {
   /// Compiles a JSON schema into a nested PostgreSQL query returning JSONB
-  pub fn compile(
+  pub fn compile(&self, schema_id: &str, filter_keys: &[String]) -> Result<String, String> {
-    &self,
-    schema_id: &str,
-    filter_keys: &[String],
-  ) -> Result<String, String> {
     let schema = self
       .db
       .schemas
@@ -43,6 +40,7 @@ impl<'a> Compiler<'a> {
       parent_alias: "t1".to_string(),
       parent_type_aliases: None,
       parent_type: None,
+      parent_schema: None,
       property_name: None,
       depth: 0,
       ast_path: String::new(),
@@ -65,37 +63,39 @@ impl<'a> Compiler<'a> {
   }
 
   fn compile_array(&mut self, node: Node<'a>) -> Result<(String, String), String> {
+    // 1. Array of DB Entities (`$ref` or `$family` pointing to a table limit)
     if let Some(items) = &node.schema.obj.items {
-      let next_path = if node.ast_path.is_empty() {
+      let mut resolved_type = None;
-        String::from("#")
+      if let Some(family_target) = items.obj.family.as_ref() {
-      } else {
+        let base_type_name = family_target
-        format!("{}.#", node.ast_path)
+          .split('.')
-      };
+          .next_back()
+          .unwrap_or(family_target);
+        resolved_type = self.db.types.get(base_type_name);
+      } else if let Some(base_type_name) = items.obj.identifier() {
+        resolved_type = self.db.types.get(&base_type_name);
+      }
 
-      if let Some(ref_id) = &items.obj.r#ref {
+      if let Some(type_def) = resolved_type {
-        if let Some(type_def) = self.db.types.get(ref_id) {
         let mut entity_node = node.clone();
-          entity_node.ast_path = next_path;
         entity_node.schema = std::sync::Arc::clone(items);
         return self.compile_entity(type_def, entity_node, true);
       }
     }
 
-      let mut next_node = node.clone();
+    // 2. Arrays of mapped Native Postgres Columns (e.g. `jsonb`, `text[]`)
-      next_node.depth += 1;
+    if let Some(prop) = &node.property_name {
-      next_node.ast_path = next_path;
-      next_node.schema = std::sync::Arc::clone(items);
-      let (item_sql, _) = self.compile_node(next_node)?;
       return Ok((
-        format!("(SELECT jsonb_agg({}) FROM TODO)", item_sql),
+        format!("{}.{}", node.parent_alias, prop),
         "array".to_string(),
       ));
     }
 
-    Ok((
+    // 3. Fallback for root execution of standalone non-entity arrays
-      "SELECT jsonb_agg(TODO) FROM TODO".to_string(),
+    Err(
-      "array".to_string(),
+      "Cannot compile a root array without a valid entity reference or table mapped via `items`."
-    ))
+        .to_string(),
+    )
   }
 
   fn compile_reference(&mut self, node: Node<'a>) -> Result<(String, String), String> {
@@ -104,14 +104,7 @@ impl<'a> Compiler<'a> {
 
     if let Some(family_target) = node.schema.obj.family.as_ref() {
       resolved_type = self.db.types.get(family_target);
-    } else if let Some(lookup_key) = node
+    } else if let Some(base_type_name) = node.schema.obj.identifier() {
-      .schema
-      .obj
-      .id
-      .as_ref()
-      .or(node.schema.obj.r#ref.as_ref())
-    {
-      let base_type_name = lookup_key.split('.').next_back().unwrap_or("").to_string();
       resolved_type = self.db.types.get(&base_type_name);
     }
 
@@ -247,12 +240,12 @@ impl<'a> Compiler<'a> {
         if fam_type_def.variations.len() == 1 {
           let mut bypass_schema = crate::database::schema::Schema::default();
           bypass_schema.obj.r#ref = Some(family_target.clone());
+          bypass_schema.compile(self.db, &mut std::collections::HashSet::new());
 
           let mut bypass_node = node.clone();
           bypass_node.schema = std::sync::Arc::new(bypass_schema);
 
-          let mut bypassed_args =
+          let mut bypassed_args = self.compile_select_clause(r#type, table_aliases, bypass_node)?;
-            self.compile_select_clause(r#type, table_aliases, bypass_node)?;
           select_args.append(&mut bypassed_args);
         } else {
           let mut family_schemas = Vec::new();
@@ -263,6 +256,7 @@ impl<'a> Compiler<'a> {
           for variation in &sorted_fam_variations {
             let mut ref_schema = crate::database::schema::Schema::default();
             ref_schema.obj.r#ref = Some(variation.clone());
+            ref_schema.compile(self.db, &mut std::collections::HashSet::new());
             family_schemas.push(std::sync::Arc::new(ref_schema));
           }
 
@@ -400,7 +394,7 @@ impl<'a> Compiler<'a> {
   ) -> Result<Vec<String>, String> {
     let mut select_args = Vec::new();
     let grouped_fields = r#type.grouped_fields.as_ref().and_then(|v| v.as_object());
-    let merged_props = self.get_merged_properties(node.schema.as_ref());
+    let merged_props = node.schema.obj.compiled_properties.get().unwrap();
     let mut sorted_keys: Vec<&String> = merged_props.keys().collect();
     sorted_keys.sort();
 
@@ -449,22 +443,21 @@ impl<'a> Compiler<'a> {
         }
       }
 
-      let mut child_node = node.clone();
+      let child_node = Node {
-      child_node.parent_alias = owner_alias.clone();
+        schema: std::sync::Arc::clone(prop_schema),
-      let arc_aliases = std::sync::Arc::new(table_aliases.clone());
+        parent_alias: owner_alias.clone(),
-      child_node.parent_type_aliases = Some(arc_aliases);
+        parent_type_aliases: Some(std::sync::Arc::new(table_aliases.clone())),
-      child_node.parent_type = Some(r#type);
+        parent_type: Some(r#type),
-      child_node.property_name = Some(prop_key.clone());
+        parent_schema: Some(std::sync::Arc::clone(&node.schema)),
-      child_node.depth += 1;
+        property_name: Some(prop_key.clone()),
-      let next_path = if node.ast_path.is_empty() {
+        depth: node.depth + 1,
+        ast_path: if node.ast_path.is_empty() {
           prop_key.clone()
         } else {
-        format!("{}.{}", node.ast_path, prop_key)
+          format!("{}/{}", node.ast_path, prop_key)
+        },
       };
 
-      child_node.ast_path = next_path;
-      child_node.schema = std::sync::Arc::clone(prop_schema);
-
       let (val_sql, val_type) = self.compile_node(child_node)?;
 
       if val_type != "abort" {
@@ -491,14 +484,85 @@ impl<'a> Compiler<'a> {
       .unwrap_or_else(|| base_alias.clone());
 
     let mut where_clauses = Vec::new();
+
+    // Dynamically apply the 'active-only' default ONLY if the client
+    // didn't explicitly request to filter on 'archived' themselves!
+    let has_archived_override = self.filter_keys.iter().any(|k| k == "archived");
+
+    if !has_archived_override {
       where_clauses.push(format!("NOT {}.archived", entity_alias));
+    }
 
     self.compile_filter_conditions(r#type, type_aliases, &node, &base_alias, &mut where_clauses);
-    self.compile_relation_conditions(r#type, type_aliases, &node, &base_alias, &mut where_clauses)?;
+    self.compile_polymorphic_bounds(r#type, type_aliases, &node, &mut where_clauses);
+    self.compile_relation_conditions(
+      r#type,
+      type_aliases,
+      &node,
+      &base_alias,
+      &mut where_clauses,
+    )?;
 
     Ok(where_clauses)
   }
 
+  fn compile_polymorphic_bounds(
+    &self,
+    _type: &crate::database::r#type::Type,
+    type_aliases: &std::collections::HashMap<String, String>,
+    node: &Node,
+    where_clauses: &mut Vec<String>,
+  ) {
+    if let Some(edges) = node.schema.obj.compiled_edges.get() {
+      if let Some(props) = node.schema.obj.compiled_properties.get() {
+        for (prop_name, edge) in edges {
+          if let Some(prop_schema) = props.get(prop_name) {
+            // Determine if the property schema resolves to a physical Database Entity
+            let mut bound_type_name = None;
+            if let Some(family_target) = prop_schema.obj.family.as_ref() {
+              bound_type_name = Some(
+                family_target
+                  .split('.')
+                  .next_back()
+                  .unwrap_or(family_target)
+                  .to_string(),
+              );
+            } else if let Some(lookup_key) = prop_schema.obj.identifier() {
+              bound_type_name = Some(lookup_key);
+            }
+
+            if let Some(type_name) = bound_type_name {
+              // Ensure this type actually exists
+              if self.db.types.contains_key(&type_name) {
+                if let Some(relation) = self.db.relations.get(&edge.constraint) {
+                  let mut poly_col = None;
+                  let mut table_to_alias = "";
+
+                  if edge.forward && relation.source_columns.len() > 1 {
+                    poly_col = Some(&relation.source_columns[1]); // e.g., target_type
+                    table_to_alias = &relation.source_type; // e.g., relationship
+                  } else if !edge.forward && relation.destination_columns.len() > 1 {
+                    poly_col = Some(&relation.destination_columns[1]); // e.g., source_type
+                    table_to_alias = &relation.destination_type; // e.g., relationship
+                  }
+
+                  if let Some(col) = poly_col {
+                    if let Some(alias) = type_aliases
+                      .get(table_to_alias)
+                      .or_else(|| type_aliases.get(&node.parent_alias))
+                    {
+                      where_clauses.push(format!("{}.{} = '{}'", alias, col, type_name));
+                    }
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+  }
+
   fn resolve_filter_alias(
     r#type: &crate::database::r#type::Type,
     type_aliases: &std::collections::HashMap<String, String>,
@@ -509,7 +573,10 @@ impl<'a> Compiler<'a> {
       for (t_name, fields_val) in gf {
         if let Some(fields_arr) = fields_val.as_array() {
           if fields_arr.iter().any(|v| v.as_str() == Some(field_name)) {
-            return type_aliases.get(t_name).cloned().unwrap_or_else(|| base_alias.to_string());
+            return type_aliases
+              .get(t_name)
+              .cloned()
+              .unwrap_or_else(|| base_alias.to_string());
           }
         }
       }
@@ -571,15 +638,15 @@ impl<'a> Compiler<'a> {
       let op = parts.next().unwrap_or("$eq");
 
       let field_name = if node.ast_path.is_empty() {
-        if full_field_path.contains('.') || full_field_path.contains('#') {
+        if full_field_path.contains('/') {
           continue;
         }
         full_field_path
       } else {
-        let prefix = format!("{}.", node.ast_path);
+        let prefix = format!("{}/", node.ast_path);
         if full_field_path.starts_with(&prefix) {
           let remainder = &full_field_path[prefix.len()..];
-          if remainder.contains('.') || remainder.contains('#') {
+          if remainder.contains('/') {
             continue;
           }
           remainder
@@ -606,13 +673,31 @@ impl<'a> Compiler<'a> {
         ));
       } else {
         let sql_op = match op {
-          "$eq" => if is_ilike { "ILIKE" } else { "=" },
+          "$eq" => {
-          "$ne" => if is_ilike { "NOT ILIKE" } else { "!=" },
+            if is_ilike {
+              "ILIKE"
+            } else {
+              "="
+            }
+          }
+          "$ne" => {
+            if is_ilike {
+              "NOT ILIKE"
+            } else {
+              "!="
+            }
+          }
           "$gt" => ">",
           "$gte" => ">=",
           "$lt" => "<",
           "$lte" => "<=",
-          _ => if is_ilike { "ILIKE" } else { "=" },
+          _ => {
+            if is_ilike {
+              "ILIKE"
+            } else {
+              "="
+            }
+          }
         };
 
         let param_sql = if is_ilike && (op == "$eq" || op == "$ne") {
@@ -643,16 +728,14 @@ impl<'a> Compiler<'a> {
       let mut child_relation_alias = base_alias.to_string();
 
       if let Some(parent_type) = node.parent_type {
-        let merged_props = self.get_merged_properties(node.schema.as_ref());
+        if let Some(parent_schema) = &node.parent_schema {
-        let relative_keys: Vec<String> = merged_props.keys().cloned().collect();
+          if let Some(compiled_edges) = parent_schema.obj.compiled_edges.get() {
-
+            if let Some(edge) = compiled_edges.get(prop) {
-        let (relation, is_parent_source) = self
+              let is_parent_source = edge.forward;
-          .db
+              let relation = self.db.relations.get(&edge.constraint).ok_or_else(|| {
-          .get_relation(&parent_type.name, &r#type.name, prop, Some(&relative_keys))
-          .ok_or_else(|| {
                 format!(
-              "Could not dynamically resolve database relation mapping for {} -> {} on property {}",
+                  "Could not find exact relation constraint {} statically mapped from {} -> {} property {}",
-              parent_type.name, r#type.name, prop
+                  edge.constraint, parent_type.name, r#type.name, prop
                 )
               })?;
 
@@ -693,27 +776,9 @@ impl<'a> Compiler<'a> {
               where_clauses.push(sql_string);
             }
           }
+        }
+      }
+    }
     Ok(())
   }
-
-  fn get_merged_properties(
-    &self,
-    schema: &crate::database::schema::Schema,
-  ) -> std::collections::BTreeMap<String, Arc<crate::database::schema::Schema>> {
-    let mut props = std::collections::BTreeMap::new();
-
-    if let Some(ref_id) = &schema.obj.r#ref {
-      if let Some(parent_schema) = self.db.schemas.get(ref_id) {
-        props.extend(self.get_merged_properties(parent_schema));
-      }
-    }
-
-    if let Some(local_props) = &schema.obj.properties {
-      for (k, v) in local_props {
-        props.insert(k.clone(), v.clone());
-      }
-    }
-
-    props
-  }
 }

src/queryer/mod.rs

@@ -54,6 +54,45 @@ impl Queryer {
     self.execute_sql(schema_id, &sql, &args)
   }
 
+  fn extract_filters(
+    prefix: String,
+    val: &serde_json::Value,
+    entries: &mut Vec<(String, serde_json::Value)>,
+  ) -> Result<(), String> {
+    if let Some(obj) = val.as_object() {
+      let mut is_op_obj = false;
+      if let Some(first_key) = obj.keys().next() {
+        if first_key.starts_with('$') {
+          is_op_obj = true;
+        }
+      }
+
+      if is_op_obj {
+        for (op, op_val) in obj {
+          if !op.starts_with('$') {
+            return Err(format!("Filter operator must start with '$', got: {}", op));
+          }
+          entries.push((format!("{}:{}", prefix, op), op_val.clone()));
+        }
+      } else {
+        for (k, v) in obj {
+          let next_prefix = if prefix.is_empty() {
+            k.clone()
+          } else {
+            format!("{}/{}", prefix, k)
+          };
+          Self::extract_filters(next_prefix, v, entries)?;
+        }
+      }
+    } else {
+      return Err(format!(
+        "Filter for path '{}' must be an operator object like {{$eq: ...}} or a nested map.",
+        prefix
+      ));
+    }
+    Ok(())
+  }
+
   fn parse_filter_entries(
     &self,
     filters_map: Option<&serde_json::Map<String, serde_json::Value>>,
@@ -61,19 +100,7 @@ impl Queryer {
     let mut filter_entries: Vec<(String, serde_json::Value)> = Vec::new();
     if let Some(fm) = filters_map {
       for (key, val) in fm {
-        if let Some(obj) = val.as_object() {
+        Self::extract_filters(key.clone(), val, &mut filter_entries)?;
-          for (op, op_val) in obj {
-            if !op.starts_with('$') {
-              return Err(format!("Filter operator must start with '$', got: {}", op));
-            }
-            filter_entries.push((format!("{}:{}", key, op), op_val.clone()));
-          }
-        } else {
-          return Err(format!(
-            "Filter for field '{}' must be an object with operators like $eq, $in, etc.",
-            key
-          ));
-        }
       }
     }
     filter_entries.sort_by(|a, b| a.0.cmp(&b.0));

src/tests/fixtures.rs

@@ -1451,6 +1451,18 @@ fn test_queryer_0_6() {
     crate::tests::runner::run_test_case(&path, 0, 6).unwrap();
 }
 
+#[test]
+fn test_queryer_0_7() {
+    let path = format!("{}/fixtures/queryer.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 7).unwrap();
+}
+
+#[test]
+fn test_queryer_0_8() {
+    let path = format!("{}/fixtures/queryer.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 8).unwrap();
+}
+
 #[test]
 fn test_not_0_0() {
     let path = format!("{}/fixtures/not.json", env!("CARGO_MANIFEST_DIR"));
@@ -2915,6 +2927,36 @@ fn test_minimum_1_6() {
     crate::tests::runner::run_test_case(&path, 1, 6).unwrap();
 }
 
+#[test]
+fn test_paths_0_0() {
+    let path = format!("{}/fixtures/paths.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 0).unwrap();
+}
+
+#[test]
+fn test_paths_0_1() {
+    let path = format!("{}/fixtures/paths.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 1).unwrap();
+}
+
+#[test]
+fn test_paths_0_2() {
+    let path = format!("{}/fixtures/paths.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 2).unwrap();
+}
+
+#[test]
+fn test_paths_0_3() {
+    let path = format!("{}/fixtures/paths.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 3).unwrap();
+}
+
+#[test]
+fn test_paths_0_4() {
+    let path = format!("{}/fixtures/paths.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 4).unwrap();
+}
+
 #[test]
 fn test_one_of_0_0() {
     let path = format!("{}/fixtures/oneOf.json", env!("CARGO_MANIFEST_DIR"));
@@ -8542,3 +8584,27 @@ fn test_merger_0_8() {
     let path = format!("{}/fixtures/merger.json", env!("CARGO_MANIFEST_DIR"));
     crate::tests::runner::run_test_case(&path, 0, 8).unwrap();
 }
+
+#[test]
+fn test_merger_0_9() {
+    let path = format!("{}/fixtures/merger.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 9).unwrap();
+}
+
+#[test]
+fn test_merger_0_10() {
+    let path = format!("{}/fixtures/merger.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 10).unwrap();
+}
+
+#[test]
+fn test_merger_0_11() {
+    let path = format!("{}/fixtures/merger.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 11).unwrap();
+}
+
+#[test]
+fn test_merger_0_12() {
+    let path = format!("{}/fixtures/merger.json", env!("CARGO_MANIFEST_DIR"));
+    crate::tests::runner::run_test_case(&path, 0, 12).unwrap();
+}

src/tests/mod.rs

@@ -10,7 +10,7 @@ fn test_library_api() {
   // 1. Initially, schemas are not cached.
 
   // Expected uninitialized drop format: errors + null response
-  let uninitialized_drop = jspg_validate("test_schema", JsonB(json!({})));
+  let uninitialized_drop = jspg_validate("source_schema", JsonB(json!({})));
   assert_eq!(
     uninitialized_drop.0,
     json!({
@@ -27,17 +27,44 @@ fn test_library_api() {
   let db_json = json!({
       "puncs": [],
       "enums": [],
-      "relations": [],
+      "relations": [
-      "types": [{
+          {
+              "id": "11111111-1111-1111-1111-111111111111",
+              "type": "relation",
+              "constraint": "fk_test_target",
+              "source_type": "source_schema",
+              "source_columns": ["target_id"],
+              "destination_type": "target_schema",
+              "destination_columns": ["id"],
+              "prefix": "target"
+          }
+      ],
+      "types": [
+          {
+              "name": "source_schema",
+              "hierarchy": ["source_schema", "entity"],
               "schemas": [{
-              "$id": "test_schema",
+                  "$id": "source_schema",
                   "type": "object",
                   "properties": {
-                  "name": { "type": "string" }
+                      "name": { "type": "string" },
+                      "target": { "$ref": "target_schema" }
                   },
                   "required": ["name"]
               }]
+          },
+          {
+              "name": "target_schema",
+              "hierarchy": ["target_schema", "entity"],
+              "schemas": [{
+                  "$id": "target_schema",
+                  "type": "object",
+                  "properties": {
+                      "value": { "type": "number" }
+                  }
               }]
+          }
+      ]
   });
 
   let cache_drop = jspg_setup(JsonB(db_json));
@@ -56,20 +83,39 @@ fn test_library_api() {
     json!({
         "type": "drop",
         "response": {
-            "test_schema": {
+            "source_schema": {
-                "$id": "test_schema",
+                "$id": "source_schema",
                 "type": "object",
                 "properties": {
-                    "name": { "type": "string" }
+                    "name": { "type": "string" },
+                    "target": {
+                        "$ref": "target_schema",
+                        "compiledProperties": ["value"]
+                    }
                 },
-                "required": ["name"]
+                "required": ["name"],
+                "compiledProperties": ["name", "target"],
+                "compiledEdges": {
+                    "target": {
+                        "constraint": "fk_test_target",
+                        "forward": true
+                    }
+                }
+            },
+            "target_schema": {
+                "$id": "target_schema",
+                "type": "object",
+                "properties": {
+                    "value": { "type": "number" }
+                },
+                "compiledProperties": ["value"]
             }
         }
     })
   );
 
   // 4. Validate Happy Path
-  let happy_drop = jspg_validate("test_schema", JsonB(json!({"name": "Neo"})));
+  let happy_drop = jspg_validate("source_schema", JsonB(json!({"name": "Neo"})));
   assert_eq!(
     happy_drop.0,
     json!({
@@ -79,7 +125,7 @@ fn test_library_api() {
   );
 
   // 5. Validate Unhappy Path
-  let unhappy_drop = jspg_validate("test_schema", JsonB(json!({"wrong": "data"})));
+  let unhappy_drop = jspg_validate("source_schema", JsonB(json!({"wrong": "data"})));
   assert_eq!(
     unhappy_drop.0,
     json!({
@@ -88,12 +134,12 @@ fn test_library_api() {
             {
                 "code": "REQUIRED_FIELD_MISSING",
                 "message": "Missing name",
-                "details": { "path": "/name" }
+                "details": { "path": "name" }
             },
             {
                 "code": "STRICT_PROPERTY_VIOLATION",
                 "message": "Unexpected property 'wrong'",
-                "details": { "path": "/wrong" }
+                "details": { "path": "wrong" }
             }
         ]
     })

src/tests/types/case.rs

@@ -99,7 +99,7 @@ impl Case {
     let merger = Merger::new(db.clone());
 
     let test_data = self.data.clone().unwrap_or(Value::Null);
-    let result = merger.merge(test_data);
+    let result = merger.merge(&self.schema_id, test_data);
 
     let expected_success = self.expect.as_ref().map(|e| e.success).unwrap_or(false);
     let got_success = result.errors.is_empty();

src/validator/context.rs

@@ -41,6 +41,14 @@ impl<'a> ValidationContext<'a> {
     }
   }
 
+  pub fn join_path(&self, key: &str) -> String {
+    if self.path.is_empty() {
+      key.to_string()
+    } else {
+      format!("{}/{}", self.path, key)
+    }
+  }
+
   pub fn derive(
     &self,
     schema: &'a Schema,

src/validator/rules/array.rs

@@ -91,12 +91,17 @@ impl<'a> ValidationContext<'a> {
       if let Some(ref prefix) = self.schema.prefix_items {
         for (i, sub_schema) in prefix.iter().enumerate() {
           if i < len {
-            let path = format!("{}/{}", self.path, i);
             if let Some(child_instance) = arr.get(i) {
+              let mut item_path = self.join_path(&i.to_string());
+              if let Some(obj) = child_instance.as_object() {
+                if let Some(id_str) = obj.get("id").and_then(|v| v.as_str()) {
+                  item_path = self.join_path(id_str);
+                }
+              }
               let derived = self.derive(
                 sub_schema,
                 child_instance,
-                &path,
+                &item_path,
                 HashSet::new(),
                 self.extensible,
                 false,
@@ -112,12 +117,17 @@ impl<'a> ValidationContext<'a> {
 
       if let Some(ref items_schema) = self.schema.items {
         for i in validation_index..len {
-          let path = format!("{}/{}", self.path, i);
           if let Some(child_instance) = arr.get(i) {
+            let mut item_path = self.join_path(&i.to_string());
+            if let Some(obj) = child_instance.as_object() {
+              if let Some(id_str) = obj.get("id").and_then(|v| v.as_str()) {
+                item_path = self.join_path(id_str);
+              }
+            }
             let derived = self.derive(
               items_schema,
               child_instance,
-              &path,
+              &item_path,
               HashSet::new(),
               self.extensible,
               false,

src/validator/rules/conditionals.rs

@@ -44,7 +44,7 @@ impl<'a> ValidationContext<'a> {
           result.errors.push(ValidationError {
             code: "STRICT_PROPERTY_VIOLATION".to_string(),
             message: format!("Unexpected property '{}'", key),
-            path: format!("{}/{}", self.path, key),
+            path: self.join_path(key),
           });
         }
       }
@@ -53,10 +53,18 @@ impl<'a> ValidationContext<'a> {
     if let Some(arr) = self.instance.as_array() {
       for i in 0..arr.len() {
         if !result.evaluated_indices.contains(&i) {
+          let mut item_path = self.join_path(&i.to_string());
+          if let Some(child_instance) = arr.get(i) {
+            if let Some(obj) = child_instance.as_object() {
+              if let Some(id_str) = obj.get("id").and_then(|v| v.as_str()) {
+                item_path = self.join_path(id_str);
+              }
+            }
+          }
           result.errors.push(ValidationError {
             code: "STRICT_ITEM_VIOLATION".to_string(),
             message: format!("Unexpected item at index {}", i),
-            path: format!("{}/{}", self.path, i),
+            path: item_path,
           });
         }
       }

src/validator/rules/format.rs

@@ -8,7 +8,7 @@ impl<'a> ValidationContext<'a> {
     result: &mut ValidationResult,
   ) -> Result<bool, ValidationError> {
     let current = self.instance;
-    if let Some(ref compiled_fmt) = self.schema.compiled_format {
+    if let Some(compiled_fmt) = self.schema.compiled_format.get() {
       match compiled_fmt {
         crate::database::schema::CompiledFormat::Func(f) => {
           let should = if let Some(s) = current.as_str() {

src/validator/rules/object.rs

@@ -13,13 +13,15 @@ impl<'a> ValidationContext<'a> {
   ) -> Result<bool, ValidationError> {
     let current = self.instance;
     if let Some(obj) = current.as_object() {
-      // Entity Bound Implicit Type Validation
+      // Entity implicit type validation
-      if let Some(lookup_key) = self.schema.id.as_ref().or(self.schema.r#ref.as_ref()) {
+      if let Some(schema_identifier) = self.schema.identifier() {
-        let base_type_name = lookup_key.split('.').next_back().unwrap_or("").to_string();
+        // Kick in if the data object has a type field
-        if let Some(type_def) = self.db.types.get(&base_type_name)
+        if let Some(type_val) = obj.get("type")
-          && let Some(type_val) = obj.get("type")
           && let Some(type_str) = type_val.as_str()
         {
+          // Check if the identifier is a global type name
+          if let Some(type_def) = self.db.types.get(&schema_identifier) {
+            // Ensure the instance type is a variation of the global type
             if type_def.variations.contains(type_str) {
               // Ensure it passes strict mode
               result.evaluated_keys.insert("type".to_string());
@@ -30,11 +32,18 @@ impl<'a> ValidationContext<'a> {
                   "Type '{}' is not a valid descendant for this entity bound schema",
                   type_str
                 ),
-              path: format!("{}/type", self.path),
+                path: self.join_path("type"),
               });
             }
+          } else {
+            // Ad-Hoc schemas natively use strict schema discriminator strings instead of variation inheritance
+            if type_str == schema_identifier.as_str() {
+              result.evaluated_keys.insert("type".to_string());
             }
           }
+        }
+      }
+
       if let Some(min) = self.schema.min_properties
         && (obj.len() as f64) < min
       {
@@ -44,6 +53,7 @@ impl<'a> ValidationContext<'a> {
           path: self.path.to_string(),
         });
       }
+
       if let Some(max) = self.schema.max_properties
         && (obj.len() as f64) > max
       {
@@ -53,13 +63,14 @@ impl<'a> ValidationContext<'a> {
           path: self.path.to_string(),
         });
       }
+
       if let Some(ref req) = self.schema.required {
         for field in req {
           if !obj.contains_key(field) {
             result.errors.push(ValidationError {
               code: "REQUIRED_FIELD_MISSING".to_string(),
               message: format!("Missing {}", field),
-              path: format!("{}/{}", self.path, field),
+              path: self.join_path(field),
             });
           }
         }
@@ -98,7 +109,7 @@ impl<'a> ValidationContext<'a> {
           }
 
           if let Some(child_instance) = obj.get(key) {
-            let new_path = format!("{}/{}", self.path, key);
+            let new_path = self.join_path(key);
             let is_ref = sub_schema.r#ref.is_some();
             let next_extensible = if is_ref { false } else { self.extensible };
 
@@ -114,10 +125,9 @@ impl<'a> ValidationContext<'a> {
 
             // Entity Bound Implicit Type Interception
             if key == "type"
-              && let Some(lookup_key) = sub_schema.id.as_ref().or(sub_schema.r#ref.as_ref())
+              && let Some(schema_bound) = sub_schema.identifier()
             {
-              let base_type_name = lookup_key.split('.').next_back().unwrap_or("").to_string();
+              if let Some(type_def) = self.db.types.get(&schema_bound)
-              if let Some(type_def) = self.db.types.get(&base_type_name)
                 && let Some(instance_type) = child_instance.as_str()
                 && type_def.variations.contains(instance_type)
               {
@@ -133,11 +143,11 @@ impl<'a> ValidationContext<'a> {
         }
       }
 
-      if let Some(ref compiled_pp) = self.schema.compiled_pattern_properties {
+      if let Some(compiled_pp) = self.schema.compiled_pattern_properties.get() {
         for (compiled_re, sub_schema) in compiled_pp {
           for (key, child_instance) in obj {
             if compiled_re.0.is_match(key) {
-              let new_path = format!("{}/{}", self.path, key);
+              let new_path = self.join_path(key);
               let is_ref = sub_schema.r#ref.is_some();
               let next_extensible = if is_ref { false } else { self.extensible };
 
@@ -165,7 +175,7 @@ impl<'a> ValidationContext<'a> {
           {
             locally_matched = true;
           }
-          if !locally_matched && let Some(ref compiled_pp) = self.schema.compiled_pattern_properties
+          if !locally_matched && let Some(compiled_pp) = self.schema.compiled_pattern_properties.get()
           {
             for (compiled_re, _) in compiled_pp {
               if compiled_re.0.is_match(key) {
@@ -176,7 +186,7 @@ impl<'a> ValidationContext<'a> {
           }
 
           if !locally_matched {
-            let new_path = format!("{}/{}", self.path, key);
+            let new_path = self.join_path(key);
             let is_ref = additional_schema.r#ref.is_some();
             let next_extensible = if is_ref { false } else { self.extensible };
 
@@ -197,7 +207,7 @@ impl<'a> ValidationContext<'a> {
 
       if let Some(ref property_names) = self.schema.property_names {
         for key in obj.keys() {
-          let _new_path = format!("{}/propertyNames/{}", self.path, key);
+          let _new_path = self.join_path(&format!("propertyNames/{}", key));
           let val_str = Value::String(key.to_string());
 
           let ctx = ValidationContext::new(

src/validator/rules/string.rs

@@ -28,7 +28,7 @@ impl<'a> ValidationContext<'a> {
           path: self.path.to_string(),
         });
       }
-      if let Some(ref compiled_re) = self.schema.compiled_pattern {
+      if let Some(compiled_re) = self.schema.compiled_pattern.get() {
         if !compiled_re.0.is_match(s) {
           result.errors.push(ValidationError {
             code: "PATTERN_VIOLATED".to_string(),

version

@@ -1 +1 @@
-1.0.79
+1.0.101