Converter Traversal Using Power of Two Bit Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database systems face performance issues due to computationally expensive division and modulo operations during converter page traversal, which impede the speed of tree traversal in determining data page locations.
Innovation Solution
The proposed solution involves optimizing converter page traversal by using bit-shifting operations instead of division, and modifying the logical page number using AND operations to simplify the process of identifying child pages and mappings, even when the actual number of mappings per branch is not a power of two.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If division and modulo operations are used during converter page traversal, then accurate child page identification is achieved, but computational overhead increases and traversal speed decreases
Solution Approach 1:
The patent changes the parameter representation from decimal-based division/modulo operations to binary-based bit manipulation operations. By representing page numbers in binary format, the patent transforms complex arithmetic operations into simple bit-shifting and masking operations, maintaining accuracy while dramatically improving computational speed.
Solution Approach 2:
The patent substitutes the mechanical arithmetic system (division and modulo operations) with a more efficient electronic/bit-level operation system. Instead of performing sequential arithmetic calculations, the patent uses parallel bit manipulation operations that can be executed more rapidly by modern processors, effectively replacing a computationally intensive mechanism with a lighter-weight alternative.
2Adaptability or versatility
If the actual number of mappings per branch is not a power of two, then flexible page organization is achieved, but the complexity of determining child page identifiers increases
Solution Approach 1:
The patent introduces a new parameter representation where page numbers are expressed in binary format with specific bit positions representing different hierarchical levels. By changing how page numbers are represented and interpreted, the patent enables flexible page organization without requiring power-of-two branch sizes, while the bit manipulation operations keep the determination process relatively simple.
Solution Approach 2:
The patent segments the binary representation of page numbers into distinct bit fields, where different segments correspond to different levels of the converter tree. This segmentation allows the system to handle variable branch sizes by selectively using different portions of the binary representation, maintaining adaptability while simplifying the identification process through structured bit field manipulation.
Data Source
AI summary
A system includes reception of a request for a page location corresponding to a logical page number, determination of a difference between the logical page number and a smallest logical page number of each of a plurality of converter leaf pages descending from a parent converter inner page, determination of a smallest number 2x that is greater than the number of logical page number-to-page location mappings within each one of the plurality of converter leaf pages, right-shifting of a binary representation of the difference x positions to determine a branch index, identification of one of the plurality of converter leaf pages based on the branch index and on an indexed list of converter page identifiers within the parent converter inner page, logically ANDing of the binary representation of the difference with a binary representation of 2x−1 to determine a mapping index of the identified converter leaf page, identification of a mapping of the identified converter leaf page based on the mapping index, and determination of the page location corresponding to the logical page number based on the mapping.


