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

Rule-based parallel query optimization for OQL using a parallelism extraction technique

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)
Mendes, S.F. ; Dept. de Comput., Univ. Fed. do Ceara, Fortaleza, Brazil ; Sampaio, P.R.F.

This work deals with query optimization far parallel object-oriented databases using rule-based optimizers. The solution enacted departs from an existing non-parallel database query optimizer and extends it with a parallelism extraction module that modifies the original query optimizer to generate query plans for a parallel OODBMS architecture. The ideas are applied in the design of a parallel optimizer for OQL. The implementation approach shows that the parallelism extraction technique combined with a rule-based optimizer generator tool can help to produce a parallel optimizer from a non-parallel one with minimum effort

Published in:

Database and Expert Systems Applications, 1998. Proceedings. Ninth International Workshop on

Date of Conference:

25-28 Aug 1998

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.