Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimal histograms for limiting worst-case error propagation in the size of join results

Optimal histograms for limiting worst-case error propagation in the size of join results Optimal Histograms for Limiting Worst-Case Error Propagation in the Size of Join Results YANNIS University E, IOANNIDIS of Wisconsin and STAVROS Technical CHRISTODOULAKIS University of Crete Many result serial because queries joins show query optimal current relational database of values systems in the use that some exist form of histograms and on this to basis approximate estimate the the query directly class of frequency distribution affect and function optimal serial. attributes derived of relations database systems. is joined sizes and access plan many its histograms such without that the costs. The errors estimates subclass in the histogram system. the latter on the error optimal we prove form approximations We identify is of particular same attribute(s) t-cllque result (all or transitively by the database relation the of end-btased in several where queries with each histograms; interest join for all We a are the histograms are used symbols Join queries histogram For We concentrate are called in the serial that symbols on equality queries. of which and in which is always it participates. of this one join restricted worst-case and type for reducing results query size of such no function the vacuously of values with the into histograms) values buckets http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Database Systems (TODS) Association for Computing Machinery

Optimal histograms for limiting worst-case error propagation in the size of join results

Download PDF
40 pages

Loading next page...
 
/lp/association-for-computing-machinery/optimal-histograms-for-limiting-worst-case-error-propagation-in-the-d7HWybcl9q

References (19)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1993 by ACM Inc.
ISSN
0362-5915
DOI
10.1145/169725.169708
Publisher site
See Article on Publisher Site

Abstract

Optimal Histograms for Limiting Worst-Case Error Propagation in the Size of Join Results YANNIS University E, IOANNIDIS of Wisconsin and STAVROS Technical CHRISTODOULAKIS University of Crete Many result serial because queries joins show query optimal current relational database of values systems in the use that some exist form of histograms and on this to basis approximate estimate the the query directly class of frequency distribution affect and function optimal serial. attributes derived of relations database systems. is joined sizes and access plan many its histograms such without that the costs. The errors estimates subclass in the histogram system. the latter on the error optimal we prove form approximations We identify is of particular same attribute(s) t-cllque result (all or transitively by the database relation the of end-btased in several where queries with each histograms; interest join for all We a are the histograms are used symbols Join queries histogram For We concentrate are called in the serial that symbols on equality queries. of which and in which is always it participates. of this one join restricted worst-case and type for reducing results query size of such no function the vacuously of values with the into histograms) values buckets

Journal

ACM Transactions on Database Systems (TODS) – Association for Computing Machinery

Published: Dec 1, 1993

There are no references for this article.