By Topic

Natural joins in relational databases with indefinite and maybe information

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
$31 $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

1 Author(s)
Liu, K.-C. ; Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL

Natural joins are defined, in a semantically correct way, on data structures, called I-tables, of an extended relational database model with indefinite and maybe information. An algorithm for computing natural joins under the extended model is proposed which reduces the number of pair-up operations and block accesses to a linear order of complexity with respect to the size of I-tables. Procedures for the extended natural joins are examined with respect to efficiency, which is evaluated based upon the number of pair-up operations and I/O block accesses. A linear order of pair-up operations is achieved by using the `compare, concatenate, and then permute' strategy, and a linear order of I/O activities is attained by employing virtual relations with pointers

Published in:

Data Engineering, 1991. Proceedings. Seventh International Conference on

Date of Conference:

8-12 Apr 1991