Efficient lineage for SUM aggregate queries

DOI10.3233/AIC-140647MaRDI QIDQ4589119zbMATH OpenOpenAlexFDO

Authors Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.2990

zbMATH Keywords

artificial intelligencedatabasesrandomised algorithmsaggregate queriesquery approximationdatabase lineage

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20) Database theory (68P15)

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.

Recommendations

• Efficient inference control for range SUM queries
• An efficient algorithm for solving the partial sum query problem
• Progressive evaluation of nested aggregate queries
• scientific article; zbMATH DE number 2080616
• On the equivalence and rewriting of aggregate queries
• scientific article; zbMATH DE number 1953127

This page was built for publication: Efficient lineage for SUM aggregate queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589119)