LSPARQL: Transaction Time Queries in RDF

ResearchSpace Repository

Show simple item record

dc.contributor.advisor Weber, G en
dc.contributor.advisor Lutteroth, C en Bellamy-McIntyre, Jacob en 2020-03-29T23:13:01Z en 2020 en
dc.identifier.uri en
dc.description.abstract The Resource Description Framework (RDF) is a general framework for the standardised interchange of information over the semantic web by way of RDF triples. Specifying temporal information which describes when individual triples hold using standard RDF is convoluted, and temporal query evaluation is inefficient. While there has been work on developing temporal triple stores that address these issues, there is generally a large cost associated with migrating to a new triplestore, especially if that triplestore is not being actively maintained. In this PhD we propose a query language named LSPARQL and a query evaluation engine that partially sidesteps this issue by executing queries over a standard transaction log which are commonly supported by most triplestores. We provide a formal definition of the semantics of a log-based data model and of our query language. We describe a proof-of-concept implementation that demonstrates that the average triplestore could support transaction time temporal queries relatively easily without having to redesign their data model. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof PhD Thesis - University of Auckland en
dc.relation.isreferencedby UoA en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.rights.uri en
dc.title LSPARQL: Transaction Time Queries in RDF en
dc.type Thesis en Computer Science en The University of Auckland en Doctoral en PhD en
dc.rights.holder Copyright: The author en
dc.rights.accessrights en
pubs.elements-id 797129 en
pubs.record-created-at-source-date 2020-03-30 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record Except where otherwise noted, this item's license is described as


Search ResearchSpace

Advanced Search