Welcome to the InfoSci Platform
Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation

Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation

Ashish Ranjan Mishra, Neelendra Badal
Copyright: © 2020 |Pages: 25
ISBN13: 9781799824916|ISBN10: 1799824918|ISBN13 Softcover: 9781799824923|EISBN13: 9781799824930
DOI: 10.4018/978-1-7998-2491-6.ch003
Cite Chapter Cite Chapter

MLA

Mishra, Ashish Ranjan, and Neelendra Badal. "Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation." Handling Priority Inversion in Time-Constrained Distributed Databases, edited by Udai Shanker and Sarvesh Pandey, IGI Global, 2020, pp. 36-60. https://doi.org/10.4018/978-1-7998-2491-6.ch003

APA

Mishra, A. R. & Badal, N. (2020). Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation. In U. Shanker & S. Pandey (Eds.), Handling Priority Inversion in Time-Constrained Distributed Databases (pp. 36-60). IGI Global. https://doi.org/10.4018/978-1-7998-2491-6.ch003

Chicago

Mishra, Ashish Ranjan, and Neelendra Badal. "Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation." In Handling Priority Inversion in Time-Constrained Distributed Databases, edited by Udai Shanker and Sarvesh Pandey, 36-60. Hershey, PA: IGI Global, 2020. https://doi.org/10.4018/978-1-7998-2491-6.ch003

Export Reference

Mendeley
Favorite

Abstract

This chapter explains an algorithm that can perform vertical partitioning of database tables dynamically on distributed database systems. After vertical partitioning, a new algorithm is developed to allocate that fragments to the proper sites. To accomplish this, three major tasks are performed in this chapter. The first task is to develop a partitioning algorithm, which can partition the relation in such a way that it would perform better than most of the existing algorithms. The second task is to allocate the fragments to the appropriate sites where allocating the fragments will incur low communication cost with respect to other sites. The third task is to monitor the change in frequency of queries at different sites as well as same site. If the change in frequency of queries at different sites as well as the same site exceeds the threshold, the re-partitioning and re-allocation are performed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.