Sciweavers

785 search results - page 37 / 157
» Binary Join Trees
Sort
View
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
15 years 11 months ago
Minimization and Group-By Detection for Nested XQueries
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
Alin Deutsch, Yannis Papakonstantinou, Yu Xu
ICNP
1998
IEEE
15 years 2 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay
ADC
2008
Springer
143views Database» more  ADC 2008»
14 years 11 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...