DOCSLIB.ORG

XML-Based RDF Data Management for Efficient Query Processing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
XML-Based RDF Data Management for Efficient Query Processing XML-Based RDF Data Management for Efficient Query Processing Mo Zhou Yuqing Wu Indiana University, USA Indiana University, USA [email protected] [email protected] Abstract SPARQL[17] is a W3C recommended RDF query language. A The Semantic Web, which represents a web of knowledge, offers SPARQL query contains a collection of triples with variables called new opportunities to search for knowledge and information. To simple access patterns which form graph patterns for describing harvest such search power requires robust and scalable data repos- query requirements. For SELECT ?t example, the SPARQL itories that can store RDF data and support efficient evaluation of WHERE {?p type Person. ?r ?x ?t. SPARQL queries. Most of the existing RDF storage techniques rely ?p name ?n. ?p write ?r} query on the left re- on relation model and relational database technologies for these trieves all properties of tasks. They either keep the RDF data as triples, or decompose it reviews written by a person whose name is known. into multiple relations. The mis-match between the graph model The needs to develop applications on the Semantic Web and sup- of the RDF data and the rigid 2D tables of relational model jeop- port search in RDF graphs call for RDF repositories to be reliable, ardizes the scalability of such repositories and frequently renders a robust and efficient in answering SPARQL queries. As in the con- repository inefficient for some types of data and queries. We pro- text of RDB and XML, the selection of storage models is critical to pose to decompose RDF graph into a forest of semantically cor- a data repository as it is the dominating factor to determine how to related XML trees, store them in an XML repository and rewrite evaluate queries and how the system behaves when it scales up. SPARQL queries into XPath/XQuery queries to be evaluated in the 1.1 Related Works XML repository. In this paper, we discuss the basic idea of RDF- Most of the existing RDF data repositories [1, 8, 9, 19] rely on to-XML decomposition and the criteria of such decomposition in relational models for data storage and evaluate SPARQL queries term of correctness, redundancy and query efficiency, then propose by rewriting them into SQL queries and then executing them in two RDF-to-XML decomposition algorithms based on these crite- the RDB engine. Among them there are two major directions: ria. Our experimental evaluation results illustrate that our approach (1) keeping the simple triple data model of RDF data, e.g. triple is capable of improving both the storage efficiency and query pro- store [8, 19]; and (2) decomposing RDF triples into relations, either cessing efficiency compared to the existing RDF techniques. based on predicates, e.g. vertical partition or based on semantics, e.g. property table [9]. 1. INTRODUCTION 1HV888 :`7 The triple store does not scale well as the evaluation of a com- V6 J:IV plex SPARQL query invokes many self-joins. Various indexing RDF (Resource Description Frame- ` 1`1 V ] 7]V 7]V techniques [13, 15, 16, 21] were proposed as remedies, at the cost work) [14] is a W3C recommended V01V1 `: V `: V V`QJ 7]V 1`1 V 7]V of huge increase in storage space and decrease in the scalability language for describing linked data ` ] of the Semantic Web in the form of `: V and update efficiency. The vertical partition [1] works well for V6 J:IV triples. RDFS (RDF schema) [7] ex- QQR888 :7 SPARQL queries when all predicates in the WHERE clause are tends RDF vocabularies to define the ^:_R: : known. Otherwise, all tables have to be accessed and results unioned. 1`1 V For example, the RDF data in Fig. 1(a) are stored in five tables. All structure of underlying RDF data, as V01V1 V`QJ well as taxonomic hierarchies of con- V6 `: V J:IV need to be accessed to evaluate the SPARQL query above. The cepts and relations. Both RDF data `1J$ ^G_H.VI: `1J$ property table incurs small number of joins for some queries be- and schema can be represented as Figure 1: Example cause a selection in one property table can match multiple simple graphs, as shown in Fig. 1. The flex- RDF data/schema access patterns. However it suffers storage redundancy and large ibility, simplicity and expressiveness of the Semantic Web evoke overhead in query evaluation [1]. For instance, the RDF data in extensive exploitation of RDF/RDFS in many areas such as bio- Fig. 1 are stored in two tables, Person and Review. Both are ac- informatics and social networks. cessed to evaluate the SPARQL query above because of the predi- cate variable ?x and variable ?r whose class cannot be determined in the time of query-rewrite. An alternative approach [3] preserves the graph nature of RDF Permission to make digital or hard copies of all or part of this work for data by storing RDF graphs in an object-relational database. How- personal or classroom use is granted without fee provided that copies are ever, this separates the RDF schema and RDF primary data, which not made or distributed for profit or commercial advantage and that copies brings difficulties in evaluating queries containing both schema and bear this notice and the full citation on the first page. To copy otherwise, to data instances. republish, to post on servers or to redistribute to lists, requires prior specific The proposal of serializing RDF graph into XML trees to utilize permission and/or a fee. WebDB ’10 Indianapolis, IN USA existing XML technologies [4, 10, 20] focuses on representing all Copyright 2010 ACM 978-1-4503-0186-2/10/06 ...$10.00. RDF features such as blank node in XML, but pays less or no at- tention to the efficiency of RDF data storage and query evaluation. ² We define the RDF-to-XML decomposition and identify the It either leads to XML data [20] with large redundancy or flat XML criteria for measuring the goodness of a decomposition. data [10] that cannot take full advantage of XML query evaluation ² We propose two RDF-to-XML algorithms for decomposing techniques. For example, [10] would serialize the RDF graph in RDF data into XML documents, with the second algorithm Fig. 1 into a 3-level xml tree and the evaluation of our example taking workload into consideration to further improve the query requires eight structural joins and one value join. query performance. 1.2 Our Proposal ² We discusse the query rewrite strategies for rewriting SPARQL We summarize the desired properties of an RDF storage model queries into XPath/XQuery queries. to be as follows: (1) preserving semantics to facilitate efficient ² We report on experiments to better understand the storage evaluation of RDF queries; (2) high performance in evaluating all footprint of our approach, as well as the query performance SPARQL queries rather than only some types of SPARQL queries; for various types of SPARQL queries. (3) high scalability powered by no or small storage redundancy; and (4) small overhead in query rewrite and query optimization. 2. RDF-TO-XML DECOMPOSITION Semi-structured data model organizes data entries in a tree struc- 2.1 RDF data and queries ture and represents the semantic relationships among them via con- tainment relationships. Tree pattern matching is at the core of the We represent RDF data in the form of a node and edge labeled query languages for XML, e.g. XPath[12] and XQuery[11]. We graph: R = (VR; EdR; ¸R) where ¸R is a labeling function that observe the similarity between RDF and XML, in terms of data maps items in VR [ EdR into a finite set of labels and literals. representation (e.g. using links to represent relationships among We further distinguish RDF schema Rs from RDF data Rd, with R = (V ; Ed ; ¸ ) representing the class nodes and proper- data instances) and query (e.g. tree pattern matching in XML and s Rs Rs R ties between classes, and R = (V ; Ed ; ¸ ) representing the graph pattern matching in RDF), and propose to leverage the so- d Rd Rd R phisticated storage management and query evaluation techniques data instances and properties between instances. In particular, in of XML data repositories, such as [2, 6], to store and query RDF Rs, we call labels associated with nodes the class labels such as data. Specifically we propose to de- Person and Review in Fig. 1(b), and labels associated with edges R: :LH.VI: compose RDF data into XML doc- the predicate labels such as Write and Rate in Fig. 1(b). Please :JR %II:`7 1J`Q8 _%V`7 note that V [ V = V , but Ed [ Ed 6= Ed as there uments guided by RDF schema and Rs Rd R Rs Rd R exist edges between class nodes and instance nodes in R indicating :]]1J$ summary information of RDF data ex- H.VI:LR: : %V`7 `V1`1 V VHQI]Q1 1QJ the types of the instances. Q`@CQ:R tracted from the RDF data, store the A SPARQL [17] query is frequently represented as graph pat- RQH : .L%V`7 _%V`7 XML documents in an XML reposi- terns that are formed by connecting a collection of simple access %V`7 !0:C8 tory and rewrite SPARQL queries into `V]Q 1 Q`7 patterns in the query’s WHERE clause. The connection between `V%C XPath/XQuery queries to be evaluated against the XML data using the lat- two simple access patterns with the same variable on their sub- jects is usually referred to the SS join.
Load more

Recommended publications
  • Semantics Developer's Guide
    MarkLogic Server Semantic Graph Developer’s Guide 2 MarkLogic 10 May, 2019 Last Revised: 10.0-8, October, 2021 Copyright © 2021 MarkLogic Corporation. All rights reserved. MarkLogic Server MarkLogic 10—May, 2019 Semantic Graph Developer’s Guide—Page 2 MarkLogic Server Table of Contents Table of Contents Semantic Graph Developer’s Guide 1.0 Introduction to Semantic Graphs in MarkLogic ..........................................11 1.1 Terminology ..........................................................................................................12 1.2 Linked Open Data .................................................................................................13 1.3 RDF Implementation in MarkLogic .....................................................................14 1.3.1 Using RDF in MarkLogic .........................................................................15 1.3.1.1 Storing RDF Triples in MarkLogic ...........................................17 1.3.1.2 Querying Triples .......................................................................18 1.3.2 RDF Data Model .......................................................................................20 1.3.3 Blank Node Identifiers ..............................................................................21 1.3.4 RDF Datatypes ..........................................................................................21 1.3.5 IRIs and Prefixes .......................................................................................22 1.3.5.1 IRIs ............................................................................................22
    [Show full text]
  • RDF Query Languages Need Support for Graph Properties
    RDF Query Languages Need Support for Graph Properties Renzo Angles1, Claudio Gutierrez1, and Jonathan Hayes1,2 1 Dept. of Computer Science, Universidad de Chile 2 Dept. of Computer Science, Technische Universit¨at Darmstadt, Germany {rangles,cgutierr,jhayes}@dcc.uchile.cl Abstract. This short paper discusses the need to include into RDF query languages the ability to directly query graph properties from RDF data. We study the support that current RDF query languages give to these features, to conclude that they are currently not supported. We propose a set of basic graph properties that should be added to RDF query languages and provide evidence for this view. 1 Introduction One of the main features of the Resource Description Framework (RDF) is its ability to interconnect information resources, resulting in a graph-like structure for which connectivity is a central notion [GLMB98]. As we will argue, basic concepts of graph theory such as degree, path, and diameter play an important role for applications that involve RDF querying. Considering the fact that the data model influences the set of operations that should be provided by a query language [HBEV04], it follows the need for graph operations support in RDF query languages. For example, the query “all relatives of degree 1 of Alice”, submitted to a genealogy database, amounts to retrieving the nodes adjacent to a resource. The query “are suspects A and B related?”, submitted to a police database, asks for any path connecting these resources in the (RDF) graph that is stored in this database. The query “what is the Erd˝osnumber of Alberto Mendelzon”, submitted to (a RDF version of) DBLP, asks simply for the length of the shortest path between the nodes representing Erd˝osand Mendelzon.
    [Show full text]
  • Web and Semantic Web Query Languages: a Survey
    Web and Semantic Web Query Languages: A Survey James Bailey1, Fran¸coisBry2, Tim Furche2, and Sebastian Schaffert2 1 NICTA Victoria Laboratory Department of Computer Science and Software Engineering The University of Melbourne, Victoria 3010, Australia http://www.cs.mu.oz.au/~jbailey/ 2 Institute for Informatics,University of Munich, Oettingenstraße 67, 80538 M¨unchen, Germany http://pms.ifi.lmu.de/ Abstract. A number of techniques have been developed to facilitate powerful data retrieval on the Web and Semantic Web. Three categories of Web query languages can be distinguished, according to the format of the data they can retrieve: XML, RDF and Topic Maps. This ar- ticle introduces the spectrum of languages falling into these categories and summarises their salient aspects. The languages are introduced us- ing common sample data and query types. Key aspects of the query languages considered are stressed in a conclusion. 1 Introduction The Semantic Web Vision A major endeavour in current Web research is the so-called Semantic Web, a term coined by W3C founder Tim Berners-Lee in a Scientific American article describing the future of the Web [37]. The Semantic Web aims at enriching Web data (that is usually represented in (X)HTML or other XML formats) by meta-data and (meta-)data processing specifying the “meaning” of such data and allowing Web based systems to take advantage of “intelligent” reasoning capabilities. To quote Berners-Lee et al. [37]: “The Semantic Web will bring structure to the meaningful content of Web pages, creating an environment where software agents roaming from page to page can readily carry out sophisticated tasks for users.” The Semantic Web meta-data added to today’s Web can be seen as advanced semantic indices, making the Web into something rather like an encyclopedia.
    [Show full text]
  • Answering SPARQL Queries Modulo RDF Schema with Paths Faisal Alkhateeb, Jérôme Euzenat
    Answering SPARQL queries modulo RDF Schema with paths Faisal Alkhateeb, Jérôme Euzenat To cite this version: Faisal Alkhateeb, Jérôme Euzenat. Answering SPARQL queries modulo RDF Schema with paths. [Research Report] RR-8394, INRIA. 2013, pp.46. hal-00904961 HAL Id: hal-00904961 https://hal.inria.fr/hal-00904961 Submitted on 15 Nov 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Answering SPARQL queries modulo RDF Schema with paths Faisal Alkhateeb, Jérôme Euzenat RESEARCH REPORT N° 8394 November 2013 Project-Teams Exmo ISSN 0249-6399 ISRN INRIA/RR--8394--FR+ENG Answering SPARQL queries modulo RDF Schema with paths Faisal Alkhateeb∗, Jérôme Euzenat† Project-Teams Exmo Research Report n° 8394 — November 2013 — 46 pages Abstract: SPARQL is the standard query language for RDF graphs. In its strict instantiation, it only offers querying according to the RDF semantics and would thus ignore the semantics of data expressed with respect to (RDF) schemas or (OWL) ontologies. Several extensions to SPARQL have been proposed to query RDF data modulo RDFS, i.e., interpreting the query with RDFS semantics and/or considering external ontologies. We introduce a general framework which allows for expressing query answering modulo a particular semantics in an homogeneous way.
    [Show full text]
  • A Comparison of RDF Query Languages
    A Comparison of RDF Query Languages Peter Haase1, Jeen Broekstra2, Andreas Eberhart1, Raphael Volz1 1Institute AIFB, University of Karlsruhe, D-76128 Karlsruhe, Germany haase, eberhart, volz @aifb.uni-karlsruhe.de f 2 g Vrije Universiteit Amsterdam, The Netherlands [email protected] Abstract. The purpose of this paper is to provide a rigorous compari- son of six query languages for RDF. We outline and categorize features that any RDF query language should provide and compare the individ- ual languages along these features. We describe several practical usage examples for RDF queries and conclude with a comparison of the expres- siveness of the particular query languages. The usecases, sample data and queries for the respective languages are available on the web1. 1 Introduction The Resource Description Framework (RDF) is considered to be the most rele- vant standard for data representation and exchange on the Semantic Web. The recent recommendation of RDF has just completed a major clean up of the initial proposal [9] in terms of syntax [1], along with a clarification of the un- derlying data model [8], and its intended interpretation [5]. Several languages for querying RDF documents and have been proposed, some in the tradition of database query languages (i.e. SQL, OQL), others more closely inspired by rule languages. No standard for RDF query language has yet emerged, but the dis- cussion is ongoing within both academic institutions, Semantic Web enthusiasts and the World Wide Web Consortium (W3C). The W3C recently chartered a working group2 with a focus on accessing and querying RDF data. We present a comparison of six representative query languages for RDF, highlighting their common features and differences along general dimensions for query languages and particular requirements for RDF.
    [Show full text]
  • Chapter 3 Querying RDF Stores with SPARQL
    Why an RDF Query Language? Chapter 3 l Why not use an XML query language? Querying RDF l XML at a lower level of abstraction than stores with RDF l There are various ways of syntactically SPARQL representing an RDF statement in XML l Thus we would require several XPath queries, e.g. – //uni:lecturer/uni:title if uni:title element – //uni:lecturer/@uni:title if uni:title attribute – Both XML representations equivalent! Enter SPARQL SPARQL Example l SPARQL Protocol and RDF Query Language PREFIX foaf: <http://xmlns.com/foaf/0.1/> l W3C began developing a spec for a query SELECT ?name ?age language in 2004 WHERE { l There were/are other RDF query languages, and ?person a foaf:Person. extensions, e.g., RQL, Jena’s ARQ, ?person foaf:name ?name. l SPARQL a W3C recommendation in 2008 ?person foaf:age ?age – Query language + protocol + xml result format } l SPARQL 1.1 currently a last-call working draft ORDER BY ?age DESC – Includes updates, aggregation functions, federation, … LIMIT 10 l Most triple stores support SPARQL 1 SPARQL Protocol, Endpoints, APIs SPARQL Basic Queries l SPARQL query language l SPARQL is based on matching graph patterns l SPROT = SPARQL Protocol for RDF l The simplest graph pattern is the triple pattern - – Among other things specifies how results can be ?person foaf:name ?name encoded as RDF, XML or JSON - Like an RDF triple, but variables can be in any position l SPARQL endpoint - Variables begin with a question mark – A service that accepts queries and returns results via HTTP l Combining triple patterns gives a graph pattern; an exact match to a graph is needed – Either generic (fetching data as needed) or specific (querying an associated triple store) l Like SQL, a set of results is returned, not just one – May be a service for federated queries Turtle Like Syntax Optional Data As in N# and Turtle, we can omit a common subject l The query fails unless the entire patter matches in a graph pattern.
    [Show full text]
  • On Querying Ontologies with Contextual Logic Programming
    On Querying Ontologies with Contextual Logic Programming Cl´audio Fernandes, Nuno Lopes, and Salvador Abreu Universidade de Evora´ Abstract. We describe a system in which Contextual Logic Program- ming is used as a mediator for knowledge modeled by ontologies. Our system provides the components required to behave as a SPARQL query engine and, as a result of its Logic Programming heritage, it may also recursively interrogate other ontologies or data repositories, providing a semantic integration of multiple sources. 1 Introduction The Semantic Web topic currently represents one of the most active and ex- citing research areas in computer science. As the originator and mentor of this vision Tim Berners-Lee puts it [5], the Semantic Web is a natural evolution of the Internet and, hopefully, will provide the foundations for the emergence of intelligent systems and agent layers over the world wide web. The standard web page provides data oriented for human comprehension, which means a computer agent cannot intelligently reason about that information. The Semantic Web thrives the creation of information technology that will allow explicit machine- processable meta-data documents that describes the meaning and semantics of the data published in the Web. One important step towards the fulfilling of this vision is the emergence of systems that cannot only understand and reason over Semantic Web documents but also retrieve and process knowledge of multiple information sources. This represents the motivation and purpose of our work which is to use contextual con- straint logic programming [1] as a framework for Semantic Web agents, in which knowledge representation and reasoning for ontology documents can be carried out.
    [Show full text]
  • Introduction to RDF & SPARQL
    OPEN Presentation DATA metadata SUPPORT Open Data Support is Training Module 1.3 funded by the European Commission under SMART 2012/0107 ‘Lot 2: Provision of services for the Publication, Access and Reuse of Open Introduction to RDF & Public Data across the European Union, through existing open data SPARQL portals’(Contract No. 30-CE- 0530965/00-17). © 2014 European Commission OPEN DATASUPPORT Slide 1 Learning objectives By the end of this training module you should have an understanding of: • The Resource Description Framework (RDF). • How to write/read RDF. • How you can describe your data with RDF. • What SPARQL is. • The different types of SPARQL queries. • How to write a SPARQL query. OPEN DATASUPPORT Slide 2 Content This module contains ... • An introduction to the Resource Description Framework (RDF) for describing your data. - What is RDF? - How is it structured? - How to represent your data in RDF. • An introduction to SPARQL on how you can query and manipulate data in RDF. • Pointers to further reading, examples and exercises. OPEN DATASUPPORT Slide 3 Resource Description Framework An introduction on RDF. OPEN DATASUPPORT Slide 4 RDF in the stack of Semantic Web technologies • RDF stands for: - Resource: Everything that can have a unique identifier (URI), e.g. pages, places, people, dogs, products... - Description: attributes, features, and relations of the resources - Framework: model, languages and syntaxes for these descriptions • RDF was published as a W3C recommendation in 1999. • RDF was originally introduced as a data
    [Show full text]
  • Graph Databases for Beginners Bryce Merkl Sasaki, Joy Chao & Rachel Howard
    The #1 Platform for Connected Data EBOOK Graph Databases for Beginners Bryce Merkl Sasaki, Joy Chao & Rachel Howard neo4j.com The #1 Platform for Connected Data Ebook TABLE OF CONTENTS Introduction 1 Graph Databases Graphs Are the Future 2 For Beginners Why Data Relationships Matter 4 Bryce Merkl Sasaki, Joy Chao & Rachel Howard Data Modeling Basics 6 Data Modeling Pitfalls to Avoid 9 Introduction: Welcome to the World of Graph Technology Why a Database Query So you’ve heard about graph databases and you want to know what all the buzz is about. Are Language Matters 13 they just a passing trend — here today and gone tomorrow – or are they a rising tide your business and your development team can’t afford to pass up? Imperative vs. Declarative Query Languages 19 Whether you’re a business executive or a seasoned developer, something — maybe a business challenge or a task your current database can’t handle — has led you on the quest to learn more about graphs and what they can do. Graph Theory & Predictive Modeling 21 In this Graph Databases For Beginners ebook, we’ll take you through the basics of graph technology assuming you have little (or no) background in the technology. We’ll also include some useful tips that will help you if you decide to make the switch to Neo4j. Graph Search Algorithm Basics 24 Before we dive in, what is it that makes graphs not only relevant, but necessary in today’s world? The first is its focus onrelationships . Collectively we are gathering more data than ever before, but more and more frequently it’s how that data is related that is truly important.
    [Show full text]
  • Foundations of Modern Query Languages for Graph Databases1
    A Foundations of Modern Query Languages for Graph Databases1 RENZO ANGLES, Universidad de Talca & Center for Semantic Web Research MARCELO ARENAS, Pontificia Universidad Católica de Chile & Center for Semantic Web Research PABLO BARCELÓ, DCC, Universidad de Chile & Center for Semantic Web Research AIDAN HOGAN, DCC, Universidad de Chile & Center for Semantic Web Research JUAN REUTTER, Pontificia Universidad Católica de Chile & Center for Semantic Web Research DOMAGOJ VRGOCˇ , Pontificia Universidad Católica de Chile & Center for Semantic Web Research We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge-labelled graphs, where nodes are connected by directed, labelled edges; and prop- erty graphs, where nodes and edges can further have attributes. Next we discuss the two most fundamental graph querying functionalities: graph patterns and navigational expressions. We start with graph patterns, in which a graph-structured query is matched against the data. Thereafter we discuss navigational expres- sions, in which patterns can be matched recursively against the graph to navigate paths of arbitrary length; we give an overview of what kinds of expressions have been proposed, and how they can be combined with graph patterns. We also discuss several semantics under which queries using the previous features can be evaluated, what effects the selection of features and semantics has on complexity, and offer examples of such features in three modern languages that are used to query graphs: SPARQL, Cypher and Gremlin. We conclude by discussing the importance of formalisation for graph query languages; a summary of what is known about SPARQL, Cypher and Gremlin in terms of expressivity and complexity; and an outline of possible future directions for the area.
    [Show full text]
  • Foundations of Data Engineering
    Other Data Models Data Models X Relational X Key-Value • XML • JSON • RDF • Graph 1 / 41 Other Data Models XML Extensible Markup Language • Goal: human-readable and machine-readable • For semi-structured (without schema) and structured data (with schema) • XML languages: RSS, XHTML, SVG, .xlsx files, . • Unicode 2 / 41 Other Data Models XML Example <?xml version="1.0" encoding="ISO-8859-1"?> XML declaration <university name="TUM" address="Arcisstraße 21"> Element <faculties> <faculty>IN</faculty> <faculty>MA</faculty> <!-- and more --> Comment </faculties> Empty-element tag, <president name="Wolfgang Herrmann" /> </university> with an attribute Well-formedness • XML documents have a single root, i.e. are one hierarchy • Tags may not overlap (<a><b></a></b>) 3 / 41 Other Data Models XML Querying and Validation Querying • Declarative querying I XML Path Language (XPath), for simple access I XML Query (XQuery), for CRUD operations, query language for XML databases • Tree-traversal querying I Document Object Model (DOM) Validation requires a definition of validness, i.e. a schema/grammar • Document Type Definition (DTD), old and simple • XML Schema (XSD), more powerful, but rarely used 4 / 41 Other Data Models XML XPath axis::node[predicate]/@attr /university[@name="LMU"] → empty set //faculty/text() → IN, MA //president/@name → name="Wolfgang Herrmann" 5 / 41 Other Data Models XML Activity Load a dataset and prepare your environment: • Install the command-line tool xmllint. We will use this syntax: xmllint --xpath ’<xpath expression>’ <filename> • Download TUM’s news feed from https://www.tum.de/nc/en/about-tum/news/?type=100. Familiarize yourself with the document’s structure. Use XPath to answer the following questions: • List all titles.
    [Show full text]
  • The XML and Semantic Web Worlds: Technologies, Interoperability and Integration
    1 The XML and Semantic Web Worlds: Technologies, Interoperability and Integration. A Survey of the State of the Art * Nikos Bikakis1 • Chrisa Tsinaraki2 • Nektarios Gioldasis2 • Ioannis Stavrakantonakis2 • Stavros Christodoulakis2 1 National Technical University of Athens, Greece & Institute for the Management of Information Systems, "Athena" Research Center, Greece. e-mail: [email protected] 2 Lab. of Distributed Multimedia Information Systems & Applications, Technical University of Crete, Greece. e-mail: {chrisa, nektarios, gstavrak, stavros}@ced.tuc.gr Abstract In the context of the emergent Web of Data, a large number of organizations, institutes and companies (e.g., DBpedia, Geonames, PubMed ACM, IEEE, NASA, BBC) adopt the Linked Data practices and publish their data utilizing Semantic Web (SW) technologies. On the other hand, the dominant standard for information exchange in the Web today is XML. Many international standards (e.g., Dublin Core, MPEG-7, METS, TEI, IEEE LOM) have been expressed in XML Schema resulting to a large number of XML datasets. The SW and XML worlds and their developed infrastructures are based on different data models, semantics and query languages. Thus, it is crucial to provide interoperability and integration mechanisms to bridge the gap between the SW and XML worlds. In this chapter, we give an overview and a comparison of the technologies and the standards adopted by the XML and SW worlds. In addition, we outline the latest efforts from the W3C groups, including the latest working drafts and recommendations (e.g., OWL 2, SPARQL 1.1, XML Schema 1.1). Moreover, we present a survey of the research approaches which aim to provide interoperability and integration between the XML and SW worlds.
    [Show full text]