1 CIS607, Fall 2005 Semantic Information Integration Presentation by Paea LePendu Week 8 (Nov. 16)

Slides:



Advertisements
Similar presentations
Intelligent Technologies Module: Ontologies and their use in Information Systems Revision lecture Alex Poulovassilis November/December 2009.
Advertisements

Schema Matching and Query Rewriting in Ontology-based Data Integration Zdeňka Linková ICS AS CR Advisor: Július Štuller.
NP-Hard Nattee Niparnan.
Lecture 15 Functions CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
CSE 636 Data Integration Data Integration Approaches.
Information Integration Using Logical Views Jeffrey D. Ullman.
1. An Overview of Prolog.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 4 By Herb I. Gross and Richard A. Medeiros next.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Xiangkui Yao Week 6 (Nov. 3)
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Julian Catchen Week 3 (Oct. 13)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dong Hwi Kwak Week 5 (Oct. 26)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dayi Zhou Week 4 (Oct. 19)
CAS LX 502 Semantics 1b. The Truth Ch. 1.
BYU 2003BYU Data Extraction Group Combining the Best of Global-as-View and Local-as-View for Data Integration Li Xu Brigham Young University Funded by.
8 TECHNIQUES OF INTEGRATION. In defining a definite integral, we dealt with a function f defined on a finite interval [a, b] and we assumed that f does.
1 Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems Chen Li Information and Computer Science University of California,
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Enrico Viglino Week 3 (Oct. 12)
2005Integration-intro1 Data Integration Systems overview The architecture of a data integration system:  Components and their interaction  Tasks  Concepts.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Jiawei Rong Week 10 (Nov. 30)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Shiwoong Kim Week 9 (Nov. 23)
CSE 636 Data Integration Answering Queries Using Views Overview.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Zebin Chen Week 7 (Nov. 9)
11/8/20051 Ontology Translation on the Semantic Web D. Dou, D. McDermott, P. Qi Computer Science, Yale University Presented by Z. Chen CIS 607 SII, Week.
1 CIS607, Fall 2004 Semantic Information Integration Presentation by Xiaofang Zhang Week 7 (Nov. 10)
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Amanda Hosler Week 6 (Nov. 2)
Solving Systems of Linear Equations using Elimination
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 21 By Herbert I. Gross and Richard A. Medeiros next.
Introduction to the Adjective/Noun Theme. © 2012 Math As A Second Language All Rights Reserved next #1 Taking the Fear out of Math.
Copyright © Cengage Learning. All rights reserved.
5.6 Daily Warm-Up 7.1 Daily Warm-Up
Reasoning with context in the Semantic Web … or contextualizing ontologies Fausto Giunchiglia July 23, 2004.
Copyright © Cengage Learning. All rights reserved. Solving Exponential and Logarithmic Equations SECTION 6.4.
Unit 1 (Chapter 5): Significant Figures
Computer Science 1000 Digital Circuits. Digital Information computers store and process information using binary as we’ve seen, binary affords us similar.
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
Unit 11, Part 2: Introduction To Logarithms. Logarithms were originally developed to simplify complex arithmetic calculations. They were designed to transform.
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
7.3 Solving Linear Systems by Linear Combinations (Elimination) Method
Multi-digit Numerical Long Division 1 © 2013 Meredith S. Moody.
Navigational Plans For Data Integration Marc Friedman Alon Levy Todd Millistein Presented By Avinash Ponnala Avinash Ponnala.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
Secure Systems Research Group - FAU Using patterns to compare web services standards E. Fernandez and N. Delessy.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
Copyrighted material John Tullis 10/17/2015 page 1 04/15/00 XML Part 3 John Tullis DePaul Instructor
Data Integration by Bi-Directional Schema Transformation Rules Data Integration by Bi-Directional Schema Transformation Rules By Peter McBrien and Alexandria.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 10 By Herbert I. Gross and Richard A. Medeiros next.
In section 11.9, we were able to find power series representations for a certain restricted class of functions. Here, we investigate more general problems.
Overview Concept Learning Representation Inductive Learning Hypothesis
Scaling Heterogeneous Databases and Design of DISCO Anthony Tomasic Louiqa Raschid Patrick Valduriez Presented by: Nazia Khatir Texas A&M University.
Human Centric Computing (COMP106) Assignment 2 PROPOSAL 23.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Solving Systems of Equations by Elimination (Addition)
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 17 part 2 By Herbert I. Gross and Richard A. Medeiros next.
Logic UNIT 1.
Transitions Bridges between ideas and supporting points.
Solving Systems of Equations Modeling real-world problems.
1 Integration of data sources Patrick Lambrix Department of Computer and Information Science Linköpings universitet.
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
1 Authorization Sec PAL: A Decentralized Authorization Language.
Representations of Functions as Power Series INFINITE SEQUENCES AND SERIES In this section, we will learn: How to represent certain functions as sums of.
Answering Queries Using Views Presented by: Mahmoud ELIAS.
Chen Li Information and Computer Science
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

1 CIS607, Fall 2005 Semantic Information Integration Presentation by Paea LePendu Week 8 (Nov. 16)

2 Questions from Homework 6 Questions related to some data integration concepts? – The author mentions that most data integration systems use the GAV model. It seems that the LAV model's difficulty in processing queries makes it unappealing. However, it is noted in the paper that it is easier to add sources to the global schema using the LAV model. Is the difficulty in answering queries using the LAV model so prohibitive that the advantages are negligible? -- Shiwoong – What is a conjunctive query? -- Shiwoong – Why is local-as-view expressed in global terms, and GAV in local terms? Doesn’t this seem counterintuitive? -- Enrico – What is an unfolding strategy? – Enrico – What does "arity" mean? The "Reasoning on Queries" section confuses me. What do they mean, "verifying whether one query returns a subset of the result computed by the other query in all databases". All what databases? -- Amanda

3 Questions from Homework 6 (cont ’ d) About data integration concepts? – (This might be a shallow question): The tutorial says that in LAV "adding a new source simply means enriching the mapping with a new assertion, without other changes". I am curious about this: this seems only true if the qG is qualified with source's namespace, otherwise the query result might be influenced by the added source thus contradict to such assertion. - Zebin – The paper talks about LAV/GAV transformation. Is it easy/common in practice? If yes, then the construction and the query for multiple sources are readily solved. Furthermore, is there adaptive transformation for transformation from LAV to GAV? – Zebin – What are the other differences between LAV and GAV? – Is there any methods to judge if a query is good or bad, or say hard or easy ? -- Jiawei

4 Questions from Homework 6 (cont ’ d) About the approach. – Why processing queries in the LAV approach is a difficult task and why GAV approach provides a specification mechanism that has a more procedural flavor with respect to the LAV approach? -- Donghwi – I cannot understand why the first order logic interpretation of the assertions in the mapping cannot able to cope with inconsistencies between sources.? – Donghwi – The paper compares LAV and GAV. The conclusion is that it is easier to extend LAV with more sources while it is easier to process query with GAV. My understanding is that for GAV, when adding a new source, new mapping and corresponding query processing has to be added between it and the global schema. Isn’t it almost equally hard to add a new source in LAV and GAV? -- Dayi – Is it equally easy to solve data inconsistency in LAV as in GAV? -- Dayi

5 Questions from Homework 6 (cont ’ d) Consider the following relations: – e1: {(1,a), (2,b), (3,c)} e2:{(a,!), – The result for query Q(x,y) is The content of V3 is {1, 2}. The content of V1 is the same as e1. The contents of V2 is the same as e2. Then the query q’(x, y) is actually the following set of pairs: S = {(x, y) | there exist z, such that V3(x) and V1(x, y) and V2(z, y) } However, (1,!) is clearly not a member of this set since V1(1,!) is not true. Similarly, is not a member either. So, S is equal to empty set, which is not the maximally-contained result. Was I making stupid errors here? – -- Xiaofang How exactly are the inverse rules constructed? I didn't understand this section of the paper. -- Julian

6 Questions from Homework 6 (cont ’ d) Other questions. – It seems that this approach can somehow help to solve the problem of semantic gaps of heterogeneous data if we think views as the heterogeneous data sources and queries as on a common schema definition. Then what are the pros and cons of this approach? -- Xiaofang – Would it be possible to build a bridge so that users could work from semantic schemas (such as OWL) instead of the mediated database schema? -- Julian