801 search results - page 4 / 161 » Minimal Locked Trees |
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
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...
164
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
CCGRID
2001
IEEE
15 years 1 months ago
2001
IEEE
Home-based Lazy Release Consistency (HLRC) shows poor performance on lock based applications because of two reasons: (1) a whole page is fetched on a page fault while actual modif...
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
JCSS
2007
14 years 9 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...