Sciweavers

1623 search results - page 14 / 325
» No Sorting
Sort
View
HPCC
2007
Springer
15 years 7 months ago
Parallel Database Sort and Join Operations Revisited on Grids
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...
Werner Mach, Erich Schikuta
KBS
2011
81views more  KBS 2011»
14 years 7 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
89
Voted
BMCBI
2010
134views more  BMCBI 2010»
15 years 27 days ago
BayesMotif: de novo protein sorting motif discovery from impure datasets
Background: Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regul...
Jianjun Hu, Fan Zhang
185
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 2 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
IPPS
2002
IEEE
15 years 5 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim