1007 search results - page 100 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
124
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
Many image and signal processing kernels can be optimized for performance consuming a reasonable area by doing loops parallelization with extensive use of pipelining. This paper p...
135
Voted
IOPADS
1997
15 years 4 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
120
Voted
GRID
2006
Springer
15 years 2 months ago
2006
Springer
A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document p...
147
click to vote
EDBT
2002
ACM
16 years 2 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
135
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...