43 search results - page 7 / 9 » Schema for Parallel Insertion and Deletion |
SPAA
2004
ACM
14 years 26 days ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
PODC
2003
ACM
14 years 21 days ago
2003
ACM
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...