147 search results - page 8 / 30 » Size Bounds and Query Plans for Relational Joins |
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
ICDE
1998
IEEE
14 years 8 months ago
1998
IEEE
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
SIGMOD
2009
ACM
14 years 2 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...