Flat Map Representation for Distributed Cache Tree Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Operation on logical tree structures in data grids can negatively impact CPU and memory performance, particularly in distributed cache systems where resilience and scalability are crucial.
Innovation Solution
A method and apparatus that transparently represent a logical tree structure using a flat map structure, where each cache node is defined and operated on using a two-dimensional coordinate, including a fully qualified name and a type, allowing for efficient access and navigation with O(1) complexity, hidden from the user through a tree facade.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a logical tree structure is used to represent data in a distributed cache system, then data organization and navigation are simplified, but CPU and memory performance deteriorate due to additional operational overhead
Solution Approach 1:
The patent introduces a flat map structure as an intermediary representation layer between the logical tree structure and the physical storage. This flat map serves as a mediator that translates tree structure operations into efficient flat structure operations, thereby maintaining ease of data organization while improving CPU and memory performance by eliminating the overhead of actual tree structure navigation in the distributed cache system
Solution Approach 2:
The patent creates a copy of the tree structure representation in a flat map format. Instead of using the actual tree structure for storage and operations, the system maintains a flat map copy that represents the tree structure in a flattened manner, allowing efficient access patterns while preserving the logical tree organization. This copying approach enables performance optimization without sacrificing data organization capabilities
2Productivity
If a flat map structure is used to represent cache nodes, then access and navigation efficiency improve to O(1) complexity, but the ability to naturally represent hierarchical tree structures is lost
Solution Approach 1:
The flat map structure acts as an intermediary that bridges the gap between efficient flat storage and hierarchical tree representation. By using the flat map as the underlying storage mechanism and maintaining tree structure information as metadata or indexed data within the flat map, the system achieves O(1) access efficiency while preserving the ability to represent and navigate hierarchical structures through the flat map's organized data layout
Solution Approach 2:
The patent transforms the two-dimensional tree structure into a flattened one-dimensional array representation within the flat map. This dimensional transformation allows efficient linear access patterns while the original hierarchical relationships are preserved through indexing mechanisms or metadata fields, enabling O(1) access complexity without losing hierarchical representation capability
3Reliability
If distributed cache clustering is implemented to provide resilience and scalability, then system reliability improves, but the complexity of managing and operating the distributed system increases
Solution Approach 1:
The patent changes the fundamental parameter of data structure representation from hierarchical tree structures to flat map structures in the distributed cache system. This parameter change simplifies the operations required for data storage, retrieval, and navigation in the distributed environment, thereby reducing the complexity of managing and operating the system while maintaining the resilience and scalability benefits of distributed clustering
Data Source
AI summary
An apparatus and a method for accessing data at a server node of a data grid system with distributed cache is described. The server receives a request to access a logical tree structure of cache nodes at a tree structure interface module of the server. The tree structure interface operates on a flat map structure of the cache nodes corresponding to the logical tree structure, transparent to the request. Each cache node is defined and operated on using a two-dimensional coordinate including a fully qualified name and a type.