Loading...
Please wait, while we are loading the content...
Similar Documents
Querying Graph Structured Rdf Data
| Content Provider | Semantic Scholar |
|---|---|
| Author | Qiao, Shi |
| Copyright Year | 2016 |
| Abstract | Providing an efficient and expressive querying technique for graph structured RDF data is an emergent problem as large amounts of RDF data are available from applications in many areas. Current techniques do not fully satisfy this goal due to the nature of the RDF model which requires highly flexible use of keywords, and a structure expression in query language. Viewing RDF as graphs requires additional graph-based functionalities, such as querying a path or a tree connection. We propose a querying framework, called RDF-h, which uses the query template as a basic query unit, and supports both partially entered keywords and query conditions based on graph-structure. In order to provide efficient query evaluation, signature-based index is utilized. Though most existing techniques which utilize signature-based index claim its benefits on all datasets and queries. The effectiveness of signature-based pruning varies greatly among different RDF datasets and highly related with their dataset characteristics. The performance benefits from signature-based pruning depend not only on the size of the RDF graphs, but also the underlying graph structure and the complexity of queries. We |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://etd.ohiolink.edu/!etd.send_file?accession=case1447198654&disposition=inline |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
