Sensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks

详细信息    查看全文

• 作者：Radim Belohlavek (11)
  Lucie Urbanova (11)
  Vilem Vychodil (11)
  
• 关键词：Declarative query languages ; Ordinal ranks ; Relational databases ; Residuated lattices
• 刊名：Lecture Notes in Computer Science
• 出版年：2013
• 出版时间：2013
• 年：2013
• 卷：1
• 期：1
• 页码：77-92
• 全文大小：356KB
• 作者单位：Radim Belohlavek (11)
  Lucie Urbanova (11)
  Vilem Vychodil (11)
  
  11. DAMOL (Data Analysis and Modeling Laboratory), Department of Computer Science, Palacky University, Olomouc 17. listopadu 12, CZ–77146, Olomouc, Czech Republic
  
• ISSN：1611-3349

文摘

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.