Sciweavers

119 search results - page 19 / 24
» Labeling Dynamic XML Trees
Sort
View
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 11 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
LICS
2012
IEEE
12 years 6 days ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
CIKM
2006
Springer
14 years 1 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
IJISTA
2007
88views more  IJISTA 2007»
13 years 9 months ago
Event triggered Holonic organisation formation
: Internet based distributed collaborative commerce must resolve two problems first. One is what organisation shape is and the other is how to establish an efficient and active org...
Mingwei Yuan, Ping Jiang, Zuren Feng
IPPS
1997
IEEE
14 years 2 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya