2 search results - page 1 / 1 » Simple, Robust and Highly Concurrent B-trees with Node Delet... |
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...