Sciweavers

68 search results - page 4 / 14
» Concurrency Control in Distributed MRA Index Structure
Sort
View
SAC
2008
ACM
13 years 7 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...
PPOPP
2006
ACM
14 years 1 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
TODS
2010
108views more  TODS 2010»
13 years 6 months ago
A survey of B-tree locking techniques
: © A survey of B-tree locking techniques Goetz Graefe HP Laboratories HPL-2010-9 storage systems, databases, B-tree, indexes, concurrency control, locking B-trees have been ubiqu...
Goetz Graefe
VLDB
1999
ACM
131views Database» more  VLDB 1999»
13 years 12 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
SIGSOFT
2003
ACM
14 years 8 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke