Metadata Reuse via Composite Path Signatures for Decentralized Schema Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Efficiently generating schema rule sets for data objects of decentralized schemas is challenging due to the need for examining each data object individually, unlike document-centralized schemas where rules can be generated in advance.
Innovation Solution
The approach involves generating object-specific metadata for validating data objects, using composite path signatures to determine metadata reuse across similar data objects, and employing a metadata reuse determination process to quickly identify and reuse valid metadata sets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If schema rules are generated in advance for document-centralized schemas, then validation efficiency is improved, but this approach cannot be applied to decentralized schemas where each data object requires individual examination
Solution Approach 1:
The patent generates schema rule sets in advance for each distinct composite path signature before validation occurs. By pre-computing and caching the schema rule sets associated with each signature, the system eliminates the need to examine each data object individually during validation, thereby improving validation efficiency while managing complexity through advance preparation
Solution Approach 2:
The patent creates reusable schema rule set copies for each distinct composite path signature. Once a schema rule set is generated for a particular signature, it is cached and copied for reuse whenever the same signature is encountered again, avoiding redundant generation work and improving subsequent validation operations
2Reliability
If each data object is examined individually to generate schema rule sets, then validation accuracy is maintained, but computing processing time increases significantly
Solution Approach 1:
The patent generates schema rule sets individually for each distinct composite path signature and caches them for reuse. This approach maintains validation accuracy by ensuring each signature has its own accurate rule set, while simultaneously reducing computing time by copying and reusing these pre-generated rule sets for identical signatures encountered in batch validations
Solution Approach 2:
The patent performs schema rule set generation in advance for each distinct signature and stores them in a cache. This preliminary action ensures validation accuracy is maintained through proper rule set generation, while the advance preparation eliminates redundant processing during actual validation operations
3Measurement precision
If metadata is generated for each data object, then validation precision is improved, but the quantity of metadata and processing overhead increase
Solution Approach 1:
The patent generates object-specific metadata (schema rule sets) in advance for each distinct composite path signature and caches them. This preliminary generation ensures validation precision is maintained through object-specific metadata, while the caching mechanism prevents redundant generation and reduces the overall quantity of metadata processing required during batch validations
Solution Approach 2:
The patent creates and caches metadata copies for each distinct signature. When the same signature is encountered again, the pre-generated metadata is copied and reused rather than regenerated, maintaining validation precision through signature-specific metadata while reducing the total quantity of metadata operations
Data Source
AI summary
A validation procedure employs metadata reuse using composite path signatures to make a metadata reuse determination. The procedure is performed as part of validating a set of data objects. Validating an initial subset of data objects generates N different sets of object-specific metadata, each set of which is associated with a different composite path signature. When subsequently validating another data object, a composite path signature is generated for the data object and compared with the composite path signatures of the N different sets of object-specific metadata. If a match is found, then the object-specific metadata of the matching composite path signature is reused for the data object. The object-specific metadata is remapped to an in-memory representation of the data object.