353 search results - page 12 / 71 » Processing Top-k Join Queries |
PARLE
1993
14 years 1 days ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
SIGMOD
2009
ACM
14 years 8 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
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
VLDB
1994
ACM
14 years 17 hour ago
1994
ACM
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...