Cart (Loading....) | Create Account
Close category search window

How to achieve SQL in approximate divide and exact relation division by Relational algebra

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

2 Author(s)
Qian, Shao ; Dept. of Comput. Sci. Inst., Coll. of Traffic Manage. Cadres, Beijing, China ; Yili Lu

Relational algebra is the basis of relational database theory, however, SQL is a concrete realization of the standard computer language. Particularly, the division problem in Relational algebra, in many circumstances, it's just a form of the abstract theory. By taking a further step of analyzing relational algebra, it will be devided into two parts: approximate divide and exact relation division, the paper will achieve SQL in approximate divide and exact relation division by Relational algebra.

Published in:

Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on  (Volume:4 )

Date of Conference:

26-28 Feb. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.