Global Patent Index - EP 2053518 A1

EP 2053518 A1 20090429 - Cache-conscious concurrency control scheme for database systems

Title (en)

Cache-conscious concurrency control scheme for database systems

Title (de)

Cachebewusstes Konkurrenzsteuerungsschema für Datenbanksysteme

Title (fr)

Schéma de contrôle d'accès simultané à cache connue pour systèmes de base de données

Publication

EP 2053518 A1 20090429 (EN)

Application

EP 09001539 A 20020604

Priority

  • EP 02733558 A 20020604
  • KR 20010032319 A 20010609

Abstract (en)

The present invention relates to a method, a corresponding system and a computer program for traversing an index tree consisting of nodes for searching data in a database of a database management system having main memory and cache, in order to find a leaf node corresponding to a search key through latch-free read operations in the database management system, where each node has contents, a version number indicating the updated status of the node contents, a latch governing concurrent access to each node, wherein the node contents further includes one or more keys, a high key denoting the upper bound of the keys, a link pointer pointing to the right sibling of the node at the same level, and one or more pointers to data items in the database in the case of a leaf node and to child nodes in the case of a non-leaf node, the method comprising the steps of: starting from the root node; following the link pointer if the search key is greater than the high key of the node; and following one of the pointers to a child node if the key is not greater than the high key of the node; and repeating said steps of following the link pointer and the following one of the pointers to a child node until a leaf node corresponding to the search key is found.

IPC 8 full level

G06F 12/08 (2006.01); G06F 17/30 (2006.01)

CPC (source: EP KR)

G06F 12/08 (2013.01 - KR); G06F 16/2246 (2018.12 - EP); G06F 16/2322 (2018.12 - EP); G06F 16/2329 (2018.12 - EP)

Citation (applicant)

P. LEHMANN, S. BINIG YAO: "Efficient Locking for Concurrent Operations on B-Trees", ACM TRANSACTIONS ON DATABASE SYSTEMS, vol. 6, no. 4, December 1981 (1981-12-01), pages 650 - 670

Citation (search report)

  • [A] US 6009425 A 19991228 - MOHAN CHANDRASEKARAN [US]
  • [X] LEHMAN P L ET AL: "EFFICIENT LOCKING FOR CONCURRENT OPERATIONS ON B-TREES", ACM TRANSACTIONS ON DATABASE SYSTEMS, ACM, NEW YORK, NY, US, vol. 6, no. 4, December 1981 (1981-12-01), pages 650 - 670, XP000718746, ISSN: 0362-5915
  • [A] RASTOGI R ET AL: "Logical and physical versioning in main memory databases", PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES MORGAN KAUFMANN PUBLISHERS SAN FRANCISCO, CA, USA, 1997, pages 86 - 95, XP007901421, ISBN: 1-55860-470-7
  • [A] RASTOGI R ET AL: "Improving predictability of transaction execution times in real-time databases", REAL-TIME SYSTEMS KLUWER ACADEMIC PUBLISHERS NETHERLANDS, vol. 19, no. 3, November 2000 (2000-11-01), pages 283 - 302, XP002416965, ISSN: 0922-6443
  • [A] JUN RAO ET AL: "Cache conscious indexing for decision-support in main memory", PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, XX, XX, vol. 25TH, September 1999 (1999-09-01), pages 78 - 89, XP003001404
  • [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, May 2000 (2000-05-01), pages 475 - 486, XP003000891
  • [A] SAGIV Y: "CONCURRENT OPERATIONS ON B-TREES WITH OVERTAKING", PROCEEDINGS OF THE ACM SIGACT-SIGMOD-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 1985, pages 28 - 37, XP000748395
  • [XP] SANG K CHA ET AL: "Cache-conscious concurrency control of main-memory indexes on shared-memory multiprocessor systems", PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, XX, XX, vol. 27TH, September 2001 (2001-09-01), pages 181 - 190, XP003001403
  • [A] GOTTEMUKKALA V ET AL: "Relaxed index consistency for a client-server database", DATA ENGINEERING, 1996. PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON NEW ORLEANS, LA, USA 26 FEB.-1 MARCH 1996, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 26 February 1996 (1996-02-26), pages 352 - 361, XP010158934, ISBN: 0-8186-7240-4
  • [A] HONGJUN LU ET AL: "T-tree or B-tree: main memory database index structure revisited", DATABASE CONFERENCE, 2000. ADC 2000. PROCEEDINGS. 11TH AUSTRALASIAN CANBERRA, ACT, AUSTRALIA 31 JAN.-3 FEB. 2000, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 31 January 2000 (2000-01-31), pages 65 - 73, XP010370177, ISBN: 0-7695-0528-7

Designated contracting state (EPC)

AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

DOCDB simple family (publication)

WO 02101557 A1 20021219; CN 100367239 C 20080206; CN 1522409 A 20040818; EP 1395906 A1 20040310; EP 1395906 A4 20070314; EP 1395906 B1 20130807; EP 2053518 A1 20090429; EP 2053518 B1 20130807; KR 100832222 B1 20080523; KR 20020093519 A 20021216

DOCDB simple family (application)

KR 0201060 W 20020604; CN 02811601 A 20020604; EP 02733558 A 20020604; EP 09001539 A 20020604; KR 20010032319 A 20010609