Diamond : a Rete-match linked data SPARQL environment
| dc.contributor.advisor | Miranker, Daniel P. | en |
| dc.contributor.committeeMember | Batory, Don S. | en |
| dc.creator | Depena, Rodolfo Kaplan | en |
| dc.date.accessioned | 2011-02-14T19:42:52Z | en |
| dc.date.available | 2011-02-14T19:42:52Z | en |
| dc.date.available | 2011-02-14T19:43:21Z | en |
| dc.date.issued | 2010-12 | en |
| dc.date.submitted | December 2010 | en |
| dc.date.updated | 2011-02-14T19:43:21Z | en |
| dc.description | text | en |
| dc.description.abstract | 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. | en |
| dc.description.department | Computer Science | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/2152/ETD-UT-2010-12-2546 | en |
| dc.language.iso | eng | en |
| dc.subject | Semantic Web | en |
| dc.subject | SPARQL | en |
| dc.subject | Linked data | en |
| dc.subject | Rete match | en |
| dc.subject | Pattern matching | en |
| dc.title | Diamond : a Rete-match linked data SPARQL environment | en |
| dc.type.genre | thesis | en |
| thesis.degree.department | Computer Sciences | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | University of Texas at Austin | en |
| thesis.degree.level | Masters | en |
| thesis.degree.name | Master of Science in Computer Sciences | en |