Sciweavers

12 search results - page 3 / 3
» High-Concurrency Locking in R-Trees
Sort
View
PPOPP
2006
ACM
13 years 11 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 7 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik