9 search results - page 1 / 2 » Parallel Database Sort and Join Operations Revisited on Grid... |
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
PDIS
1993
IEEE
13 years 9 months ago
1993
IEEE
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
ICPADS
2000
IEEE
13 years 9 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
DEBU
2010
13 years 2 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
BTW
2003
Springer
13 years 10 months ago
2003
Springer
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...