By Topic

An extension of a relational query language to capture more information from objects with many-many relationships

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jorng-Tzong Horng ; Inst. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Gwo-Dong Chen ; Cheng-Yan Kao ; Baw-Jhiune Liu

The focus of this paper is the application of genetic concepts to database query optimization. Many decision support applications, such as task assignment, truck deliveries, and airline crew scheduling problems, usually need to get information from objects with a many-many relationship. However, current relational operators including the complete set of relational algebra and other relational operators are difficult to set the required information from objects with a many-many relationship. In this paper, we extend SQL so that users can capture more information from objects with a many-many relationship by using the query language directly. The relational operators were extended. Some of these operators may take a very long time to find an optimal solution. Genetic algorithms are developed to find the near-optimal solution of this kind of operators. The computational effort involved in the algorithms is bounded by a polynomial time

Published in:

Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on  (Volume:2 )

Date of Conference:

2-5 Oct 1994