We present a dynamic modelization of a database when submitted to a sequence of queries and updates, that allows us to study the evolution of the sizes of relations. While the problem of estimating the sizes of derived relations at a given time (“static” case) has been the subject of several studies, to the best of our knowledge the evolution of the relation sizes under queries and updates (“dynamic” cases) has not been studied so far. We consider the size of a relation as a random variable, and we study its probability distribution when the database is submitted to a sequence of insertions, deletions and queries. We show that it behaves asymptotically as a Gaussian process, whose expectation and covariance are proportional to the time. Thi...
Whenever a database is changed, any previously computed and stored result of a query evaluation on t...
© Copyright 2014 Association for the Advancement of Artificial Intelligence. All rights reserved. Ov...
yannisQcs.wise.edu Query optimizers of current relational database systems use several statistics ma...
AbstractWe present a dynamic modelization of a relational database, when submitted to a sequence of ...
We present a dynamic modelization of a relational database, when submitted to a sequence of queries ...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
AbstractThis paper analyzes the average behaviour of algorithms that operate on dynamically varying ...
AbstractWe study some parameters of relational databases (sizes of relations obtained by a join) tha...
By dynamic algorithms, we mean algorithms that operate on dynamically varying data structures (dicti...
International audienceWe present a (non-standard) probabilistic analysis of dynamic data structures ...
AbstractPractical database applications give the impression that sets of constraints are rather smal...
Abstract. We propose a framework in which query sizes can be es-timated from arbitrary statistical a...
Abstract Much of the existing work in machine learning and data mining has relied on devising effici...
Abstract. This paper develops two probabilistic methods that allow the analysis of the maximum data ...
Authors and affiliations omitted Most current work on data mining has been focused on devising effic...
Whenever a database is changed, any previously computed and stored result of a query evaluation on t...
© Copyright 2014 Association for the Advancement of Artificial Intelligence. All rights reserved. Ov...
yannisQcs.wise.edu Query optimizers of current relational database systems use several statistics ma...
AbstractWe present a dynamic modelization of a relational database, when submitted to a sequence of ...
We present a dynamic modelization of a relational database, when submitted to a sequence of queries ...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
AbstractThis paper analyzes the average behaviour of algorithms that operate on dynamically varying ...
AbstractWe study some parameters of relational databases (sizes of relations obtained by a join) tha...
By dynamic algorithms, we mean algorithms that operate on dynamically varying data structures (dicti...
International audienceWe present a (non-standard) probabilistic analysis of dynamic data structures ...
AbstractPractical database applications give the impression that sets of constraints are rather smal...
Abstract. We propose a framework in which query sizes can be es-timated from arbitrary statistical a...
Abstract Much of the existing work in machine learning and data mining has relied on devising effici...
Abstract. This paper develops two probabilistic methods that allow the analysis of the maximum data ...
Authors and affiliations omitted Most current work on data mining has been focused on devising effic...
Whenever a database is changed, any previously computed and stored result of a query evaluation on t...
© Copyright 2014 Association for the Advancement of Artificial Intelligence. All rights reserved. Ov...
yannisQcs.wise.edu Query optimizers of current relational database systems use several statistics ma...