Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 type ListItem.
- item-3 hasContent john-p-mccrae.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent philipp-cimiano.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent maria-teresa-pazienza.
- item-5 previous item-4.
- 156 creator allel-hadjali.
- 156 creator geraud-fokou.
- 156 creator stephane-jean.
- 156 type InProceedings.
- 156 label "Intelligent and Efficient Techniques for RDF Query Relaxation".
- 156 sameAs 156.
- 156 abstract "This paper addresses the problem of failing RDF queries. Query relaxation is one of the cooperative techniques that allows providing user with alternative answers instead of an empty result. While previous work on query relaxation over RDF data have focused on defining new relaxation operators, in this paper techniques to find the parts of an RDF query which are responsible of its failure, are investigated. Finding such subqueries, named Minimal Failing Subqueries (MFS), is of great interest to efficiently perform the relaxation process. We propose two algorithmic approaches inspired by previous work conducted in the context of relational databases. The first approach (called LBA) intelligently leverages the lattice of subqueries of the initial RDF query while the second (called MBA) is based on a particular matrix that can be used to improve the performance of LBA. In addition, we also show how our approaches can compute maximal non-failing subqueries, called Maximal Success Subqueries (XSS). XSSs are subqueries with maximal number of triple patterns of the initial query that result in non-empty answers. To validate our approaches, a set of thorough experiments is conducted on the LUBM benchmark and a comparative study with other approaches is done.".
- 156 hasAuthorList authorList.
- 156 isPartOf proceedings.
- 156 keyword "Empty answers".
- 156 keyword "RDF Queries".
- 156 keyword "Relaxation".
- 156 keyword "Semantic Databases".
- 156 title "Intelligent and Efficient Techniques for RDF Query Relaxation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent geraud-fokou.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent stephane-jean.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent allel-hadjali.
- item-3 previous item-2.
- 171 creator dimitris-plexousakis.
- 171 creator evangelia-daskalaki.
- 171 creator georgia-troullinou.
- 171 creator haridimos-kondylakis.
- 171 type InProceedings.
- 171 label "RDF Digest: Efficient Summarization of RDF/S KBs".
- 171 sameAs 171.
- 171 abstract "The exponential growth of the web and the extended use of semantic web tech-nologies has brought to the fore the need for quick understanding, flexible explo-ration and selection of complex web documents and schemas. To this direction ontology summarization aspires to produce an abridged version of the original ontology that highlights the most representative concepts of it. In this paper, we present RDF Digest, a novel platform that automatically produces summaries of RDF/S Knowledge Bases. In our work, a summary is a valid RDF/S document that includes the most representative concepts of the schema adapted to the corre-sponding data instances. To construct this graph our algorithm exploits the se-mantics and the structure of the schema and the distribution of the corresponding data/instances as well. The performed evaluation demonstrates the benefits of our approach and the considerable advantages gained.".
- 171 hasAuthorList authorList.
- 171 isPartOf proceedings.
- 171 keyword "RDF/S Knowledge Bases".
- 171 keyword "Semantic Summaries".
- 171 keyword "Summary Graphs".
- 171 title "RDF Digest: Efficient Summarization of RDF/S KBs".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent georgia-troullinou.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent haridimos-kondylakis.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent evangelia-daskalaki.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent dimitris-plexousakis.
- item-4 previous item-3.
- 175 creator gong-cheng.
- 175 creator qingxia-liu.
- 175 creator yuzhong-qu.
- 175 type InProceedings.
- 175 label "On Coherent Indented Tree Visualization of RDF Graphs".
- 175 sameAs 175.
- 175 abstract "Indented tree has been widely used to organize information and visualize graph-structured data like RDF graphs. Given a starting resource in a cyclic RDF graph, there are different ways of transforming the graph into a tree representation to be visualized as an indented tree. It would be interesting to investigate whether and how these different representations influence the user's browsing experience. In this paper, we address this issue from the coherence aspect of tree representation. We aim to smooth the user's reading experience by visualizing an optimal indented tree in the sense of featuring the fewest reversed edges, which often cause confusion and interrupt the user's cognitive process due to lack of a general, effective way of presentation. To achieve this, we propose a two-step approach that is theoretically proved to generate such an optimal tree representation for a given RDF graph and a specified starting resource. We also empirically show the difference in coherence between tree representations of real-world RDF graphs generated by our approach and two baseline approaches that have been widely adopted. These different tree representations lead to significantly different user experience in our preliminary user study, which reports a considerable degree of dependence between coherence and user experience.".
- 175 hasAuthorList authorList.
- 175 isPartOf proceedings.
- 175 keyword "Browsing".
- 175 keyword "Coherence".
- 175 keyword "Indented tree".
- 175 keyword "RDF visualization".
- 175 title "On Coherent Indented Tree Visualization of RDF Graphs".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent qingxia-liu.
- item-1 next item-2.
- item-2 type ListItem.