By Topic

A well-intentioned query and the Halloween Problem

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

1 Author(s)
Fitzpatrick, A. ; Los Alamos Nat. Lab., NM

The author's description of the Halloween Problem demonstrates the role of cautionary tales in the history of computing. The Halloween Problem emerged in the context of structured query language optimization in relational database research. Normally, a query optimizer works by measuring system calls and paging requests and applying heuristics to the entire access path tree. Query optimization was one of the most challenging tasks facing System R researchers at IBM. These experiments with query optimization form the milieu in which the Halloween Problem emerged

Published in:

Annals of the History of Computing, IEEE  (Volume:24 ,  Issue: 2 )