Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks

Details Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks

2011-09-28

arxiv.org/abs/1109.6299v1

Computer Science

Databases

The paper will appear in Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowl

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44500