Instantly Built Information Space Memory Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database systems face challenges with high latency and increased complexity due to memory limitations, as they require copying data between main memory and secondary storage, and struggle with attaching and detaching multiple databases quickly, leading to inefficiencies in performance-intensive applications like portfolio management.
Innovation Solution
The implementation of a Segmented Global Area (SAGA) database with an Instantly Built Information Space (IBIS) that uses memory-mapped segment files, allowing direct access to data without copying, and enables transparent mapping of data into and out of main memory, reducing latency and complexity by using a fault handler to manage segmentation faults and support large datasets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If data is stored in main memory to achieve low-latency access, then access speed is improved, but hardware cost increases
Solution Approach 1:
The database is divided into multiple segments that can be independently mapped into main memory. Only the segments currently needed by the application are loaded into memory, while other segments remain on disk. This segmentation allows the system to achieve low-latency access to active data without requiring the entire database to reside in expensive main memory.
2Ease of operation
If data is copied between main memory and secondary storage, then data access is enabled, but system complexity increases
Solution Approach 1:
The patent introduces a caching layer that acts as an intermediary between the application and the segmented database storage. This cache automatically manages the mapping and unmapping of database segments to and from main memory, transparently handling data access operations. The intermediary cache absorbs the complexity of memory management, presenting a simplified interface to the application while maintaining low-latency access to frequently used data.
3Adaptability or versatility
If multiple databases are attached to a unified table structure, then data integration is achieved, but attachment and detachment speed decreases
Solution Approach 1:
Each database is organized as independent segments with their own segment files rather than being integrated into a single unified table structure. This segmentation allows databases to be attached and detached as independent units by simply mapping or unmapping their segment files, eliminating the time-consuming operations of importing and integrating data into unified tables while maintaining the ability to integrate multiple databases when needed.
4Quantity of substance
If data is stored in segmented files with fault handler, then large dataset management is improved, but system complexity increases
Solution Approach 1:
The fault handler is designed to automatically manage segmentation faults without requiring complex external intervention. When a segmentation fault occurs, the fault handler autonomously identifies the needed database segment, maps it into memory from the segmented files, and resumes application execution. This self-service approach allows the system to handle very large datasets by breaking them into manageable segments while minimizing the complexity burden on the application developer.
Data Source
AI summary
A computer system for generating an Instantly Built Information Space (IBIS) for use with an application program is provided. The application program connects to a data repository. The application program connects to at least one Bookkeeping Information Space (BIS). The address of a main database object of the BIS is placed into a knowledge base pointer. The address of a main database object of the database is placed into a pointer in an object of the BIS. The database and the BIS are included in the IBIS. The BIS is accessed by the application program through the knowledge base pointer and the database is accessed by the application program through the pointer in the object of the BIS.