Sciweavers

187 search results - page 4 / 38
» Labeling Schemes for Tree Representation
Sort
View
CIKM
2005
Springer
13 years 11 months ago
On reducing redundancy and improving efficiency of XML labeling schemes
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
Changqing Li, Tok Wang Ling, Jiaheng Lu, Tian Yu
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 6 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
ICDCN
2009
Springer
14 years 1 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
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
14 years 6 months ago
ORDPATHs: Insert-Friendly XML Node Labels
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft? SQL ServerTM. ORDPATH labels nodes of an XML tree without requ...
Patrick E. O'Neil, Elizabeth J. O'Neil, Shankar Pa...
LCN
2005
IEEE
13 years 11 months ago
A New Scheme for Interconnecting LANs with Label Switching Bridges
Ethernet, which has traditionally been the dominant technology in Local Area Networks, is now facing new challenges due to the fact that networks have scaled and today’s applica...
Thierry K. Feuzeu, Bernard Cousin