{"id":{"repo_id":"auckland-ms","oai_identifier":"oai:researchspace.auckland.ac.nz:2292/50180"},"canonical_url":"https://search.dev.ndltd.org/etd/auckland-ms/oai:researchspace.auckland.ac.nz:2292/50180","repository":{"repo_id":"auckland-ms","name":"University of Auckland","base_url":"https://researchspace.auckland.ac.nz/server/oai/request"},"display":{"title":"LSPARQL: Transaction Time Queries in RDF","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Bellamy-McIntyre, Jacob"],"institution":"ResearchSpace@Auckland","degree_name":"PhD","degree_level":"Doctoral","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Weber, G","Lutteroth, C"],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-24T01:02:40Z","subjects":[],"languages":[],"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."],"rights_urls":["https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2292/50180","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Weber, G","Lutteroth, C"]},{"key":"dc:creator","label":"Author","values":["Bellamy-McIntyre, Jacob"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-03-29T23:13:01Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:publisher","label":"Institution","values":["ResearchSpace@Auckland"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["UoA99265307910402091"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["PhD"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The University of Auckland"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2292/50180"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["LSPARQL: Transaction Time Queries in RDF"]}]}],"canonical_facts":{"dc:contributor.advisor":["Weber, G","Lutteroth, C"],"dc:creator":["Bellamy-McIntyre, Jacob"],"dc:date.accessioned":["2020-03-29T23:13:01Z"],"dc:date.issued":["2020"],"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."],"dc:identifier.uri":["https://hdl.handle.net/2292/50180"],"dc:publisher":["ResearchSpace@Auckland"],"dc:relation.isreferencedby":["UoA99265307910402091"],"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."],"dc:rights.uri":["https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm"],"dc:title":["LSPARQL: Transaction Time Queries in RDF"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["PhD"],"thesis:institution_name":["The University of Auckland"]},"updated_at":"2026-07-24T01:02:40Z"}