Semantic Storage Model UID Addressing for Data Query Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data structures, such as hierarchical file systems and relational databases, are inefficient in storing, retrieving, and securing data, leading to high operational costs, limited analysis capabilities, and scalability issues, especially in large distributed systems like cloud computing and big data applications.
Innovation Solution
A semantic storage model that uses a unique identifier (UID) to address data objects, with elements like content, identity, and context, organized in a directed acyclic graph architecture, allowing flexible and efficient data modeling, retrieval, and security management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hierarchical file systems or relational databases are used to store and retrieve data, then data can be organized and accessed, but query efficiency deteriorates and operational costs increase in large distributed systems
Solution Approach 1:
The patent segments data into discrete objects with unique identifiers and organizes them in a distributed datastore where each object can be independently addressed and retrieved. This segmentation eliminates the need to traverse hierarchical structures or perform complex relational joins, directly improving query efficiency and reducing retrieval time in large distributed systems.
Solution Approach 2:
The patent creates a universal data object structure that can represent various types of data (files, records, media, metadata) through a common framework using unique identifiers and reference relationships. This universal structure enables efficient querying across diverse data types without requiring separate access mechanisms for different data formats, thereby improving overall productivity while maintaining scalability.
2Reliability
If traditional data structures are used, then data storage and retrieval are possible, but data duplication occurs and security control becomes complex
Solution Approach 1:
The patent introduces unique identifiers as intermediary elements that mediate all data access and security control. Instead of implementing complex security protocols at the data structure level, the system uses UID-based reference relationships where security policies can be applied uniformly to objects and their references. This intermediary mechanism simplifies security management while maintaining reliable control over data access in distributed systems.
Solution Approach 2:
The patent uses reference-based relationships where data objects contain references to other objects rather than duplicating actual data content. This copying principle allows multiple objects to reference the same underlying data without creating redundant storage, reducing data duplication while maintaining the ability to control access through the reference structure and associated security metadata.
3Adaptability or versatility
If hierarchical file systems are used, then data can be organized in directories, but addressability breaks when files are moved or directories are deleted
Solution Approach 1:
The patent transitions from hierarchical directory-based addressing to a flat namespace dimension where all data objects are addressed through unique identifiers at the same level. This dimensional change allows data objects to be moved, added, or removed without affecting the addressability of other objects, as references are based on stable UIDs rather than position-dependent path structures. The system gains adaptability for reorganization while maintaining addressability stability through the UID-based reference mechanism.
Data Source
AI summary
Disclosed is a method, a device, a system and/or a manufacture of efficient data query and utilization through a semantic storage model. In one embodiment, a method includes generating a unique identifier (UID) to uniquely address a domain within a datastore, defining a content element (NT element) storing a primitive data and/or drawing reference(s) to other domains within the datastore according to a directed acyclic graph architecture, an identity entity element (TY element) of the domain storing data that alone or in combination distinguishes the domain from one or more other domains within the datastore, and a context element (XT element) of the domain that further characterizes the domain and/or draws reference(s) to other domains within the datastore which may violate the directed acyclic graph architecture to define a flexible contextual reference. A key may be generated such that the TY element is individually addressable within the datastore.