Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin1044894428.pdf (1.11 MB)

ETD Abstract Container

Abstract Header

DESIGN OF DECOMPOSABLE ALGORITHMS FOR DISTRIBUTED DATABASES

KHEDR, AHMED MOHAMED
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1044894428

Abstract Details

2003, PhD, University of Cincinnati, Engineering : Computer Science and Engineering.
Most computer algorithms have been designed for situations in which all relevant data is stored at a single Computer site. This is the classical model of a computer based information and control system. The emerging networked knowledge environment requires a significant move away from this classical model. In these situations of geographically distributed but networked systems, the data relevant for a computation may exist in a number of different databases residing at different network sites. An efficient system for computations with such distributed data would work by doing as much work at local sitesas possible and then communicating minimum required information among the sites. This is much more efficient than transferring the complete databases to a single site, Join these databases, and then execute algorithms with this data. A common constraint in these situations is that the databases cannot be moved to other network sites due to data-security, size, privacy or data-ownership considerations. Also, for some huge databases it may not be feasible to store and compute with them at one computer site. A number of partitions of this database may be stored at different sites and a set of cooperative algorithms run across the network that produce exactly the same results that would have been obtained if the database were processed at some single site. In this dissertation we present the results of development, validation, implementation and complexity analysis of the decomposable versions of a number of algorithms. Specifically, decomposable algorithms for following tasks have been investigated: finding a path between two vertices , computing the shortest paths spanning tree and the minimum spanning tree for a graph stored as components across various sites of a networks, non-hierarchical clustering in horizontally and vertically partitioned datasets across a number of geographically distributed databases. The main objective of our algorithms is their self-decomposability for any way in which the graph or the data may be distributed across the sites of a network. Another objective is to perform the tasks by minimizing the number of messages exchanged among the participating sites.
Dr. Raj Bhatnagar (Advisor)
163 p.
Computer Science
decomposable algorithm; distributed database; clustering; graph

Recommended Citations

Citations

  • KHEDR, A. M. (2003). DESIGN OF DECOMPOSABLE ALGORITHMS FOR DISTRIBUTED DATABASES [Doctoral dissertation, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1044894428

    APA Style (7th edition)

  • KHEDR, AHMED. DESIGN OF DECOMPOSABLE ALGORITHMS FOR DISTRIBUTED DATABASES. 2003. University of Cincinnati, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1044894428.

    MLA Style (8th edition)

  • KHEDR, AHMED. "DESIGN OF DECOMPOSABLE ALGORITHMS FOR DISTRIBUTED DATABASES." Doctoral dissertation, University of Cincinnati, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1044894428

    Chicago Manual of Style (17th edition)

ucin1044894428
1,220
© 2003, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.