Matches in ScholarlyData for { ?s ?p ?o. }
- 26 creator yannis-kotidis.
- 26 type InProceedings.
- 26 label "Optimizing Query Shortcuts in RDF Databases".
- 26 sameAs 26.
- 26 abstract "The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessitates the development of specialized data management techniques, such as the use of shortcuts in the place of path queries. In this paper we deal with the problem of selecting the most beneficial shortcuts that reduce the execution cost of path queries in RDF databases given a space constraint. We first demonstrate that this problem is an instance of the quadratic knapsack problem. Given the computational complexity of solving such problems, we then develop an alternative formulation based on a bi-criterion linear relaxation, which essentially seeks to minimize a weighted sum of the query cost and of the required space consumption. As we demonstrate in this paper, this relaxation leads to very efficient classes of linear programming solutions. We utilize this bi-criterion linear relaxation in an algorithm that selects a subset of shortcuts to materialize. This shortcut selection algorithm is extensively evaluated and compared with a greedy algorithm that we developed in prior work. The reported experiments show that the linear relaxation algorithm manages to significantly reduce the query execution times, while also outperforming the greedy solution.".
- 26 hasAuthorList authorList.
- 26 isPartOf proceedings.
- 26 keyword "Path Queries".
- 26 keyword "Query Cost Reduction".
- 26 keyword "RDF Databases".
- 26 title "Optimizing Query Shortcuts in RDF Databases".
- 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 vicky-dritsou.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent panos-constantopoulos.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent antonios-deligiannakis.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent yannis-kotidis.
- item-4 previous item-3.
- 27 creator alejandro-vaisman.
- 27 creator carlos-hurtado.
- 27 creator claudio-gutierrez.
- 27 type InProceedings.
- 27 label "RDFS Update: from Theory to Practice".
- 27 sameAs 27.
- 27 abstract "There is a comprehensive body of theory studying updates and schema evolution of Knowledge bases, ontologies, and in particular of RDFS. In this paper we turn these ideas into practice by presenting a feasible and practical procedure for updating RDFS. Along the lines of ontology evolution, we treat schema and instance updates separately, showing that RDFS instance updates are not only feasible, but also deterministic. For RDFS schema update, known to be untractable in the general abstract case, we show that it becomes feasible in real world datasets. We present for both, instance and schema update, simple and feasible algorithms.".
- 27 hasAuthorList authorList.
- 27 isPartOf proceedings.
- 27 keyword "Ontology".
- 27 keyword "RDF".
- 27 keyword "RDFS".
- 27 keyword "Updates".
- 27 title "RDFS Update: from Theory to Practice".
- 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 claudio-gutierrez.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent alejandro-vaisman.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent carlos-hurtado.
- item-3 previous item-2.
- 32 creator alfio-ferrara.
- 32 creator heiner-stuckenschmidt.
- 32 creator jan-noessner.
- 32 creator stefano-montanelli.
- 32 type InProceedings.
- 32 label "Benchmarking Matching Applications on the Semantic Web".
- 32 sameAs 32.
- 32 abstract "The evaluation of matching applications is becoming a major issue in the semantic web and it requires a suitable methodological approach as well as appropriate benchmarks. In particular, in order to evaluate a matching application under different experimental conditions, it is crucial to provide a test dataset characterized by a controlled variety of different heterogeneities among data that rarely occurs in real data repositories. In this paper, we propose SWING (Semantic Web INstance Generation), a disciplined approach to the semi-automatic generation of benchmarks to be used for the evaluation of matching applications. SWING is illustrated in the paper by presenting the specific benchmark we generated for the international instance matching contest at OAEI 2010 (called IIMB 2010) and by discussing the experimental results obtained on it with different matching algorithms.".
- 32 hasAuthorList authorList.
- 32 isPartOf proceedings.
- 32 keyword "Evaluation".
- 32 keyword "Semantic Matching".
- 32 keyword "Semantic Web".
- 32 title "Benchmarking Matching Applications on the Semantic Web".
- 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 alfio-ferrara.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent stefano-montanelli.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent jan-noessner.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent heiner-stuckenschmidt.
- item-4 previous item-3.
- 49 creator kemafor-anyanwu.
- 49 creator ling-chen.
- 49 creator sidan-gao.