Sciweavers

2899 search results - page 153 / 580
» Dynamic Trees in Practice
Sort
View
XSYM
2010
Springer
172views Database» more  XSYM 2010»
13 years 8 months ago
EBSL: Supporting Deleted Node Label Reuse in XML
Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limi...
Martin F. O'Connor, Mark Roantree
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
14 years 1 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
ICFP
2010
ACM
13 years 10 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
PODC
2004
ACM
14 years 3 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku