Sciweavers

27 search results - page 1 / 6
» Compact Ancestry Labeling Schemes for XML Trees
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 2 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 6 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
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
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 6 months ago
Compacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common ap...
Ramez Alkhatib, Marc H. Scholl
SPAA
2009
ACM
14 years 5 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman