Sciweavers

48 search results - page 1 / 10
» Investigations in tree locking for compiled database applica...
Sort
View
CASCON
2004
110views Education» more  CASCON 2004»
13 years 6 months ago
Investigations in tree locking for compiled database applications
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
Heng Yu, Grant E. Weddell
DEXA
2009
Springer
127views Database» more  DEXA 2009»
13 years 11 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
13 years 9 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
PPOPP
1997
ACM
13 years 9 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
ER
2010
Springer
124views Database» more  ER 2010»
13 years 2 months ago
Integrity Assurance for RESTful XML
The REpresentational State Transfer (REST) represents an extensible, easy and elegant architecture for accessing web-based resources. REST alone and in combination with XML is fast...
Sebastian Graf, Lukas Lewandowski, Marcel Waldvoge...