Selective Replicated Declustering for Arbitrary Queries

  • K. Yasin Oktay
  • Ata Turk
  • Cevdet Aykanat
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5704)


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.


Data Item Range Query Replication Scheme Query Frequency Large Data Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tosun, A.S.: Threshold-based declustering. Information Sciences 177(5), 1309–1331 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Koyuturk, M., Aykanat, C.: Iterative-improvement-based declustering heuristics for multi-disk databases. Information Systems 30, 47–70 (2005)CrossRefGoogle Scholar
  3. 3.
    Liu, D.R., Shekhar, S.: Partitioning similarity graphs: a framework for declustering problems. Information Systems 21, 475–496 (1996)CrossRefGoogle Scholar
  4. 4.
    Liu, D.R., Wu, M.Y.: A hypergraph based approach to declustering problems. Distributed and Parallel Databases 10(3), 269–288 (2001)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Ozdal, M.M., Aykanat, C.: Hypergraph models and algorithms for data-pattern-based clustering. Data Mining and Knowledge Discovery 9, 29–57 (2004)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Demir, E., Aykanat, C., Cambazoglu, B.B.: A link-based storage scheme for efficient aggregate query processing on clustered road networks. Information Systems (2009), doi:10.1016/ Scholar
  7. 7.
    Demir, E., Aykanat, C., Cambazoglu, B.B.: Clustering spatial networks for aggregate query processing: A hypergraph approach. Information Systems 33(1), 1–17 (2008)CrossRefGoogle Scholar
  8. 8.
    Tosun, A.S.: Analysis and comparison of replicated declustering schemes. IEEE Trans. Parallel Distributed Systems 18(11), 1587–1591 (2007)Google Scholar
  9. 9.
    Sanders, P., Egner, S., Korst, K.: Fast concurrent access to parallel disks. In: Proc. 11th ACM-SIAM Symp. Discrete Algorithms, pp. 849–858 (2000)Google Scholar
  10. 10.
    Tosun, A.S.: Replicated declustering for arbitrary queries. In: Proc. 19th ACM Symp. Applied Computing, pp. 748–753 (2004)Google Scholar
  11. 11.
    Tosun, A.S.: Design theoretic approach to replicated declustering. In: Proc. Int’l Conf. Information Technology Coding and Computing, pp. 226–231 (2005)Google Scholar
  12. 12.
    Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proc. of the 19th ACM/IEEE Design Automation Conference, pp. 175–181 (1982)Google Scholar
  13. 13.
    Chen, L.T., Rotem, D.: Optimal response time retrieval of replicated data. In: Proc. 13th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, pp. 36–44 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • K. Yasin Oktay
    • 1
  • Ata Turk
    • 1
  • Cevdet Aykanat
    • 1
  1. 1.Department of Computer EngineeringBilkent UniversityAnkaraTurkey

Personalised recommendations