By Topic

Query processing in multidatabase systems

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)
Scheuermann, P. ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA ; Chong, E.I.

A novel algorithm to efficiently process a query in a multidatabase environment is devised. The proposed approach reduces data movement between sites and local processing time by allowing local selection and projection for a user query. Also, the algorithm efficiently removes null values incurred due to an outer join by generating the results as a set of sets, gives users more accurate information by presenting all data values for an overlap part, and gives users flexibility by enabling them to define their own processing strategy at a query time

Published in:

Systems, Man and Cybernetics, 1992., IEEE International Conference on

Date of Conference:

18-21 Oct 1992