Sciweavers

12 search results - page 1 / 3
» High-Concurrency Locking in R-Trees
Sort
View
INFSOF
2006
117views more  INFSOF 2006»
13 years 10 months ago
A high concurrency XPath-based locking protocol for XML databases
Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past...
Kuen-Fang Jack Jea, Shih-Ying Chen
VLDB
1995
ACM
68views Database» more  VLDB 1995»
14 years 2 months ago
High-Concurrency Locking in R-Trees
Marcel Kornacker, Douglas Banks
OSDI
1994
ACM
14 years 5 days ago
Experiences with Locking in a NUMA Multiprocessor Operating System Kernel
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...
Ronald C. Unrau, Orran Krieger, Benjamin Gamsa, Mi...
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
14 years 2 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
14 years 3 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss