Title (en)

Tree-based node insertion method and memory device

Title (de)
Baumbasiertes Knoteneinfügungsverfahren und Speichervorrichtung

Title (fr)
Procédé d'insertion de nœud à base d'arbre et dispositif de mémoire

Publication
EP 2237196 A1 20101006 (EN)

Application
EP 10003291 A 20100326

Priority
CN 200910132653 A 20090330

Abstract (en)
A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion
method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller
than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a
node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new
secondary tree, and if not, inserting the node to be inserted into the current secondary tree.

IPC 8 full level (invention and additional information)

G06N 5/02  (2006.01); G06F 17/30  (2006.01); H04L 12/56  (2006.01)

CPC (invention and additional information)

G06N 5/02 (2013.01); G06F 16/9027 (2019.01)

Citation (applicant)
• RICHARD F. GILBERG; BEHROUZ A. FOROUZAN: "DATA STRUCTURES: A PSEUDOCODE APPROACH WITH C", 31 May
2006, pages: 423 - 479
• "ACM COMPUTING SURVEYS", vol. 11, 1 June 1979, ACM, article "THE UBIQUITOUS B. TREE", pages: 121 - 137
• HAIBIN LU ET AL.: "A B-Tree Dynamic Router-Table Design", IEEE TRANSACTIONS ON COMPUTERS, vol. 54, no. 7, 1 July 2005
(2005-07-01), pages 813 - 824, XP011132776, DOI: doi:10.1109/TC.2005.104

Citation (search report)

• [XY] RICHARD F. GILBERG AND BEHROUZ A. FOROUZAN: "DATA STRUCTURES: A PSEUDOCODE APPROACH WITH C,
Chapter 10", part 10 31 May 2006, THOMSON COURSE TECHNOLOGY, ISBN: 0534390803, article "Multiway Trees", pages: 423
- 479, XP002585678
• [XA] COMER D: "THE UBIQUITOUS B.TREE", ACM COMPUTING SURVEYS, ACM, NEW YORK, NY, US, US LNKD-
DOI:10.1145/356770.356776, vol. 11, no. 2, 1 June 1979 (1979-06-01), pages 121 - 137, XP002066573, ISSN: 0360-0300
• [YA] HAIBIN LU ET AL: "A B-Tree Dynamic Router-Table Design", IEEE TRANSACTIONS ON COMPUTERS, IEEE SERVICE
CENTER, LOS ALAMITOS, CA, US LNKD- DOI:10.1109/TC.2005.104, vol. 54, no. 7, 1 July 2005 (2005-07-01), pages 813 - 824,
XP011132776, ISSN: 0018-9340
• [A] RAO J ET AL: "Making B+-trees cache conscious in main memory", ACM PROCEEDINGS OF SIGMOD. INTERNATIONAL
CONFERENCE ON MANAGEMENT OF DATA, XX, XX LNKD- DOI:10.1145/342009.335449, 1 May 2000 (2000-05-01), pages 475
- 486, XP003000891

Designated contracting state (EPC)

AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

Designated extension state (EPC)

AL BA ME RS

DOCDB simple family

EP 2237196 A1 20101006; CN 101515298 A 20090826; CN 101515298 B 20130925; US 2010246446 A1 20100930; US 8208408 B2 20120626