Efficient integrity checking for databases with recursive views

  • Authors:
  • Davide Martinenghi;Henning Christiansen

  • Affiliations:
  • Computer Science Dept., Roskilde University, Roskilde, Denmark;Computer Science Dept., Roskilde University, Roskilde, Denmark

  • Venue:
  • ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some attention in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints into incremental and optimized tests specialized for given update patterns. These tests may involve the introduction of new views, but for relevant cases of recursion, simplified integrity constraints are obtained that can be checked more efficiently than the original ones and without auxiliary views. Notably, these simplified tests are derived at design time and can be executed before the particular database update is made and without simulating the updated state. In this way all overhead due to optimization or execution of compensative actions at run time is avoided. It is argued that, in the recursive case, earlier approaches have not achieved comparable optimization with the same level of generality.