Thumbnail
Access Restriction
Open

Author Cluet, Sophie ♦ Moerkotte, Guido
Source CiteSeerX
Content type Text
Publisher Springer-Verlag
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword General Bulk Type ♦ Traditional Query Evaluation Strategy ♦ Efficient Evaluation ♦ Bulk Type ♦ Aggregate Query ♦ General Require ♦ Linear Space ♦ Aggregate Function ♦ Input Relation ♦ New Method
Description In Proc. Int. Workshop on Database Programming Languages
A new method for efficiently evaluating queries with aggregate functions is presented. More specifically, we introduce a class of aggregate queries where traditional query evaluation strategies in general require O(n ) time and space in the size of the (at most two) input relations. For this class of aggregate queries our approach needs at most O(n log n) time and linear space. Further, our approach deals not only with relations but with general bulk types like sets, bags, and lists.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1995-01-01