Sciweavers

38 search results - page 4 / 8
» Compacting XML Structures Using a Dynamic Labeling Scheme
Sort
View
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 5 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu
WWW
2007
ACM
14 years 6 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
ADC
2008
Springer
114views Database» more  ADC 2008»
13 years 7 months ago
An Integrated Access Control for Securely Querying and Updating XML Data
Many existing access controls use node filtering or querying rewriting techniques. These techniques require rather time-consuming processes such as parsing, labeling, pruning and/...
Maggie Duong, Yanchun Zhang
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
13 years 12 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
PODC
2006
ACM
13 years 11 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...