Abstract
The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture. The algorithms use dynamic programming and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries. Each processor then constructs in parallel its own portion of the grid file. Analytical results and simulations are given for the three algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 347-356 |
| Number of pages | 10 |
| Journal | ACM SIGMOD Record |
| Volume | 22 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jan 6 1993 |
| Externally published | Yes |