Titlebook: In Search of Elegance in the Theory and Practice of Computation; Essays dedicated to Val Tannen,Limsoon Wong,Michael Fourman Book 2013 Spr

Thyroxine

Static Analysis and Query Answering for Incomplete Data Trees with Constraints,escriptions can be transferred to the consistency of incomplete tree specifications without any increase in complexity. After that we examine query answering over incomplete data trees under constraints, and show that tractable bounds can be recovered under key constraints, but are lost under foreign keys.

parallelism

Using SQL for Efficient Generation and Querying of Provenance Information,on-demand provenance generation and querying using SQL. Since Perm rewrites a query requesting provenance into a regular SQL query and generates easily optimizable SQL code, its performance greatly benefits from the query optimization techniques provided by the underlying DBMS.

陶瓷

Provenance for Linked Data,come these limitations, we advocate the need for new provenance models that capture the full expressive power of SPARQL, and can be used to support assessment of various forms of data quality for linked data manipulated declaratively by such queries.

GNAT

,Relational Databases and Bell’s Theorem,remarkably direct correspondence between central results such as Bell’s theorem in the foundations of quantum mechanics, and questions which arise naturally and have been well-studied in relational database theory.

強制令

過份好問

Provenance-Directed Chase&Backchase,ckchase phase can be sped up significantly if we instrument the standard chase to maintain provenance information. The particular provenance flavor required is known as minimal why-provenance in the literature, and it can be computed by exploiting the analogy between a chase step execution and query evaluation.

Heart-Rate

Data Quality Problems beyond Consistency and Deduplication,ith performance guarantees, unification of data repairing and record matching, relative information completeness, and data currency. We provide an overview of recent advances in the study of these issues, and advocate the need for developing a logical framework for a uniform treatment of these issues.

RENAL

coddle

一起

Bounds and Algorithms for Joins via Fractional Edge Covers,evoted to efficient join processing. Short of fully computing the result of a join or a sequence of joins (we use the term . in the following), in many applications it is also important to get good bounds on the size of the result.