1007 search results - page 82 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
135
click to vote
ITCC
2005
IEEE
15 years 8 months ago
2005
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
216
click to vote
VLDB
2002
ACM
16 years 3 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
114
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
143
click to vote
COR
2011
14 years 9 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
129
click to vote
JUCS
2008
15 years 3 months ago
2008
: Nowadays, while large-sized multimedia objects are becoming very popular throughout the Internet, one of the important issues appears to be the acceleration of content delivery n...