Efficient provenance storage for relational queries

  • Authors:

  • Zhifeng Bao;Henning Köhler;Liwei Wang;Xiaofang Zhou;Shazia Sadiq

  • Affiliations:

  • National University of Singapore, Singapore, Singapore;University of Queensland, Brisbane, Australia;Wuhan University, Wuhan, China;University of Queensland, Brisbane, Australia;University of Queensland, Brisbane, Australia

  • Venue:
  • Proceedings of the 21st ACM international conference on Information and knowledge management
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Provenance information is vital in many application areas as it helps explain data lineage and derivation. However, storing fine-grained provenance information can be expensive. In this paper, we present a framework for storing provenance information relating to data derived via database queries. In particular, we first propose a provenance tree data structure which matches the query structure and thereby presents a possibility to avoid redundant storage of information regarding the derivation process. Then we investigate two approaches for reducing storage costs. The first approach utilizes two ingenious rules to achieve reduction on provenance trees. The second one is a dynamic programming solution, which provides a way of optimizing the selection of query tree nodes where provenance information should be stored. The optimization algorithm runs in polynomial time in the query size and is linear in the size of the provenance information, thus enabling provenance tracking and optimization without incurring large overheads. Experiments show that our approaches guarantee significantly lower storage costs than existing approaches.