City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Information Systems  >
IS - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: A genetic programming approach to query optimization in distributed database systems
Other Titles: Yi ji yin gui hua chu li fen bu shu ju ku zhong di cha xun you hua
Authors: Cheung, Siu King (張少琼)
Department: Dept. of Information Systems
Degree: Master of Philosophy
Issue Date: 1997
Publisher: City University of Hong Kong
Subjects: Distributed databases
Genetic programming (Computer science)
Notes: Bibliography: leaves 75-80.
CityU Call Number: QA76.9.D5 C45 1997
Thesis (M.Phil.)--City University of Hong Kong, 1997
v, 81 leaves : ill. ; 30 cm.
Type: Thesis
Abstract: With the emergence of relatively inexpensive and advanced communication technology, Distributed Database Management Systems (DDBMS) have become an integral part of many computer applications. Efficient query processing is one of the most important issues in distributed database systems since accessing data in a decentralized database system differs very much from accessing data in a centralized system. In a distributed environment, it is common that queries extract data from different sites, whereas it is not necessary in the centralized case. It is important to limit the amount of data transfer across different sites in a distributed system. Semijoin is a way to reduce the cost of expensive joins between various sites. A key issue in query processing based on semijoin reduction is to find a good sequence of semijoins. Many algorithms for this purpose have been developed, of which the A* algorithm is one of the better known heuristic search techniques. This thesis proposes a new approach, based on Genetic Programming (GP), to improve the process of database query in Distributed Database Systems. Genetic Programming, which contains a probabilistic element, mimics Darwinian evolution to tackle search problems. We give a comprehensive description of how GP can be applied to perform the search of an optimal and/or suboptimal sequence of semijoins. Also, we describe the design of a simulation experiment to confirm the success of using GP in the search problem. The results are then compared with that of four other established methods, namely, exhaustive search, random search, greedy algorithms, and A* algorithm.
Online Catalog Link:
Appears in Collections:IS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer