Sciweavers

38 search results - page 3 / 8
» Compacting XML Structures Using a Dynamic Labeling Scheme
Sort
View
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
13 years 5 months ago
An optimal labeling scheme for workflow provenance using skeleton labels
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Su...
ICDCN
2009
Springer
13 years 11 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
13 years 11 months ago
Efficient Processing of Updates in Dynamic XML Data
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
Changqing Li, Tok Wang Ling, Min Hu
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 5 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
CIKM
2004
Springer
13 years 10 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...