By Topic

Storage and access in relational data bases

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

Using the observations in this paper, a query translator could operate in the following manner. From the available access paths, determine the applicable methods and cases, eliminate any obviously bad methods, discard any methods that fail to pass certain simple tests (such as, for example, F1 < l/E1) , and then evaluate the cost estimates for the remaining methods. Choose the method with minimum cost. A query evaluator based on these principles of simple analytic calculations and numeric cost computations could be part of relational data base query systems or other system that uses indexes. A complete model to analyze the cost of various methods that apply to any given situation has been implemented in APL. The time to analyze a particular situation is of the order of a few milliseconds.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:16 ,  Issue: 4 )