Distributed Hash Table for Consistent Object Store Database
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current distributed database systems face challenges in providing consistent and scalable storage solutions that can efficiently manage large-scale storage systems, particularly in implementing file directory and block-based storage systems, while ensuring data consistency and reliability.
Innovation Solution
The implementation of a distributed consistent database system with a Chord-like distributed hash table access mechanism, which allows for intelligent routing, parallel access capabilities, and meta-data management, along with a distributed database management system that provides interfaces for converting access methods between different storage types, enabling the use of an object store as a key-value store, directory-based, or block-based storage system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If a traditional database storage implementation with indexing layer and storage layer is used, then data access efficiency is improved, but system complexity increases
Solution Approach 1:
The patent extracts the indexing layer from the traditional database storage implementation and replaces it with a Chord-like distributed hash table mechanism. This separation allows the storage layer to focus on data persistence while the hash table handles routing and access, reducing overall system complexity while maintaining access efficiency.
Solution Approach 2:
The patent creates a universal storage system that can implement multiple storage types (object store, key-value store, directory-based storage, block-based storage) through a single distributed hash table mechanism. This multi-functionality eliminates the need for separate indexing structures for each storage type, thereby reducing system complexity.
2Quantity of substance
If distributed database systems are implemented to provide scalable storage, then storage capacity and accessibility are improved, but data consistency becomes more difficult to maintain
Solution Approach 1:
The patent introduces the distributed hash table as an intermediary layer between multiple storage nodes and access requests. This intermediary maintains consistency by providing a unified namespace and routing mechanism that coordinates access across distributed nodes, ensuring data consistency even as storage capacity scales.
Solution Approach 2:
The Chord-like distributed hash table implements feedback mechanisms through its routing protocol, where nodes continuously update their routing tables and coordinate with each other to maintain consistency. This feedback loop ensures that as new nodes are added or data is distributed, consistency is maintained across the entire distributed system.
3Adaptability or versatility
If multiple storage system types are supported through a unified interface, then system versatility is improved, but implementation complexity increases
Solution Approach 1:
The patent implements a universal distributed hash table mechanism that can support multiple storage types (object store, key-value store, directory-based storage, block-based storage) through a single implementation framework. This universality allows the system to provide versatile storage solutions without requiring separate complex implementations for each storage type.
Solution Approach 2:
The patent segments the storage system into distinct layers: the distributed hash table layer for routing and access, and the storage implementation layer for specific storage types. This segmentation allows each layer to be developed and maintained independently, reducing implementation complexity while maintaining versatility.
Data Source
AI summary
A storage system is described. The storage system includes an object store having a plurality of objects to implement a quota policy or a part of a relational database. The plurality of objects include a first plurality of immutable objects, a second plurality of immutable objects and a head object. The first plurality of immutable objects contain information kept within the database. The second plurality of immutable objects contain a hierarchy of pages for accessing the first plurality of immutable objects. The plurality of objects also include a mutable object that contains a mapping table that maps identifiers of the pages to identifiers of objects of the second plurality of immutable objects. The information is one of: quota policy information; information within a table of a relational database; a stripe of a thin provisioned file.