From discrepancy to declustering Near-optimal multidimensional declustering strategies for range queries.
Declustering schemes allocate data blocks among multiple disks to enable parallel retrieval. Given a declustering scheme D, its response time with respect to a query Q, rt(Q), is defined to be the maximum number of data blocks of the query stored by the scheme in any one of the disks. If |Q| is the...
| Publicado no: | Journal of the ACM 51, 1 (2004). |
|---|---|
| Autor principal: | |
| Formato: | Artigo |
| Idioma: | inglês |
| Assuntos: |