CS240A: Databases and Knowledge Bases From Deductive Rules to Active Rules Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

Slides:

Advertisements

Similar presentations

Beauty in Recursion, Fractals Gur Saran Adhar Computer Science Department.

Advertisements

CS240A: Databases and Knowledge Bases From Deductive Rules to Active Rules Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS240A: Databases and Knowledge Bases Temporal Applications and SQL:1999 Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CMSC 150 RECURSION CS 150: Mon 26 Mar Motivation : Bioinformatics Example  A G A C T A G T T A C  C G A G A C G T  Want to compare sequences.

CHICO 101. Where is California? Do you know? What is the most beautiful city in CA? ◦ San Francisco Which city is the state capital? ◦ Sacramento What.

Statistical Analysis of Search Engine Results Reeshabh Gadda alias Shah, Sanjay Thakkar Department of Computer Science University of Southern California.

Structured Query Language - SQL Carol Wolf Computer Science.

CS240A: Databases and Knowledge Bases Introduction Carlo Zaniolo Department of Computer Science University of California, Los Angeles WINTER 2002.

CS240A: Databases and Knowledge Bases Fixpoint Semantics of Datalog Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS 240A: Databases and Knowledge Bases Analysis of Active Databases Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS240A: Databases and Knowledge Bases A Taxonomy of Temporal DBs Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

Using Relational Databases and SQL Steven Emory Department of Computer Science California State University, Los Angeles Lecture 6: Midterm Review.

Information Systems Education: What’s missing? Paul H. Rosenthal Information Systems Department, California State University, Los Angeles.

CS240A: Databases and Knowledge Bases From Differential Fixpoints to Magic Sets Carlo Zaniolo Department of Computer Science University of California,

CS240A: Databases and Knowledge Bases Applications of Active Database Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

(CS1301) Introduction to Computer Programming City Univ of HK / Dept of CS / Helena Wong 0. Course Introduction - 1

CS240A: Databases and Knowledge Bases From Deductive Rules to Active Rules Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS351 - Software Engineering (AY2005)1 What is software engineering? Software engineering is an engineering discipline which is concerned with all aspects.

Coursenotes CS3114: Data Structures and Algorithms Clifford A. Shaffer Yang Cao Department of Computer Science Virginia Tech Copyright ©

RECURSIVE PATTERNS WRITE A START VALUE… THEN WRITE THE PATTERN USING THE WORDS NOW AND NEXT: NEXT = NOW _________.

It requires training in vocational schools, related on the job experience, or an associates degree. In 2012 most people made between $64,930 and $129,120.

CS240A: Databases and Knowledge Bases Introduction Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS 240A: Databases and Knowledge Bases Introduction to Active Databases Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

Practice of ER modeling - Answer Yong Choi School of Business CSUB.

Chapter 15 Recursion INTRODUCTION Recursion is a program-solving technique that expresses the solution of a problem in terms of the solutions of.

Teaching LP: A Perspective Gopal Gupta Department of Computer Science University of Texas at Dallas.

CS240A: Databases and Knowledge Bases Recursive Queries in SQL 1999 Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

Department of Computer Science 1 Recursion & Backtracking 1.The game of NIM 2.Getting out of a maze 3.The 8 Queen’s Problem 4.Sudoku.

Bubble Sort Data Structures and Algorithms CS 244 Brent M. Dingle, Ph.D. Game Design and Development Program Department of Mathematics, Statistics, and.

Police Department Authorization to enter into a Contract with LASD (Los Angeles County Sheriff’s Department) for Supplemental Law Enforcement Services.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to fit.

CS240A: Databases and Knowledge Bases Temporal Databases Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS 240A: Databases and Knowledge Bases Analysis of Active Databases Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

1Computer Sciences Department. 2 Advanced Design and Analysis Techniques TUTORIAL 7.

CS240A:A sample LDL++ Session Carlo Zaniolo Department of Computer Science University of California, Los Angeles December, 2001.

CS240A: Databases and Knowledge Bases Recursive Queries in SQL 2003 Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

1 Personalized IR Reloaded Xuehua Shen

CS240A: Databases and Knowledge Bases TSQL2 Carlo Zaniolo Department of Computer Science University of California, Los Angeles Notes From Chapter 6 of.

California State University, Los Angeles presents SPECTRUM EXPOSED please join us on the campus of California State University, Los Angeles on Monday,

BY: Mark Gruszecki.  What is a Recursive Query?  Definition(s) and Algorithm(s)  Optimization Techniques  Practical Issues  Impact of each Optimization.

COMPUTER SYSTEM FUNDAMENTAL Genetic Computer School INTRODUCTION TO ARTIFICIAL INTELLIGENCE LESSON 11.

1.5.3 Walkthrough #4 bouncing_ball.py wrapping_ball.py

City of Los Angeles Brownfields Program A Citywide Partnership… Community Redevelopment Agency Environmental Affairs Department Community Development.

CS240A: Databases and Knowledge Bases Introduction Carlo Zaniolo Department of Computer Science University of California, Los Angeles.

CS4222 Principles of Database System

CS240A: Databases and Knowledge Bases Introduction

Prepared by : Moshira M. Ali CS490 Coordinator Arab Open University

CS522 Advanced database Systems

CS522 Advanced database Systems

the first card insert text here.

CS223 Advanced Data Structures and Algorithms

CST221: Database Systems (III)

Searching and BST Exercises

Cs212: DataStructures Computer Science Department Lab 3 : Recursion.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to.

Изразеното в настоящата презентация мнение обвързва единствено автора и не представлява официално становище на Комисията за финансов надзор Данил Джоргов.

Data science online training.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to.

Title of Study Presenter names Major department names

Graphic Organisers Blank graphic organisers. These contain text boxes that can be filled by teachers who wish to share examples / ideas with other teachers.

Insert Your Two Line Poster Title Here Your Name Goes Here Department Name Can Go Here Methods Insert your text here. You can change the font size to.

CS223 Advanced Data Structures and Algorithms

CS148 Introduction to Programming II

Array operations Dr. T. Kokilavani Assistant Professor

Graphic Organisers Blanks for completing by teachers

CS240A: Databases and Knowledge Bases A Taxonomy of Temporal DBs

Presentation transcript:

CS240A: Databases and Knowledge Bases From Deductive Rules to Active Rules Carlo Zaniolo Department of Computer Science University of California, Los Angeles Revised: January 2003

From Deductive Rules to Production Rules  Deductive rules for recursive views: closure(X,Y) : base(X,Y) closure(X,Y) : closure(X,Z), base(Z,Y)  Active rules to materialize recursive views:  Initialization step (will start the process) insert into closure (select * from base)  Production rule (will call itself recursively, several times) create rule transclosure on base when inserted then insert into closure (select inserted.fr, closure.to from inserted, closure where inserted.to = closure.fr)

Maintenance  Every time the database is changed recompute the concrete view, or  Perform delta maintenance using techniques similar to the differential fixpoint of deductive databases  Things are more complex here because you can have both additions (  + ) an subtractions (  - )

Example of Recursive View  Database: Station(city, state). Train(city1, city2).  Deductive rules: r1. Route(c1,c2) : Train(c1,c2). r2. Route(c1,c2) : Route(c1,c3), Route(c3,c2). r3. ReachCal(c) : Station(c,s), s = ''California'‘. r4. ReachCal(c) : Route(c,c2), ReachCal(c2).

Insert Rules: r1i.  + Route(c1,c2) :-  + Train(c1,c2). r2i1.  + Route(c1,c2) :-  + Route(c1,c3), Route(c3,c2). r2i2.  + Route(c1,c2) :- Route(c1,c3),  + Route(c3,c2). r3i.  + ReachCal(c) :-  + Station(c,s), s = ''California'' r4i1.  + ReachCal(c) :-  + Route(c,c1), ReachCal(c1). r4i2.  + ReachCal(c) :- Route(c,c1),  + ReachCal(c1).

Delete Rules Eliminate all suspect arcs r1d.  - Route(c1,c2) :-  - Train(c1,c2) r2d1.  - Route(c1,c2) :-  - Route(c1,c3), Route(c3,c2) r2d2.  - Route(c1,c2) :- Route(c1,c3),  - Route(c3,c2) r3d.  - ReachCal(c) :-  - Station(c,s), s = ''California'' r4d1.  - ReachCal(c) :-  - Route(c,c1), ReachCal(c1) r4d2.  - ReachCal(c) :- Route(c,c1),  - ReachCal(c1) NB. Train, Route, Station, ReachCal: before deletion

Reinsert rules (needed after deletion) r1r.  + Route(c1,c2) :  - Route(c1,c2), Train(c1,c2). r2r.  + Route(c1,c2) :  - Route(c1,c2), Route(c1,c3), Route(c3,c2). r3r.  + ReachCal(c) :  - ReachCal(c), Station(c,s), s = ''California'' r4r.  + ReachCal(c) :  - ReachCal(c), Route(c,c1),ReachCal(c1).  Train, Route, Station, ReachCal: after deletion   - restricts search in a fashion similar to magic sets.