Tmaxdata Co., Ltd.

Ingyu Kang

Dongyun Yang

Jae Seok An

Jooho Kim

Sangyoung Park

A node search method, comprising: setting a current time value as a traversing time value; searching descendent nodes to perform a traversing from a root node to a leaf node according to a tree index data structure; determining whether a preset traversing condition is satisfied by comparing an update time value, which indicates a time when a change to a searched descendent node is made, with the traversing time value; depending on whether the traversing proceeding condition is satisfied, re-performing a traversing from a parent node or continuing traversing to the searched descendent node; and terminating the traversing at a leaf node where no descendent node exists.

Method and apparatus for searching node by using tree index

Provided is a method for managing a shared memory in a database server. The database server includes a shared memory manager which divides a shared memory into a plurality of memory chunks to manage the memory chunks and allocates at least one memory chunk to a cache memory manager based on a request of the cache memory manager; a cache memory manager which requests at least one of the plurality of memory chunks to the shared memory manager, wherein the database server includes a plurality of cache memory managers and the database server uses the memory chunk which is allocated to the cache memory manager as a cache memory having a predetermined purpose, and the predetermined purposes of the plurality of cache memory managers are different from each other; and a main processor which performs a database operation using the cache memory.

Growing community of inventors

Gyeonggi-do, South Korea

Ingyu Kang