scholar.google.com › citations
In this study we propose a replicated declustering scheme that decides both on the data items to be replicated and the assignment of all data items to disks ...
In this technique, query retrieval process is parallelized by distributing the data among several disks and it is use- ful in applications such as geographic ...
In this paper, we explore replicated declustering for arbitrary queries. Replication reduces the cost of arbitrary queries to manageable levels. First, we ...
Abstract. Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process.
In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in applications such as geographic ...
In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in applications such as geographic ...
Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized.
Given a query Q, if all the buckets in Q are replicated buckets then we can think of Q as an arbitrary query from a full orthogonal disk allocation. Worst case ...
Missing: Selective | Show results with:Selective
We utilize existing query-log information to propose a selective replicated declustering scheme, in which we select the data items to be replicated and decide ...
Query-Log Aware Replicated Declustering. Data declustering and replication can be used to reduce I/O times related with processing of data intensive queries.