Efficient lineage for SUM aggregate queries

Article type: Research Article

Authors: Afrati, Foto N. | Fotakis, Dimitris | Vasilakopoulos, Angelos^{; *}

Affiliations: School of Electrical and Computer Engineering, National Technical University of Athens, 15780 Athens, Greece

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: AI systems typically make decisions and find patterns in data based on the computation of aggregate and specifically sum functions, expressed as queries, on data’s attributes. This computation can become costly or even inefficient when these queries concern the whole or big parts of the data and especially when we are dealing with big data. New types of intelligent analytics require also the explanation of why something happened. In this paper we present a randomised algorithm that constructs a small summary of the data, called Aggregate Lineage, which can approximate well and explain all sums with large values in time that depends only on its size. The size of Aggregate Lineage is practically independent on the size of the original data. Our algorithm does not assume any knowledge on the set of sum queries to be approximated.

Keywords: Artificial intelligence, databases, aggregate queries, database lineage, query approximation, randomised algorithms

DOI: 10.3233/AIC-140647

Journal: AI Communications, vol. 28, no. 4, pp. 655-663, 2015