Sciweavers

14 search results - page 1 / 3
» New Concurrency Control Algorithms for Accessing and Compact...
Sort
View
VLDB
1994
ACM
101views Database» more  VLDB 1994»
13 years 8 months ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman
PPL
2007
86views more  PPL 2007»
13 years 4 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
ASAP
2007
IEEE
116views Hardware» more  ASAP 2007»
13 years 6 months ago
The Design of a Novel Object-oriented Processor : OOMIPS
A novel object-oriented processor is proposed in this paper, which provides support for object addressing, message passing and dynamic memory management. Object running on this pr...
Weixing Ji, Feng Shi, Baojun Qiao, Muhammad Kamran
SACMAT
2005
ACM
13 years 10 months ago
Relevancy based access control of versioned XML documents
Integration of version and access control of XML documents has the benefit of regulating access to rapidly growing archives of XML documents. Versioned XML documents provide us w...
Mizuho Iwaihara, Somchai Chatvichienchai, Chutipor...
ICLP
1999
Springer
13 years 8 months ago
Concurrency in Prolog Using Threads and a Shared Database
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
Manuel Carro, Manuel V. Hermenegildo