Universal Data Container Using SQL for Hierarchical Querying
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies lack a universal data container that can integrate and query data from disparate sources without requiring format-specific query languages or SQL extensions, particularly for hierarchical and relational data models.
Innovation Solution
A generic tabular representation is created through recursive traversal of hierarchical data structures, navigated using RelationshipPrimitives and Chained Self-Joins in standard SQL, allowing queries without recursion and facilitating integration and transformation of structured and unstructured data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If format-specific query languages (XPath, XQuery, JSONQuery) are used to query hierarchical data, then query capability for specific formats is improved, but device complexity and lack of universality worsen
Solution Approach 1:
The patent implements a universal query language that can query multiple data formats (XML, JSON, CSV, HTML, etc.) and hierarchical structures using a single standardized syntax. The query processor translates queries into operations on a common intermediate representation, eliminating the need for separate query languages for each format while maintaining full query capability across diverse data sources.
Solution Approach 2:
The patent introduces a common intermediate representation as a mediator between diverse data formats and query operations. This intermediate representation standardizes the internal structure of hierarchical data from various formats, allowing a single query language to operate uniformly on all data types through translation layers that convert source formats into the intermediate representation.
2Adaptability or versatility
If recursive traversal of hierarchical data structures is performed to create generic tabular representation, then data integration capability is improved, but processing time and computational resources worsen
Solution Approach 1:
The patent performs recursive traversal and conversion of hierarchical data structures into a generic tabular representation as a preliminary step before querying. By pre-processing and standardizing the data structure in advance, the actual query operations can be executed more efficiently on the normalized tabular form, reducing the time required for subsequent query processing and data retrieval.
Solution Approach 2:
The patent divides the data processing into distinct segments: (1) recursive traversal and conversion to intermediate representation, (2) transformation to generic tabular representation, and (3) query execution on the tabular data. This segmentation allows each phase to be optimized independently, with the traversal and conversion performed once during data loading, and queries executed efficiently on the pre-processed tabular structure.
3Ease of operation
If standard SQL is used to navigate generic tabular representation, then ease of operation is improved, but ability to handle hierarchical structures worsens
Solution Approach 1:
The patent uses the generic tabular representation with PathCodes as an intermediary that bridges standard SQL and hierarchical data structures. The PathCode field encodes the hierarchical path information, allowing standard SQL queries to navigate hierarchical relationships by operating on these encoded path strings rather than requiring complex hierarchical query syntax. This mediator enables simple SQL while maintaining hierarchical data handling capability.
Solution Approach 2:
The patent creates a simplified copy of hierarchical data in tabular form where hierarchical relationships are represented through PathCodes rather than complex pointer structures. This tabular copy preserves hierarchical information in a flattened, query-friendly format that can be efficiently processed by standard SQL, separating the conceptual hierarchical structure from the operational query interface.
Data Source
AI summary
The present invention discloses a universal data container, in the form of a generic tabular representation, and methods of navigating and transforming said generic tabular representation by invoking standard SQL-Expressions, implementing the equivalent of XPath expressions, obviating the need for SQL extensions or format-specific query languages, the container accommodating disparate sources regardless of type or format, placing structured and unstructured sources on an equal footing.