Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent alessandro-adamou.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wernher-behrendt.
- item-2 previous item-1.
- 10 creator matthias-klusch.
- 10 creator ralf-steinmetz.
- 10 creator stefan-schulte.
- 10 creator ulrich-lampe.
- 10 type InProceedings.
- 10 label "COV4SWS.KOM: Information Quality-aware Matchmaking for Semantic Services".
- 10 sameAs 10.
- 10 abstract "The discovery of functionally matching services - often referred to as matchmaking - is one of the essential requirements for realizing the vision of the Internet of Services. In practice, however, the process is complicated by the varying quality of syntactic and semantic descriptions of service components. In this work, we propose COV4SWS.KOM, a semantic matchmaker that addresses this challenge through the automatic adaptation to the description quality on different levels of the service structure. Our approach performs very good with respect to common Information Retrieval metrics, achieving top placements in the renowned Semantic Service Selection Contest, and thus marks an important contribution to the discovery of services in a realistic application context.".
- 10 hasAuthorList authorList.
- 10 isPartOf proceedings.
- 10 keyword "Matchmaking".
- 10 keyword "Semantic Web Services".
- 10 keyword "Service Discovery".
- 10 title "COV4SWS.KOM: Information Quality-aware Matchmaking for Semantic Services".
- 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 stefan-schulte.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ulrich-lampe.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent matthias-klusch.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent ralf-steinmetz.
- item-4 previous item-3.
- 102 creator javier-d-fernandez.
- 102 creator mario-arias-gallego.
- 102 creator miguel-a-martinez-prieto.
- 102 type InProceedings.
- 102 label "Exchange and Consumption of Huge RDF Data".
- 102 sameAs 102.
- 102 abstract "Huge RDF datasets are currently exchanged on textual RDF formats, hence consumers need to post-process them through RDF stores for local consumption, such as reasoning/integration and SPARQL query. This results in a painful task which requires a great effort in terms of time and computational resources. A first approach to lightweight data exchange is a compact (binary) RDF serialization format called HDT. In this paper, we focus on enhancing the exchanged data in order to optimize the consumption without the need of "unpacking" the data. This is done by post-processing the HDT, enhancing the data with additional structures which allow basic forms of SPARQL queries. Experiments show that i) with an exchanging efficiency that outperforms universal compression, ii) post-processing now becomes a fast process which iii) provides competitive query performance at consumption.".
- 102 hasAuthorList authorList.
- 102 isPartOf proceedings.
- 102 keyword "RDF consumption".
- 102 keyword "RDF exchange".
- 102 keyword "RDF store".
- 102 keyword "SPARQL".
- 102 title "Exchange and Consumption of Huge RDF Data".
- 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 miguel-a-martinez-prieto.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent mario-arias-gallego.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent javier-d-fernandez.
- item-3 previous item-2.
- 110 creator andreas-harth.
- 110 creator andreas-wagner.
- 110 creator guenter-ladwig.
- 110 creator rudi-studer.
- 110 creator thanh-tran.
- 110 type InProceedings.
- 110 label "Top-K Linked Data Query Processing".
- 110 sameAs 110.
- 110 abstract "In recent years, top-k query processing has attracted much attention because in large-scale scenarios, computing only the $k$ best solutions is often sufficient and also, the only affordable way to reach acceptable response time. Top-k query processing has been dealt with in different contexts. One line of research targets the so-called join top-k, where the goal is to produce the k best final results through joining partial results. In this paper, we study join top-k in the Linked Data setting, where partial results to be joined come from different sources. Because the only available access pattern in this setting is URI source lookup, processing queries requires entire sources to be retrieved. Targeting this scenario, we show how existing work on join top-$k$ can be adopted to produce top-k results over Linked Data. We elaborate on strategies for book-keeping scores of partial results and to use them for better estimation of candidate result scores, i.e. to obtain tighter bounds for early termination. Based on experiments on real-world Linked Data, we show that the proposed top-$k$ processing technique substantially improves runtime performance.".
- 110 hasAuthorList authorList.
- 110 isPartOf proceedings.
- 110 keyword "Linked data query processing".
- 110 keyword "Query processing".
- 110 keyword "Top-k query processing".
- 110 title "Top-K Linked Data Query Processing".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent andreas-wagner.
- item-1 next item-2.
- item-2 type ListItem.