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

刪減

Static Analysis and Query Answering for Incomplete Data Trees with Constraints, an infinite set. Incomplete data trees model XML documents with incomplete information; they may include both structural incompleteness and incompleteness of data. Here we study two basic problems for incomplete data trees under typical constraints such as keys and foreign keys. The first problem i

hyperuricemia

劇毒

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.

Lyme-disease

Incremental Data Fusion Based on Provenance Information,representation. It is usually the last step of an integration process, which is executed after the schema matching and the entity identification steps. More specifically, data fusion aims at solving attribute value conflicts based on user-defined rules. Although there exist several approaches in the

Custodian

Provenance for Linked Data,lational data and queries has shown that . can be used in order to compute trustworthiness, reputation and reliability of query results, based on the source data and query operators involved in their derivation. In particular, . can be employed to record information about source data and query opera