1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dong Hwi Kwak Week 5 (Oct. 26)

Slides:



Advertisements
Similar presentations
Chapter 3 Tuple and Domain Relational Calculus. Tuple Relational Calculus.
Advertisements

Database Systems: Design, Implementation, and Management Tenth Edition
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
Interactive Generation of Integrated Schemas Laura Chiticariu et al. Presented by: Meher Talat Shaikh.
NaLIX: A Generic Natural Language Search Environment for XML Data Presented by: Erik Mathisen 02/12/2008.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dayi Zhou Week 4 (Oct. 19)
Visual Web Information Extraction With Lixto Robert Baumgartner Sergio Flesca Georg Gottlob.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Paea LePendu Week 8 (Nov. 16)
CS 330 Programming Languages 09 / 18 / 2007 Instructor: Michael Eckmann.
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Enrico Viglino Week 3 (Oct. 12)
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)
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Zebin Chen Week 7 (Nov. 9)
XML –Query Languages, Extracting from Relational Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria.
1 Chapter 2 Database Environment. 2 Objectives of Three-Level Architecture u All users should be able to access same data u User’s view immune to changes.
1 Relational Algebra and Calculus Yanlei Diao UMass Amherst Feb 1, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
CIS607, Fall 2005 Semantic Information Integration Article Name: Clio Grows Up: From Research Prototype to Industrial Tool Name: DH(Dong Hwi) kwak Date:
1 CIS607, Fall 2005 Semantic Information Integration Presentation by Amanda Hosler Week 6 (Nov. 2)
A Really Brief Crash Course in Semantic Web Technologies Rocky Dunlap Spencer Rugaber Georgia Tech.
Lecture 6 Karnaugh Map. Logic Reduction Using Karnaugh Map Create a Karnaugh Map Circle (2, 4, 8..) 1’s. OR the minterm generated by each loop.
Some Basic Database Terminology
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 1: Introduction.
1 Introduction to databases concepts CCIS – IS department Level 4.
A Unified Framework for the Semantic Integration of XML Databases
Ontology Alignment/Matching Prafulla Palwe. Agenda ► Introduction  Being serious about the semantic web  Living with heterogeneity  Heterogeneity problem.
1 Relational Algebra and Calculus Chapter 4. 2 Relational Query Languages  Query languages: Allow manipulation and retrieval of data from a database.
XML Overview. Chapter 8 © 2011 Pearson Education 2 Extensible Markup Language (XML) A text-based markup language (like HTML) A text-based markup language.
CSC271 Database Systems Lecture # 4.
Interoperability in Information Schemas Ruben Mendes Orientador: Prof. José Borbinha MEIC-Tagus Instituto Superior Técnico.
Querying Structured Text in an XML Database By Xuemei Luo.
Basics of Functions.
1 5 Normalization. 2 5 Database Design Give some body of data to be represented in a database, how do we decide on a suitable logical structure for that.
Lecture2: Database Environment Prepared by L. Nouf Almujally 1 Ref. Chapter2 Lecture2.
Data Exchange with Data-Metadata Translations MAD Algorithm Paolo Papotti Mauricio A. Mauricio A. Hernández Wang-ChiewTan.
1 Relational Algebra and Calculas Chapter 4, Part A.
Relational Algebra.
Semantically Processing The Semantic Web Presented by: Kunal Patel Dr. Gopal Gupta UNIVERSITY OF TEXAS AT DALLAS.
Database Environment Session 2 Course Name: Database System Year : 2013.
Issues in Ontology-based Information integration By Zhan Cui, Dean Jones and Paul O’Brien.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Module A: Formal Relational.
How Are Computers Programmed? CPS120: Introduction to Computer Science Lecture 5.
Grouping Robin Burke ECT 360. Outline Extra credit Numbering, revisited Grouping: Sibling difference method Uniquifying in XPath Grouping: Muenchian method.
Chapter 1: Introduction. 1.2 Database Management System (DBMS) DBMS contains information about a particular enterprise Collection of interrelated data.
XML 1. Chapter 8 © 2013 Pearson Education, Inc. Publishing as Prentice Hall SAMPLE XML SCHEMA (XSD) 2 Schema is a record definition, analogous to the.
Database Systems: Design, Implementation, and Management Tenth Edition
Appendix D: Network Model
Database Management Systems (CS 564)
CPSC-608 Database Systems
Implementing Mapping Composition
Global Challenge A bag for Juliane Lesson 2.
Global Challenge Love Heart Lesson 2.
Data Model.
Database Systems Instructor Name: Lecture-3.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge Love Heart Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge A bag for Juliane Lesson 2.
Global Challenge Love Heart Lesson 2.
Presentation transcript:

1 CIS607, Fall 2005 Semantic Information Integration Presentation by Dong Hwi Kwak Week 5 (Oct. 26)

2 Questions from Homework 3 Some concepts: – Could you explain skolem functions in more detail (perhaps with an easy to understand example)? – Shiwoong – Could you explain the deep-union in more detail? – Shiwoong – In figure 4, I take quantifiers apply for all variables. Are skolem functions arbitrary? -- Enrico

3 Questions from Homework 3 About the algorithms in Clio – Does the mapping generator find anything more than 1-1 correspondences? -- Amanda – Is the grouping algorithm used based entirely on the syntax of the schema? -- Enrico – Since the mappings connect very large data systems, efficiency would be a very important factor. What’s the efficiency about Clio? -- Jiawei – In the mapping generation component of Clio, how to decide which group of correspondences to use in a logical mapping? What’s the current solution, and how important it is? – Jiawei – What are the criteria to decide whether the end-points in schemas are related? Name, data attributes, taxonomy? How about those elements and attributes which do not present in both source and target? Just ignore them? -- Dayi

4 Questions from Homework 3 (cont ’ d) Other questions about this paper: – Does this work between two semi-related schemas? -- Amanda – Can you explain the description in page 807: “The use of collection-bound variables (rather than that of arbitrarily bound variables) has the advantages that the resulting notation maps easily to efficient iteration patterns (e.g., the from clause of SQL, or the for loops of XQuery/XSLT).” Can you give an example for this? -- Zebin – Can you clarify the theoretic limitation/difference of relational database (or the model they use) and the output language, e.g. XSLT, XQuery, etc. The paper did mention that they are not equally expressive,but I can’t find the exact definition. Their sample case explains one constrain that can be expressed in the hierarchical XML. Any other constraint? -- Zebin – Want to see the comparison with other systems and how much user input are needed for the best performance? -- Dayi