Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks
Databases
2011-09-29 v1
Abstract
We present sensitivity analysis for results of query executions in a relational model of data extended by ordinal ranks. The underlying model of data results from the ordinary Codd's model of data in which we consider ordinal ranks of tuples in data tables expressing degrees to which tuples match queries. In this setting, we show that ranks assigned to tuples are insensitive to small changes, i.e., small changes in the input data do not yield large changes in the results of queries.
Keywords
Cite
@article{arxiv.1109.6299,
title = {Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks},
author = {Radim Belohlavek and Lucie Urbanova and Vilem Vychodil},
journal= {arXiv preprint arXiv:1109.6299},
year = {2011}
}
Comments
The paper will appear in Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)