Diamond : a Rete-match linked data SPARQL environment
Diamond is a SPARQL query engine for linked data. Linked data is a sub-topic of the Semantic Web where data is represented as a labeled directed graph using the Resource Description Framework (RDF), a conceptual data model for web resources, to affect a web-wide interconnected, distributed labeled g...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/ETD-UT-2010-12-2546 |
id |
ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-ETD-UT-2010-12-2546 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-ETD-UT-2010-12-25462015-09-20T16:57:31ZDiamond : a Rete-match linked data SPARQL environmentDepena, Rodolfo KaplanSemantic WebSPARQLLinked dataRete matchPattern matchingDiamond is a SPARQL query engine for linked data. Linked data is a sub-topic of the Semantic Web where data is represented as a labeled directed graph using the Resource Description Framework (RDF), a conceptual data model for web resources, to affect a web-wide interconnected, distributed labeled graph. SPARQL graph patterns entail portions of this distributed graph. Diamond compiles SPARQL queries into a physical query plan based on a set of newly defined operators that implement a new variant of the Rete match, a well known artificial intelligence (AI) algorithm used for complex pattern-matching problems.text2011-02-14T19:42:52Z2011-02-14T19:43:21Z2011-02-14T19:42:52Z2011-02-14T19:43:21Z2010-122011-02-14December 20102011-02-14T19:43:21Zthesisapplication/pdfhttp://hdl.handle.net/2152/ETD-UT-2010-12-2546eng |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Semantic Web SPARQL Linked data Rete match Pattern matching |
spellingShingle |
Semantic Web SPARQL Linked data Rete match Pattern matching Depena, Rodolfo Kaplan Diamond : a Rete-match linked data SPARQL environment |
description |
Diamond is a SPARQL query engine for linked data. Linked data is a sub-topic of the Semantic Web where data is represented as a labeled directed graph using the Resource Description Framework (RDF), a conceptual data model for web resources, to affect a web-wide interconnected, distributed labeled graph. SPARQL graph patterns entail portions of this distributed graph. Diamond compiles SPARQL queries into a
physical query plan based on a set of newly defined operators that implement a new variant of the Rete match, a well known artificial intelligence (AI) algorithm used for complex pattern-matching problems. === text |
author |
Depena, Rodolfo Kaplan |
author_facet |
Depena, Rodolfo Kaplan |
author_sort |
Depena, Rodolfo Kaplan |
title |
Diamond : a Rete-match linked data SPARQL environment |
title_short |
Diamond : a Rete-match linked data SPARQL environment |
title_full |
Diamond : a Rete-match linked data SPARQL environment |
title_fullStr |
Diamond : a Rete-match linked data SPARQL environment |
title_full_unstemmed |
Diamond : a Rete-match linked data SPARQL environment |
title_sort |
diamond : a rete-match linked data sparql environment |
publishDate |
2011 |
url |
http://hdl.handle.net/2152/ETD-UT-2010-12-2546 |
work_keys_str_mv |
AT depenarodolfokaplan diamondaretematchlinkeddatasparqlenvironment |
_version_ |
1716821630539268096 |