Invention Grant
- Patent Title: Persistent iteration over a database tree structure
- Patent Title (中): 在数据库树结构上持续迭代
-
Application No.: US13489390Application Date: 2012-06-05
-
Publication No.: US08650219B2Publication Date: 2014-02-11
- Inventor: Yariv Bachar , Aviv Kuvent , Asaf Levy
- Applicant: Yariv Bachar , Aviv Kuvent , Asaf Levy
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Griffiths & Seaton PLLC
- Main IPC: G06F7/00
- IPC: G06F7/00 ; G06F17/30

Abstract:
Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.
Public/Granted literature
- US20130325902A1 PERSISTENT ITERATION OVER A DATABASE TREE STRUCTURE Public/Granted day:2013-12-05
Information query