METHOD FOR REDUCING THE SCOPE OF THE K NODE CONSTRUCTION LOCK

A method for recording information in an interlocking trees datastore having a plurality of K paths includes receiving an input particle and building a new K node in accordance with the received input particle. A K node is locked in accordance with the building of the new K node to provide a locked node. The locked node can be the Case node of the new K node. The Case bi-directional link between the locked Case node and the new K node is completed while the locked Case node is locked. A pointer is added to the new K node to an asCase list of the locked Case node. The locked node is locked only while adding the pointer to the new K node to the asCase list of the locked Case node. The locked node can also be a Result node of the new K node.