552 search results - page 45 / 111 » On the Complexity of Join Predicates |
102
click to vote
WIDM
2004
ACM
15 years 6 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
116
Voted
CIKM
2004
Springer
15 years 6 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
GIS
2010
ACM
14 years 11 months ago
2010
ACM
Recently, a wide range of applications like hurricane research, fire management, navigation systems, and transportation, to name only a few, has shown increasing interest in mana...
203
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
113
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...