27 search results - page 2 / 6 » Compact Ancestry Labeling Schemes for XML Trees |
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
ICDE
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
JSS
2008
13 years 5 months ago
2008
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
ICDCN
2009
Springer
14 years 7 days ago
2009
Springer
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...