Thumbnail
Access Restriction
Subscribed

Author Wolf, J.L. ♦ Iyer, B.R. ♦ Pattipati, K.R. ♦ Turek, J.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1991
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Partitioning algorithms ♦ Resource management ♦ Prototypes ♦ Systems engineering and theory ♦ Size measurement ♦ Heuristic algorithms ♦ Optimization methods ♦ Dynamic programming ♦ Greedy algorithms ♦ Query processing
Abstract An efficient, exact algorithm is developed for optimizing the performance of nested block joins. The method uses both dynamic programming and branch-and-bound. In the process of deriving the algorithm, the class of resource allocation problems for which the greedy algorithm applies has been extended. Experiments with this algorithm on extremely large problems show that it is superior to all other known algorithms by a wide margin.<<ETX>>
Description Author affiliation: IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA (Wolf, J.L.)
ISBN 0818621389
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1991-04-08
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 814.29 kB
Page Count 10
Starting Page 510
Ending Page 519


Source: IEEE Xplore Digital Library