Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A Decidable Case of Query Determinacy: Project-Select Views

Wen Zhang, Aurojit Panda, Mooly Sagiv, Scott Shenker

Abstract

Query determinacy is decidable for project-select views and a project-select-join query with no self joins, as long as the selection predicates are in a first-order theory for which satisfiability is decidable.

A Decidable Case of Query Determinacy: Project-Select Views

Abstract

Query determinacy is decidable for project-select views and a project-select-join query with no self joins, as long as the selection predicates are in a first-order theory for which satisfiability is decidable.

Paper Structure

This paper contains 4 sections, 2 theorems, 8 equations, 2 tables.

Table of Contents

  1. Summary
  2. Setup
  3. Reducing determinacy to a logical formula
  4. Proof of Theorem \ref{['thm:determine']}

Key Result

Theorem 1

The set $\mathbf{V}$ of views determines query $Q$ iff for every $1\leq i\leq m$: where the sub-formulas $\Phi$ and $\Psi$ are defined as: Furthermore, finite and unrestricted determinacy coincide in this setting.

Theorems & Definitions (2)

  • Theorem 1
  • Corollary 2