Applied Temporal RDF: Efficient Temporal Querying using SPARQL Jonas Tappolet and Abraham Bernstein ESWC 2009.

Slides:



Advertisements
Similar presentations
Introduction to Maven 2.0 An open source build tool for Enterprise Java projects Mahen Goonewardene.
Advertisements

1 gStore: Answering SPARQL Queries Via Subgraph Matching Presented by Guan Wang Kent State University October 24, 2011.
Lei Zou 1, Jinghui Mo 1, Lei Chen 2, M. Tamer Özsu 3, Dongyan Zhao 1 1 gStore: Answering SPARQL Queries Via Subgraph Matching 1 Peking University, 2 Hong.
Store RDF Triples In A Scalable Way Liu Long & Liu Chunqiu.
A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer Paul R. Smart, Alistair Russell, Dave Braines, Yannis Kalfoglou,,
RDF-3X: a RISC style Engine for RDF Ref: Thomas Neumann and Gerhard Weikum [PVLDB’08 ] Presented by: Pankaj Vanwari Course: Advanced Databases (CS 632)
 Copyright 2004 Digital Enterprise Research Institute. All rights reserved. SPARQL Query Language for RDF presented by Cristina Feier.
RDF and RDB 1 Some slides adapted from a presentation by Ivan Herman at the Semantic Technology & Business Conference, 2012.
STUN: SPATIO-TEMPORAL UNCERTAIN (SOCIAL) NETWORKS Chanhyun Kang Computer Science Dept. University of Maryland, USA Andrea Pugliese.
Presented by Cathrin Weiss, Panagiotis Karras, Abraham Bernstein Department of Informatics, University of Zurich Summarized by: Arpit Gagneja.
Memoplex Browser: Searching and Browsing in Semantic Networks CPSC 533C - Project Update Yoel Lanir.
THE MODEL OF ASIS FOR PROCESS CONTROL APPLICATIONS P.Andreeva, T.Atanasova, J.Zaprianov Institute of Control and System Researches Topic Area: 12. Intelligent.
Storing RDF Data in Hadoop And Retrieval Pankil Doshi Asif Mohammed Mohammad Farhan Husain Dr. Latifur Khan Dr. Bhavani Thuraisingham.
Triple Stores.
Project By: Anuj Shetye Vinay Boddula. Introduction Motivation HBase Our work Evaluation Related work. Future work and conclusion.
Logics for Data and Knowledge Representation SPARQL Protocol and RDF Query Language (SPARQL) Feroz Farazi.
This presentation will guide you though the initial stages of installation, through to producing your first report Click your mouse to advance the presentation.
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
Rajashree Deka Tetherless World Constellation Rensselaer Polytechnic Institute.
SPARQL All slides are adapted from the W3C Recommendation SPARQL Query Language for RDF Web link:
Implemented Systems Presenter: Manos Karpathiotakis Extended Semantic Web Conference 2012.
An Integrated Approach to Extracting Ontological Structures from Folksonomies Huairen Lin, Joseph Davis, Ying Zhou ESWC 2009 Hyewon Lim October 9 th, 2009.
Hexastore: Sextuple Indexing for Semantic Web Data Management
PLATFORM INDEPENDENT SOFTWARE DEVELOPMENT MONITORING Mária Bieliková, Karol Rástočný, Eduard Kuric, et. al.
Software Design Patterns for Information Visualization 薛乃榮 Q NCBCI LAB.
Ultrawrap: SPARQL Execution on Relational Data Juan F. Sequeda, Daniel P. Miranker University of Texas - Austin ISWC 2009 Seoul National University Internet.
Trisolda Jakub Yaghob Charles University in Prague, Czech Rep.
Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce Mohammad Farhan Husain, Pankil Doshi, Latifur Khan, Bhavani Thuraisingham University.
Querying Structured Text in an XML Database By Xuemei Luo.
GStore: Answering SPARQL Queries via Subgraph Matching Lei Zou, Jinghui Mo, Lei Chen, M. Tamer Ozsu ¨, Dongyan Zhao {
SPARQL W3C Simple Protocol And RDF Query Language
Lesley Charles November 23, 2009.
Samad Paydar Web Technology Lab. Ferdowsi University of Mashhad 10 th August 2011.
SPARQL Query Graph Model (How to improve query evaluation?) Ralf Heese and Olaf Hartig Humboldt-Universität zu Berlin.
Q2Semantic: A Lightweight Keyword Interface to Semantic Search Haofen Wang 1, Kang Zhang 1, Qiaoling Liu 1, Thanh Tran 2, and Yong Yu 1 1 Apex Lab, Shanghai.
Semantic Web Programming in Python an Introduction Biju B Jaganath G.
Google’s Deep-Web Crawl By Jayant Madhavan, David Ko, Lucja Kot, Vignesh Ganapathy, Alex Rasmussen, and Alon Halevy August 30, 2008 Speaker : Sahana Chiwane.
Efficient RDF Storage and Retrieval in Jena2 Written by: Kevin Wilkinson, Craig Sayers, Harumi Kuno, Dave Reynolds Presented by: Umer Fareed 파리드.
Spatio-temporal Pattern Queries M. Hadjieleftheriou G. Kollios P. Bakalov V. J. Tsotras.
GStore: Answering SPARQL Queries Via Subgraph Matching Lei Zou 1, Jinghui Mo 1, Lei Chen 2, M. Tamer Özsu 3, Dongyan Zhao Peking University, 2 Hong.
VLDB2005 CMS-ToPSS: Efficient Dissemination of RSS Documents Milenko Petrovic Haifeng Liu Hans-Arno Jacobsen University of Toronto.
Johannes Kepler University Linz Department of Business Informatics Data & Knowledge Engineering Altenberger Str. 69, 4040 Linz Austria/Europe
Shridhar Bhalerao CMSC 601 Finding Implicit Relations in the Semantic Web.
RDFPath: Path Query Processing on Large RDF Graph with MapReduce Martin Przyjaciel-Zablocki et al. University of Freiburg ESWC May 2013 SNU IDB.
Triple Stores. What is a triple store? A specialized database for RDF triples Can ingest RDF in a variety of formats Supports a query language – SPARQL.
05/01/2016 SPARQL SPARQL Protocol and RDF Query Language S. Garlatti.
Text Based Similarity Metrics and Delta for Semantic Web Graphs Krishnamurthy Koduvayur Viswanathan Monday, June 28,
Toward a framework for statistical data integration Ba-Lam Do, Peb Ruswono Aryan, Tuan-Dat Trinh, Peter Wetz, Elmar Kiesling, A Min Tjoa Linked Data Lab,
CC L A W EB DE D ATOS P RIMAVERA 2015 Lecture 7: SPARQL (1.0) Aidan Hogan
Steven Perry Dave Vieglais. W a s a b i Web Applications for the Semantic Architecture of Biodiversity Informatics Overview WASABI is a framework for.
Simplifying Algebraic Expressions. 1. Evaluate each expression using the given values of the variables (similar to p.72 #37-49)
Tool for Ontology Paraphrasing, Querying and Visualization on the Semantic Web Project By Senthil Kumar K III MCA (SS)‏
2014 Semantic-based Code and Documentation Search Engine Reshma Thumma Oct 10,2014 #GHC
Semantic Web Application Patterns: Pipelines, Versioning and Validation David Booth, Ph.D. (Consultant) W3C Linked Enterprise Data Patterns Workshop 7-Dec-2011.
CC La Web de Datos Primavera 2017 Lecture 7: SPARQL [i]
Keyword Search over RDF Graphs
Triple Stores.
Light-weight Ontology Versioning with Multi-temporal RDF Schema
Semantic testing in oneM2M
SPARQL SPARQL Protocol and RDF Query Language
Query Rewriting Framework for Spatial Data
Spatio-temporal Pattern Queries
Logics for Data and Knowledge Representation
CC La Web de Datos Primavera 2016 Lecture 7: SPARQL (1.0)
Multi-temporal RDF Ontology Versioning
Lu Xing CS59000GDM Sept 7th, 2018.
Evaluating Expressions
CC La Web de Datos Primavera 2018 Lecture 8: SPARQL [1.1]
Triple Stores.
On Provenance of Queries on Linked Web Data
Presentation transcript:

Applied Temporal RDF: Efficient Temporal Querying using SPARQL Jonas Tappolet and Abraham Bernstein ESWC 2009

Motivation Usually, data is not valid forever! isA dayOfBirth dayOfDeath

Motivation residedIn residencyEnd residencyStart Usually, data is not valid forever! residency location

Motivation isA residedIn Time as part of the data model (literals) Versioned Graphs Time as dimension (Gutierrez et al., 2005) – Reification – Named Graphs

Graphset The Format &G1 owltime:hasBeginning &G1 owltime:hasEnd &G2 owltime:hasBeginning G2 owltime:hasEnd NOW. &G1 owltime:intervalOverlaps &G2. … &G1 &G2&G3 Default Graph

Temporal RDF Graph Algorithm Insert Retrieve validity information of triple Check whether interval is already present If not, create new named graph (assign URI) insert meta data Insert triple into appropriate named graph Retrieve validity information of triple Check whether interval is already present If not, create new named graph (assign URI) insert meta data Insert triple into appropriate named graph

Temporal RDF Graph Algorithm Update Retrieve validity information of triple Try to find triple in graphset If found, remove triple from named graph If named graph empty now, remove named graph Check whether new interval is already present If not, create new named graph (assign URI) insert meta data Insert triple into appropriate named graph Retrieve validity information of triple Try to find triple in graphset If found, remove triple from named graph If named graph empty now, remove named graph Check whether new interval is already present If not, create new named graph (assign URI) insert meta data Insert triple into appropriate named graph

Datasets for Evaluation Data SourceTime ModelData Period# Triples# Intervals EvoOnt*Versioned graphs millions2505 Swiss Parliamentarians** Encoded in data model ’00038’182 * EvoOnt: Software history of an Eclipse Subproject (306 versions) ** Parliamentarians: Swiss Parliamentarians with date of birth and death as well as start and end years of their service periods. * EvoOnt: Software history of an Eclipse Subproject (306 versions) ** Parliamentarians: Swiss Parliamentarians with date of birth and death as well as start and end years of their service periods.

Queries No extensions to existing syntax and format made: out-of-the-box SPARQL Two types of queries: timepoint and temporal queries τ-SPARQL syntax simplifies understanding and composing of queries No extensions to existing syntax and format made: out-of-the-box SPARQL Two types of queries: timepoint and temporal queries τ-SPARQL syntax simplifies understanding and composing of queries

Timepoint Queries Example in classic SPARQL and τ-SPARQL SELECT ?person ?councilName WHERE{ GRAPH ?g { ?person gov:memberOf ?councilName. }. ?g time:hasBeginning ?start. ?start time:inInteger ?s. FILTER(?s <= 1995 || ?s = 'NOW'). ?g time:hasEnd ?end. ?end time:inInteger ?e. FILTER(?e >= 1995 || ?e = 'EVER'). } SELECT ?person ?councilName WHERE{ GRAPH ?g { ?person gov:memberOf ?councilName. }. ?g time:hasBeginning ?start. ?start time:inInteger ?s. FILTER(?s <= 1995 || ?s = 'NOW'). ?g time:hasEnd ?end. ?end time:inInteger ?e. FILTER(?e >= 1995 || ?e = 'EVER'). } SELECT ?person ?councilName FROM TIMEPOINT 1995 WHERE{ ?person gov:memberOf ?councilName. } SELECT ?person ?councilName FROM TIMEPOINT 1995 WHERE{ ?person gov:memberOf ?councilName. } KB can be preprocessed! Run query pattern only against intervals that are valid in the asked timepoint

KeyTree Index Derived from Time Index [Elmasri 1988] Variable Key distance Similar to mpeg compression: Key Frames and Deltas i3 i6 i5 i2i1 i4 i1 i1, i4, i6 i2, i6i5, i6i6 i2, i6 + i5 time

Timepoint Query Evaluation Execution time of queries to retrieve all triples in a specific timepoint (multiple runs, averaged) Native format query Temporal format query Temporal format query & keyTree Index Parliamentarians DatasetEvoOnt Dataset

Temporal Queries Query Rewriting: Quad Patterns [?b, ?e] ?s ?p ?o. Rewritten to: GRAPH ?g{ ?s ?p ?o. } ?g owltime:hasBeginning ?b. ?g owltime:hasEnd ?e. Bound to the graph URI Bound to the interval’s start time Bound to the interval’s end time

Temporal Queries – Interval Relations [?b, ?d] ?person hasName ‘Albert Einstein’. [?birth, ?death] ?other a Person. [?b, ?d] owltime:intervalOverlaps [?birth, ?death] Rewritten to: GRAPH ?g1{ ?person hasName ‘Albert Einstein’. } GRAPH ?g2{?other a Person.} ?g1 owltime:intervalOverlaps ?g2. ?g1 owltime:hasBeginning ?b. … People that lived during Albert Einstein’s lifetime

Temporal Query Evaluation Versioned Graph (EvoOnt) approach not suitable for temporal queries!

Conclusions Temporal graphs using out-of-the-box Semantic Web tools The temporal format can vastly reduce the # of triples by removing redundancies τ-SPARQL syntax facilitates query writing and can be mapped to standard SPARQL The temporal format can increase the expressivity of a dataset

Discussion

Interval Visualization

keyTree Index Evaluation (EvoOnt)

keyTree Evaluation