Aggregate Queries on Sparse Databases

by   Szymon Toruńczyk, et al.

We propose an algebraic framework for studying efficient algorithms for query evaluation, aggregation, enumeration, and maintenance under updates, on sparse databases. Our framework allows to treat those problems in a unified way, by considering various semirings, depending on the considered problem. As a concrete application, we propose a powerful query language extending first-order logic by aggregation in multiple semirings. We obtain an optimal algorithm for computing the answers of such queries on sparse databases. More precisely, given a database from a fixed class with bounded expansion, the algorithm computes in linear time a data structure which allows to enumerate the set of answers to the query, with constant delay between two outputs.



page 1

page 2

page 3

page 4


Enumerating Answers to First-Order Queries over Databases of Low Degree

A class of relational databases has low degree if for all δ>0, all but f...

Dependency Weighted Aggregation on Factorized Databases

We study a new class of aggregation problems, called dependency weighted...

Social Choice Methods for Database Aggregation

Knowledge can be represented compactly in multiple ways, from a set of p...

vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases

Blockchains have recently been under the spotlight due to the boom of cr...

Aggregate Analytic Window Query over Spatial Data

Analytic window query is a commonly used query in the relational databas...

Consistent Answers of Aggregation Queries using SAT Solvers

The framework of database repairs and consistent answers to queries is a...

Prolog as a Querying Language for MongoDB

Today's database systems have shown to be capable of supporting AI appli...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.