Method and system for rapid insertion of various data streams into sorted tree structures

摘要: The present invention provides the method and system that redistribute nodes of a sorted tree to enable faster data insertion. Further, typically contains fixed number levels, each comprising nodes. Each node in is indexed leaf may comprise segments. An increment empirically calculated as space redistributed among non-empty Furthermore, when segment inserted certain conditions are met, structure with marked head tail effectively “traverses” from one end other searching for empty In cases where encounters an node, continues traversing unless determined stipulate process halts until next insertion before continuing. Moreover, contents copied structure. When has been copied, updates ensure lookup operation on remains valid invariants hold after redistribution. then deleted advanced leave amount spaces traveling direction. traversal follow two possible paths action: either continue or halt