Selective replicated declustering for arbitrary queries
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
375 - 386
Item Usage Stats
MetadataShow full item record
Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in applications such as geographic information systems that access huge amounts of data. Declustering with replication is an extension of declustering with possible data replicas in the system. Many replicated declustering schemes have been proposed. Most of these schemes generate two or more copies of all data items. However, some applications have very large data sizes and even having two copies of all data items may not be feasible. In such systems selective replication is a necessity. Furthermore, existing replication schemes are not designed to utilize query distribution information if such information is available. 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 when there is limited replication capacity. We make use of available query information in order to decide replication and partitioning of the data and try to optimize aggregate parallel response time. We propose and implement a Fiduccia-Mattheyses-like iterative improvement algorithm to obtain a two-way replicated declustering and use this algorithm in a recursive framework to generate a multi-way replicated declustering. Experiments conducted with arbitrary queries on real datasets show that, especially for low replication constraints, the proposed scheme yields better performance results compared to existing replicated declustering schemes. © 2009 Springer.
Real data sets
Very large datum
Disks (machine components)
Disks (structural components)
Distributed computer systems
Geographic information systems
Response time (computer systems)
Published Version (Please cite this version)http://dx.doi.org/10.1007/978-3-642-03869-3_37
Showing items related by title, author, creator and subject.
Şaykol, E.; Güdükbay U.; Ulusoy, Ö. (Elsevier, 2005)Considering the fact that querying by low-level object features is essential in image and video data, an efficient approach for querying and retrieval by shape and color is proposed. The approach employs three specialized ...
Static index pruning in web search engines: combining term and document popularities with query views Altingovde, I. S.; Ozcan, R.; Ulusoy, O. (Association for Computing Machinery, 2012)Static index pruning techniques permanently remove a presumably redundant part of an inverted file, to reduce the file size and query processing time. These techniques differ in deciding which parts of an index can be ...
Calisir F.; Bastan, M.; Gudukbay, U.; Ulusoy O. (Institute of Electrical and Electronics Engineers Inc., 2015)Recent advances in mobile device technology have turned the mobile phones into powerfull devices with high resolution cameras and fast processing capabilities. Having more user interaction potential compared to regular ...