Verbalized Query Construction on general case (con.3)

Slides:

Advertisements

Similar presentations

CMSC420: Skip Lists Kinga Dobolyi Based off notes by Dave Mount.

Advertisements

Interval Heaps Complete binary tree. Each node (except possibly last one) has 2 elements. Last node has 1 or 2 elements. Let a and b be the elements in.

Maintaining Arc Consistency We have a constraint graph G of variables X 1,...X n, and constraint relations {X i  X j}, and each Xi has a value set V (X.

Augmenting Data Structures Advanced Algorithms & Data Structures Lecture Theme 07 – Part I Prof. Dr. Th. Ottmann Summer Semester 2006.

I/O-Algorithms Lars Arge Fall 2014 September 25, 2014.

1 Pertemuan 20 Run-Time Environment Matakuliah: T0174 / Teknik Kompilasi Tahun: 2005 Versi: 1/6.

Introduction to Data Structures. Data Structures A data structure is a scheme for organizing data in the memory of a computer. Some of the more commonly.

Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.

Context and Prosopography: Putting the 'Archives' Into LOD-LAM Corey A Harper SAA MDOR

Indexing. Goals: Store large files Support multiple search keys Support efficient insert, delete, and range queries.

Introduction to Data Structures. About the document. The document is prepared by Prof. Shannon Bradshaw at Drew University. The key concepts in data structure.

Digital Electronics Data Structures LISP

Chapter 19: Binary Trees Java Programming: Program Design Including Data Structures Program Design Including Data Structures.

Trees A tree is a set of nodes which are connected by branches to other nodes in a 'tree-like' structure. There is a special node called the root from.

1 Tree Indexing (1) Linear index is poor for insertion/deletion. Tree index can efficiently support all desired operations: –Insert/delete –Multiple search.

Lecture1 introductions and Tree Data Structures 11/12/20151.

Data Structures Types of Data Structure Data Structure Operations Examples Choosing Data Structures Data Structures in Alice.

Segment Trees Basic data structure in computational geometry. Computational geometry.  Computations with geometric objects.  Points in 1-, 2-, 3-, d-space.

Pascal Programming Pointers and Dynamic Variables.

1 Chapter 7 Objectives Upon completion you will be able to: Create and implement binary search trees Understand the operation of the binary search tree.

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

Lecture - 11 on Data Structures. Prepared by, Jesmin Akhter, Lecturer, IIT,JU Threaded Trees Binary trees have a lot of wasted space: the leaf nodes each.

Chapter Six Working with NDS Security. Chapter Objectives Describe NDS security and list the object and property rights Identify the NDS security needs.

Lecture 23 XQuery 1.0 and XPath 2.0 Data Model. 2 Example 31.7 – User-Defined Function Function to return staff at a given branch. DEFINE FUNCTION staffAtBranch($bNo)

Hello Everyone!!! 1. Tree And Graphs 2 Features of Trees  Tree Nodes Each node have 0 or more children A node have must one parent  Binary tree Tree.

Design of Nonmasking Tree Algorithm Goal: design a tree construction protocol systematically by constructing its invariant and fault-span.

Question 4 Tutorial 8. Part A Insert 20, 10, 15, 5,7, 30, 25, 18, 37, 12 and 40 in sequence into an empty binary tree

XDI Graph Patterns OASIS XDI TC Submission Drummond Reed This document contains illustrations of six basic XDI graph patterns: 1.Simple properties:

CSC 143 P 1 CSC 143 Recursion [Chapter 5]. CSC 143 P 2 Recursion  A recursive definition is one which is defined in terms of itself  Example:  Compound.

INTRODUCTION TO DATA STRUCTURES 1. DATA STRUCTURES A data structure is a scheme for organizing data in the memory of a computer. Some of the more commonly.

DS.T.1 Trees Chapter 4 Overview Tree Concepts Traversals Binary Trees Binary Search Trees AVL Trees Splay Trees B-Trees.

Data Structure By Amee Trivedi.

G64ADS Advanced Data Structures

Assignment 6: Huffman Code Generation

CPS216: Data-intensive Computing Systems

Insertion/Deletion in binary trees

How to avoid side effects during online download

Binary search tree. Removing a node

Binary Search Trees.

Objective: Understand Concepts related to trees.

Design and Analysis of Algorithms

Revised based on textbook author’s notes.

CMPS 3130/6130 Computational Geometry Spring 2017

Binary Tree Applications

CS200: Algorithms Analysis

COP3530- Data Structures B Trees

DATASET 查询构建设计方案 2018/11/16 刘庆霞 Websoft NJU.

Query Construct Interfaces of RDF Data an introduction

Factored Use-Def Chains and Static Single Assignment Forms

Planning José Luis Ambite.

Binary Tree Application Operations in Heaps

Reporting (1-D) Given a set of points S on the line, preprocess them to build structure that allows efficient queries of the from: Given an interval I=[x1,x2]

Vocabulary Trees Complete the tree by adding your vocabulary word to the trunk, definitions to the roots, and fill the branches with at least 8 related.

Random inserting into a B+ Tree

Lecture 21: B-Trees Monday, Nov. 19, 2001.

CSE 373, Copyright S. Tanimoto, 2002 Binary Trees -

RECURSION Annie Calpe

The Links portal: Navigating over Linked Data

Lecture 36 Section 12.2 Mon, Apr 23, 2007

General Trees A general tree T is a finite set of zero or more nodes such that there is one designated node r, called the root of T, and the remaining.

CSE 373, Copyright S. Tanimoto, 2001 Binary Trees -

Backtracking and Branch-and-Bound

SView 0.3设计

COMPILERS Semantic Analysis

Constraint Graph Binary CSPs

Heaps Chapter 6 Section 6.9.

Presentation transcript:

Verbalized Query Construction on general case (con.3) Qingxia Liu 2019/1/2 yjydfnhc@126.com

Basic Structure Tree like structure: what do you want to find? restart Find all ?film1, ?film2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has runtime ?runtime2 (from 7200 to 10800) has writer ?writer (Writer) is writer of ?film1 Tree like structure: nesting of node description blocks Information Need: Find two films that has the same director and writer, and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Construct Procedure Init create the root node Modify Project Node Setting rename current node delete current node Value Constraint class constraint: for uri / blanknode/literal resource filter: value range binary constraint relation to existing variable Link add an arc to a new node Project

Basic Structure Tree like structure: what do you want to find? restart Find all ?film1, ?film2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has runtime ?runtime2 (from 7200 to 10800) has writer ?writer (Writer) is writer of ?film1 Tree like structure: nesting of node description blocks Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Init Create the root node : set name, set class Information Need: what do you want to find? start Create the root node : set name, set class Create a variable set name: set class: add cancel ?v0 Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Init Create the root node : set name, set class Information Need: what do you want to find? restart Create the root node : set name, set class Find all ?film1, that ?film1 (Film) has property… Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify set name, set class Information Need: what do you want to find? restart set name, set class Find all ?film1, that ?film1 (Film) has property… Set variable set name : bind instance : set class: set cancel ?film1 Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify add property Information Need: what do you want to find? restart add property Find all ?film1, that ?film1 (Film) has property… Add property Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify add property Information Need: what do you want to find? restart add property Find all ?film1, ?runtime, ?director, ?writer, that ?film1 (Film) has property… has runtime ?runtime has director ?director has writer ?writer Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify set name set value range(filter) what do you want to find? restart set name set value range(filter) (literal has no class constraint) Find all ?film1 , ?runtime, ?director, ?writer that ?film1 (Film) has runtime ?runtime has director ?director has writer ?writer Set variable set name: set value range : from ______ to ______ set class: set cancel ?runtime Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify set name set value range(filter) Information Need: what do you want to find? restart set name set value range(filter) Find all ?film1 , ?runtime, ?director, ?writer, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director has writer ?writer Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify set name set value range(filter) Information Need: what do you want to find? restart set name set value range(filter) Find all ?film1 , ?runtime, ?director, ?writer, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director has property… has writer ?writer Set variable set name : bind instance : set class: set cancel ?director Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify set name set value range(filter) Information Need: what do you want to find? restart set name set value range(filter) Find all ?film1 , ?runtime, ?director, ?writer, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has property… has writer ?writer Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify after many similar steps …. Information Need: what do you want to find? restart after many similar steps …. Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has property… has relation… has runtime ?runtime2 (from 7200 to 10800) has writer ?writer (Writer) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify add relation to existing variable (binary constraint) what do you want to find? restart add relation to existing variable (binary constraint) Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has property… has relation… has runtime ?runtime2 (from 7200 to 10800) has writer ?writer (Writer) Relations to existing variables: Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify reconstruct: maintain a DFS tree Information Need: what do you want to find? restart reconstruct: maintain a DFS tree Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has property… has relation… has writer ?writer (Writer) is writer of ?film1 has runtime ?runtime2 (from 7200 to 10800) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify delete: delete a constraint delete a node delete an arc what do you want to find? restart delete: delete a constraint delete a node delete an arc Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 x (Film x) has writer ?writer (Writer) is writer of ?film1 x has runtime ?runtime2 (from 7200 to 10800 x) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify delete: delete a constraint delete a node delete an arc what do you want to find? restart delete: delete a constraint delete a node delete an arc Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has writer ?writer (Writer) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Project project: select interested variables Information Need: what do you want to find? restart project: select interested variables Find all ?film1 , ?runtime x , ?director x , ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has writer ?writer (Writer) is writer of ?film1 has runtime ?runtime2 (from 7200 to 10800) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Project project: select interested variables Information Need: what do you want to find? restart project: select interested variables Find all ?film1 , ?film2, + that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has writer ?writer (Writer) is writer of ?film1 has runtime ?runtime2 (from 7200 to 10800) select variables: Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Thank You ~ Any suggestions？

Modify add relation to existing variable (binary constraint) what do you want to find? restart add relation to existing variable (binary constraint) Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has runtime ?runtime2 (from 7200 to 10800) has writer ?writer (Writer) has property… has relation… Relations to existing variables: Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify reconstruct: maintain a DFS tree Information Need: what do you want to find? restart reconstruct: maintain a DFS tree Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 (Film) has writer ?writer (Writer) has property… has relation… is writer of ?film1 has runtime ?runtime2 (from 7200 to 10800) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify delete: delete a constraint delete a node / delete a branch what do you want to find? restart delete: delete a constraint delete a node / delete a branch delete an arc Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) has made ?film2 x (Film x) has writer ?writer (Writer) is writer of ?film1 x has runtime ?runtime2 (from 7200 to 10800 x) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;

Modify delete: delete a constraint delete a node / delete a branch what do you want to find? restart delete: delete a constraint delete a node / delete a branch delete an arc Find all ?film1 , ?runtime, ?director, ?writer, ?film2, ?runtime2, that ?film1 (Film) has runtime ?runtime (from 0 to 7200) has director ?director (Director) Information Need: Find two films that has the same director and writer ,and the first film’s runtime between 0 and 7200 seconds, the second film’s runtime between 7200 and 10800 seconds;