z-logo
open-access-imgOpen Access
A Concurrency Control Method for Non-blocking Search Operation based on R-tree
Author(s) -
Myung-Keun Kim
Publication year - 2004
Publication title -
the kips transactions partd
Language(s) - English
Resource type - Journals
ISSN - 1598-2866
DOI - 10.3745/kipstd.2004.11d.4.809
Subject(s) - computer science , node (physics) , blocking (statistics) , search tree , lock (firearm) , concurrency control , tree (set theory) , concurrency , breadth first search , depth first search , binary search tree , b tree , search algorithm , distributed computing , theoretical computer science , algorithm , binary tree , computer network , mathematics , database , engineering , database transaction , mechanical engineering , mathematical analysis , structural engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom