Sciweavers

187 search results - page 3 / 38
» Labeling Schemes for Tree Representation
Sort
View
CIKM
2005
Springer
13 years 11 months ago
Compact reachability labeling for graph-structured data
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...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
JSS
2008
139views more  JSS 2008»
13 years 5 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
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...
Jung-Hee Yun, Chin-Wan Chung
ESA
2009
Springer
77views Algorithms» more  ESA 2009»
14 years 5 hour ago
Short Labels for Lowest Common Ancestors in Trees
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
Johannes Fischer
ICCS
2007
Springer
13 years 11 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
APWEB
2004
Springer
13 years 10 months ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling