Sciweavers

3 search results - page 1 / 1
» Hierarchical locking in B-tree indexes
Sort
View
BTW
2007
Springer
115views Database» more  BTW 2007»
13 years 11 months ago
Hierarchical locking in B-tree indexes
Goetz Graefe
ADC
2000
Springer
326views Database» more  ADC 2000»
13 years 9 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
ICDE
2006
IEEE
185views Database» more  ICDE 2006»
13 years 11 months ago
Don't be a Pessimist: Use Snapshot based Concurrency Control for XML
Currently, only few XML data management systems support concurrent access to an XML document, and if they do, they typically apply variations of hierarchical locking to handle XML...
Zeeshan Sardar, Bettina Kemme