Efficient Evaluation of Aggregates on Bulk Types | Zendy

Sophie Cluet | Zendy; Guido Moerkotte | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Evaluation of Aggregates on Bulk Types

Author(s) -

Sophie Cluet,

Guido Moerkotte

Publication year - 1995

Publication title -

electronic workshops in computing

Language(s) - English

Resource type - Conference proceedings

ISSN - 1477-9358

DOI - 10.14236/ewic/dbpl1995.6

Subject(s) - aggregate (composite) , class (philosophy) , computer science , space (punctuation) , theoretical computer science , data mining , artificial intelligence , composite material , operating system , materials science

A new method for eeciently evaluating queries with aggregate functions is presented. More specii-cally, we introduce a class of aggregate queries where traditional query evaluation strategies in general require O(n 2) 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research