Computing Query Previews in the Flamenco System

Kevin Chen

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-04-1303

2004

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/Archive/CSD-04-1303.pdf

The Flamenco system is a web search interface that allows users to browse through large data sets using predefined hierarchical faceted metadata. It is built on top of a conventional relational database and currently scales to collections of several tens of thousands of items. In the current implementation, the system translates each user query into multiple SQL group-by commands in order to obtain query preview information for possible future queries. These group-by's take up a significant fraction of the query processing time. In this note, we describe an optimization that allows us to speed up the group-by computations dramatically. Our ideas have some similarity to the work of Beyer and Ramakrishnan on computing iceberg data cubes.

BibTeX citation:

@techreport{Chen:CSD-04-1303,
    Author= {Chen, Kevin},
    Title= {Computing Query Previews in the Flamenco System},
    Year= {2004},
    Month= {Jan},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/5369.html},
    Number= {UCB/CSD-04-1303},
    Abstract= {The Flamenco system is a web search interface that allows users to browse through large data sets using predefined hierarchical faceted metadata. It is built on top of a conventional relational database and currently scales to collections of several tens of thousands of items. In the current implementation, the system translates each user query into multiple SQL group-by commands in order to obtain query preview information for possible future queries. These group-by's take up a significant fraction of the query processing time. In this note, we describe an optimization that allows us to speed up the group-by computations dramatically. Our ideas have some similarity to the work of Beyer and Ramakrishnan on computing iceberg data cubes.},
}

EndNote citation:

%0 Report
%A Chen, Kevin 
%T Computing Query Previews in the Flamenco System
%I EECS Department, University of California, Berkeley
%D 2004
%@ UCB/CSD-04-1303
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/5369.html
%F Chen:CSD-04-1303