Industry Academic Cooperation Foundation of Yeungnam University

Industry-academic Cooperation Foundation, Kunsan National University

Industry Academic Cooperation of Yeungnam University

Byung Won On

Gyu Sang Choi

In Gyu Lee

Jabarov Elkhan

The present disclosure relates to a method for hash collision detection based on the sorting unit of the bucket designed to reduce the future search time by pre-aligning the database in the bucket and to enhance the efficiency in a search within the database. The present disclosure, a method for hash collision detection based on the sorting unit of the bucket using conventional separate chaining method, comprises aligning records in a single bucket of a directory in ascending order or descending order and maintaining the alignment of records in the bucket when new records are added to the directory.

Method for hash collision detection based on the sorting unit of the bucket

A non-volatile memory includes: at least one parent node; and at least one child node that stores a data object and has a variable size of n multiple of the parent node, n being a natural number, when a target child node to insert at least one new data object is fully filled, wherein the data objects of the target child node are split and reinserted into newly created at least one child node.

Operating method for non-volatile memory

The present application relates to a heap sorting method based on arrangement and apparatus which can improve the heap sorting conducting speed through reducing access (I/O) frequency of the external memory when conducting heap sorting through storing binary data in the basic access unit of the external memory device in reference to the subtree unit.

Growing community of inventors

Jeollabuk-do, South Korea

Byung Won On