Structured Data Templates and Invocation Statements for Compact Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Self-describing data formats are less compact and require more resources for processing compared to schemaful formats, often leading to data repetition when used to write data with a de-facto schema, which increases storage and transmission requirements.
Innovation Solution
Structured data templates and invocation statements are used to dynamically define values for efficient data encoding, allowing for a more compact representation of data that reduces storage and transmission bandwidth by referencing template identifiers and specifying field names and values, with unassigned fields indicated by a specific indicator.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If self-describing data formats are used to encode arbitrary heterogeneous values, then flexibility is improved, but data compactness deteriorates and processing resources increase
Solution Approach 1:
The patent segments the data encoding process into two parts: a template definition phase (where the schema is established) and a data encoding phase (where only values are stored). By separating the structural information from the actual data, the system achieves compact storage while maintaining flexibility in value types.
Solution Approach 2:
The patent performs preliminary action by defining templates beforehand that specify the expected structure and types of data. These pre-defined templates serve as blueprints that enable efficient encoding without needing to repeat structural information for each data instance, thus reducing data size while maintaining adaptability.
2Adaptability or versatility
If self-describing data formats are used to write data with a de-facto schema, then flexibility is maintained, but data repetition increases leading to larger storage requirements
Solution Approach 1:
The patent creates universal templates that can describe multiple different data structures through a single definition mechanism. These templates serve multiple purposes: they define the schema, provide type information, and enable efficient encoding. By making the schema definition universal and reusable, the system eliminates data repetition while maintaining flexibility.
Solution Approach 2:
Instead of copying structural information for each data instance (which causes repetition), the patent uses template copying where the same template definition is reused for multiple data items. The template is copied and applied to different values, achieving compact storage without losing flexibility in representing heterogeneous data.
3Quantity of substance
If schemaful formats are used, then data compactness is improved, but adaptability to arbitrary heterogeneous values deteriorates
Solution Approach 1:
The patent introduces dynamic template instantiation where templates can be dynamically applied to different data types and structures. The template system is not static but can adapt to various heterogeneous values while maintaining a compact representation. This dynamic application allows the system to achieve both compactness and flexibility.
Data Source
AI summary
Structured data templates and invocation statements may be used to dynamically define values, which allows for more efficient data encoding than traditional techniques. A given structured data template may be assigned a template identifier. A writer may generate an invocation statement that references a template identifier for a particular structured data template in order to generate a more compact representation of a structured portion of source data (based on the structured data template matching the structured portion of data). The structured data template may specify that any number of the fields is an “unassigned” field. The invocation statement may specify values for these fields, resulting in a more compact representation of the structured portion of data. The use of an invocation statement and a structured data template eliminates the repetitive scaffolding of an object being written out.