Optimal Parallel I/O for Range Queries through Replication

Frikken, Keith B.; Atallah, Mikhail J.; Prabhakar, Sunil

doi:10.1007/3-540-46146-9_66

Cited by 15 publications

(19 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using declustering and replication, approaches including Complete Coloring [20] have optimal performance and Square Root Colors Disk Modulo [20] has one more than optimal. Some declustering techniques utilize information about query distribution [22], [23].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analysis and Comparison of Replicated Declustering Schemes

Tosun

2007

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Declustering distributes data among parallel disks to reduce the retrieval cost using I/O parallelism. Many schemes were proposed for the single-copy declustering of spatial data. Recently, declustering using replication gained a lot of interest and several schemes with different properties were proposed. An in-depth comparison of major schemes is necessary to understand replicated declustering better. In this paper, we analyze the proposed schemes, tune some of the parameters, and compare them for different query types and under different loads. We propose a three-step retrieval algorithm for the compared schemes. For arbitrary queries, the dependent and partitioned allocation schemes perform poorly; others perform close to each other. For range queries, they perform similarly with the exception of smaller queries in which random duplicate allocation (RDA) performs poorly and dependent allocation performs well. For connected queries, partitioned allocation performs poorly and dependent allocation performs well under a light load.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Recently, replication strategies for spatial range queries [8], [18], [19], [20], [49] and arbitrary queries [42], [44] were proposed. Replication improves the worst-case additive error for declustering using multiple copies of the data.…”

Section: Introductionmentioning

confidence: 99%

Analysis and Comparison of Replicated Declustering Schemes

Tosun

2007

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…placing records on more than one disk) to increase performance has been introduced. [7,12,13,15]. If replication is used, a retrieval schedule (i.e.…”

Section: Introductionmentioning

confidence: 99%

“…placing each tile on multiple disks) has been introduced [7,12,13,15]. When replication is used each tile in a query can be retrieved from multiple places which allows greater flexibility when answering the query.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we focus on answering range queries in a multidimensional database (such as a GIS), where each of its dimensions is divided uniformly to obtain tiles which are placed on different disks; there has been a significant amount of research for this problem (a subset of which is [1,2,3,4,5,6,7,8,9,11,12,13,14,15]). A declustering scheme would be optimal if any range query could be answered by doing no more than # of tiles inside the range/# of disks retrievals from any one disk.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Replicated Parallel I/O without Additional Scheduling Costs

Atallah

Frikken

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.A common technique for improving performance in a database is to decluster the database among multiple disks so that data retrieval can be parallelized. In this paper we focus on answering range queries in a multidimensional database (such as a GIS), where each of its dimensions is divided uniformly to obtain tiles which are placed on different disks; there has been a significant amount of research for this problem (a subset of which is [1,2,3,4,5,6,7,8,9,11,12,13,14,15]). A declustering scheme would be optimal if any range query could be answered by doing no more than # of tiles inside the range/# of disks retrievals from any one disk. However, it was shown in [1] that this is not achievable in many cases even for two dimensions, and therefore much of the research in this area has focused on developing schemes that performed close to optimal. Recently, the idea of using replication (i.e. placing records on more than one disk) to increase performance has been introduced. [7,12,13,15]. If replication is used, a retrieval schedule (i.e. which disk to retrieve each tile from) must be computed whenever a query is being processed. In this paper we introduce a class of replicated schemes where the retrieval schedule can be computed in time O(# of tiles inside the query's range), which is asymptotically equivalent to query retrieval for the non-replicated case. Furthermore, this class of schemes has a strong performance advantage over non-replicated schemes, and several schemes are introduced that are either optimal or are optimal plus a constant additive factor. Also presented in this paper is a strictly optimal scheme for any number of colors that requires the lowest known level of replication of any such scheme.

show abstract

Declustering Two-Dimensional Datasets over MEMS-Based Storage

Agrawal

Abbadi

2004

Advances in Database Technology - EDBT 2004

View full text Add to dashboard Cite

Optimal Parallel I/O for Range Queries through Replication

Cited by 15 publications

References 13 publications

Analysis and Comparison of Replicated Declustering Schemes

Analysis and Comparison of Replicated Declustering Schemes

Replicated Parallel I/O without Additional Scheduling Costs

Declustering Two-Dimensional Datasets over MEMS-Based Storage

Contact Info

Product

Resources

About