METHODS AND SYSTEMS FOR DATA CONSISTENT SEARCH AND STORAGE USING TREES

Two versions of a database can be held in two trees that have many of the same nodes. Both trees can be concurrently searched using recursive algorithms. A root node indicator indicates a root node for a tree search algorithm. The root node indicator can indicate a first root node of a first tree. A...

Full description

Saved in:
Bibliographic Details
Main Authors Goli, Sri, Ramaswamy, Pavithra, Seshan, Lakshmi Narasimhan, Kamisetty, Sarat
Format Patent
LanguageEnglish
Published 26.01.2023
Online AccessGet full text

Cover

More Information
Summary:Two versions of a database can be held in two trees that have many of the same nodes. Both trees can be concurrently searched using recursive algorithms. A root node indicator indicates a root node for a tree search algorithm. The root node indicator can indicate a first root node of a first tree. A tree search algorithm can identify a record node in the first tree. Intermediate nodes between the record node and the first root node can be identified and retained nodes can be identified. A second root node and replacement intermediate nodes can be instantiated. A second tree that includes the second root node, the replacement intermediate node, and the retained nodes can be created. The root node indicator can be set to indicate the second root node after creating the second tree.
Bibliography:Application Number: US202117381170