Sciweavers

353 search results - page 28 / 71
» Processing Top-k Join Queries
Sort
View
EDBTW
2006
Springer
13 years 11 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
14 years 9 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
12 years 10 months ago
How soccer players would do stream joins
In spite of the omnipresence of parallel (multi-core) systems, the predominant strategy to evaluate window-based stream joins is still strictly sequential, mostly just straightfor...
Jens Teubner, René Müller
DOLAP
2003
ACM
14 years 1 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos