1007 search results - page 70 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
119
click to vote
EDBTW
2006
Springer
15 years 6 months ago
2006
Springer
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 ...
151
click to vote
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
128
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
122
click to vote
PPOPP
1997
ACM
15 years 7 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
132
click to vote
CCGRID
2010
IEEE
15 years 15 days ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...