A Framework for Top-K Queries over Weighted RDF Graphs
| Abstract | The Resource Description Framework (RDF) is a specification that aims to support the conceptual modeling of metadata or information about resources in the form of a directed graph composed of triples of knowledge (facts). RDF also provides mechanisms to encode meta-information (such as source, trust, and certainty) about facts already existing in a knowledge base through a process called reification. In this thesis, an extension to the current RDF specification is proposed in order to enhance RDF triples with an application specific weight (cost). Unlike reification, this extension treats these additional weights as first class knowledge attributes in the RDF model, which can be leveraged by the underlying query engine. Additionally, curren... (more) |
|---|---|
| Created Date | 2010 |
| Contributor | Cedeno, Juan Pablo (Author) / Candan, Kasim S (Advisor) / Chen, Yi (Committee member) / Sapino, Maria L (Committee member) / Arizona State University (Publisher) |
| Subject | Computer Science / database / optimization / query / RDF / top-k |
| Type | Masters Thesis |
| Extent | 105 pages |
| Language | English |
| Copyright |
|
| Reuse Permissions | All Rights Reserved |
| Note | M.S. Computer Science 2010 |
| Collaborating Institutions | Graduate College / ASU Library |
| Additional Formats | MODS / OAI Dublin Core / RIS |
×
Image Label
