Journal of Central South University

, Volume 21, Issue 1, pp 190–198 | Cite as

An adaptive range-query optimization technique with distributed replicas

Article

Abstract

Replication is an approach often used to speed up the execution of queries submitted to a large dataset. A compile-time/run-time approach is presented for minimizing the response time of 2-dimensional range when a distributed replica of a dataset exists. The aim is to partition the query payload (and its range) into subsets and distribute those to the replica nodes in a way that minimizes a client’s response time. However, since query size and distribution characteristics of data (data dense/sparse regions) in varying ranges are not known a priori, performing efficient load balancing and parallel processing over the unpredictable workload is difficult. A technique based on the creation and manipulation of dynamic spatial indexes for query payload estimation in distributed queries was proposed. The effectiveness of this technique was demonstrated on queries for analysis of archived earthquake-generated seismic data records.

Key words

distributed systems load balancing range query query optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    TANENBAUM A S, van STEEN M. Distributed systems: Principles and paradigms prentice hall upper saddle river [M]. 2nd ed. Upper Saddle river, USA: 2006: 704.Google Scholar
  2. [2]
    CHEN C M, CHENG C T. Replication and retrieval strategies of multidimensional data on parallel disks [C]// CIKM’ 03 Proceedings of the Twelfth International Conference on Information and Knowledge Management. New York, NY, USA: ACM Press, 2003: 32–39.CrossRefGoogle Scholar
  3. [3]
    CHERVENAK A, DEELMAN E, FOSTER I, GUY L, HOSCHEK W, IAMNITCHI A, KESSELMAN C, KUNSZT P, RIPEANU M, SCHWARTZKOPF B, STOCKINGER H, STOCKINGER K, TIERNEY B. Giggle: A framework for constructing scalable replica location supercomputing [C]// ACM/IEEE 2002 Conference. Baltimore, USA: IEEE Computer Society Press, 2002: 1–17.Google Scholar
  4. [4]
    GANESAN P, BAWA M, GARCIA-MOLINA H. Online balancing of range-partitioned data with applications to peer-to-peer systemsvery large database (VLDB) [C]// Proceedings fo the 30th International Conference on Very Large Data Bases. Toronto, Canada: Morgan Kaufmam, 2004: 444–455.Google Scholar
  5. [5]
    WENG L, CATALYUREK U, KURC T, AGRAWAL G, SALTZ J. Servicing range queries on multidimensional datasets with partial replicas IEEE international symposium on cluster computing and the grid [C]// CCGrid 2005. Cardiff, UK: IEEE, 2005: 726–733.Google Scholar
  6. [6]
    BEYNON M, CHANG C, CATALYUREK U, KURC T, SUSSMAN A, ANDRADE H, FERREIRA R, SALTZ J. Processing large-scale multi-dimensional data in parallel and distributed environments [J]. Parallel Computing-Parallel Data-Intensive Algorithms and Applications, 2002, 28(5): 827–859.Google Scholar
  7. [7]
    DEWITT D, GRAY J. Parallel database systems: The future of high performance database systems [J]. ACM Communications, 1992, 35(6): 85–98.CrossRefGoogle Scholar
  8. [8]
    CHAKKA V P, EVERSPAUGH A, PATEL J M. Indexing large trajectory data sets with SETI [C]// Conference on Innovative Data Systems Research (CIDR-2003). CA, USA: VLDB, 2003: 281–291.Google Scholar
  9. [9]
    MAUROUX C P, WU E, MADDEN S. TrajStore: An adaptive storage system for very large trajectory data sets [C]// IEEE 26th International Conference on Data Engineering (ICDE). Long Beach, CA: IEEE Press, 2010: 109–120.Google Scholar
  10. [10]
    JOEL B M, SALTZ J H. Scalability analysis of declustering methods for multidimensional range queries [J]. IEEE Transactions on Knowledge and Data Engineering, 1998, 10(2): 310–327.CrossRefGoogle Scholar
  11. [11]
    BENTLEY J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975, 18(9): 509–517.CrossRefMATHMathSciNetGoogle Scholar
  12. [12]
    FILHO Y S. Avarage case analysis of region search in balanced k-d trees [J]. Information Processing Letters, 1979, 8(5): 219–223.CrossRefMATHMathSciNetGoogle Scholar
  13. [13]
    TANENBAUM A S. Modern operating systems [M]. New Jersey, USA: Pearson Prentice Hall, 2008.Google Scholar
  14. [14]
    SAYAR A, PIERCE M, FOX G. Developing GIS visualization web services for geophysical applications [C]// Turkey: ISPRS Spatial Data Mining Workshop Ankara, 2005.Google Scholar
  15. [15]
    SAYAR Ahmet, PIERCE Marlon, FOX Geoffrey-Charles. Grid technology for maximizing collaborative decision management and support: Advancing effective virtual organizations [M]. Bedfordshire, UK: IGI Global-Information Science Reference, 2009: 360–368.Google Scholar
  16. [16]
    AYDIN G, SAYAR A, GADGIL H, AKTAS M S, FOX G C, KO S, BULUT H, PIERCE M E. Building and applying geographical information systems grids [J]. Concurrency and Computation: Practice and Experience, 2008, 20(14): 1653–1695.CrossRefGoogle Scholar
  17. [17]
    VRETANOS P A. Web Feature Service Implementation Specification [EB/OL]. 2002-11-02.Google Scholar
  18. [18]
    BEAUJARDIERE J. OGC Web Map Service Interface [EB/OL]. Open GIS Consortium Inc. (OGC), 2006-03-15.Google Scholar

Copyright information

© Central South University Press and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Sayar Ahmet
    • 1
  • Pierce Marlon
    • 2
  • Fox C. Geoffrey
    • 2
    • 3
    • 4
  1. 1.Department of Computer EngineeringKocaeli UniversityKocaeliTurkey
  2. 2.Department of Computer ScienceIndiana UniversityBloomingtonUSA
  3. 3.Community Grids LabIndiana UniversityBloomingtonUSA
  4. 4.School of Informatics and ComputingIndiana UniversityBloomingtonUSA

Personalised recommendations