Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

VLDB
1995
ACM

68views Database» more VLDB 1995»

High-Concurrency Locking in R-Trees

15 years 6 months ago

High-Concurrency Locking in R-Trees

Download db.cs.berkeley.edu

Marcel Kornacker, Douglas Banks

Real-time Traffic

Database | VLDB 1995 |

claim paper

Related Content

» A high concurrency XPathbased locking protocol for XML databases

» Experiences with Locking in a NUMA Multiprocessor Operating System Kernel

» Implementing and Optimizing FineGranular Lock Management for XML Document Trees

» Transactional Memory Architectural Support for LockFree Data Structures

» LockFree and Practical Doubly Linked ListBased Deques Using SingleWord CompareandSwap

» Scalable FlatCombining Based Synchronous Queues

» The Real Performance Drivers behind XML Lock Protocols

» TTree or BTree Main Memory Database Index Structure Revisited

» CAR Clock with Adaptive Replacement

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	VLDB
Authors	Marcel Kornacker, Douglas Banks

Comments (0)