Sciweavers

13 search results - page 3 / 3
» B-tree indexes for high update rates
Sort
View
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 1 months ago
Crescando
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
Georgios Giannikis, Philipp Unterbrunner, Jeremy M...
INFOCOM
2005
IEEE
13 years 12 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
ICDE
2006
IEEE
185views Database» more  ICDE 2006»
14 years 9 days 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