Matches in ScholarlyData for { ?s ?p ?o. }
- 30 keyword "Content syndication".
- 30 keyword "Linked Data".
- 30 keyword "Templates".
- 30 title "LESS - Template-based Syndication and Presentation of Linked Data for End-users".
- 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 soeren-auer.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent raphael-doehring.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sebastian-dietzold.
- item-3 previous item-2.
- 32 creator christian-meilicke.
- 32 creator heiner-stuckenschmidt.
- 32 creator jan-noessner.
- 32 creator mathias-niepert.
- 32 type InProceedings.
- 32 label "Leveraging Terminological Structure for Object Reconciliation".
- 32 sameAs 32.
- 32 abstract "It has been argued that linked open data is the major benefit of the use of semantic technologies on the web as it provides a huge amount of structured data that can be accessed in a more effective way than web pages. While linked open data avoids many problems connected with the use of expressive ontologies, e.g. the knowlegde acquisition bottleneck, data heterogeneity remains a problem. In particular, the same objects may be referred to using different URIs in different data sets. Identifying such representations of the same object is called object reconciliation. In this paper, we propose a novel object reconciliation method that is based on an existing semantic similarity measure for linked data. We adapt the measure to the object reconciliation problem, present complete and approximate algorithms for efficiently computing the methods and present a systematic evaluation of the method based on a benchmark dataset. As our main result, we show that the use of light-weight ontologies and schema information significantly improves object reconciliation in the context of linked open data.".
- 32 hasAuthorList authorList.
- 32 isPartOf proceedings.
- 32 keyword "Instance Matching".
- 32 keyword "Linear Optimization".
- 32 keyword "Object Reconciliation".
- 32 title "Leveraging Terminological Structure for Object Reconciliation".
- 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 jan-noessner.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent mathias-niepert.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent christian-meilicke.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent heiner-stuckenschmidt.
- item-4 previous item-3.
- 36 creator joerg-unbehauen.
- 36 creator michael-martin.
- 36 creator soeren-auer.
- 36 type InProceedings.
- 36 label "Improving the Performance of Semantic Web Applications with SPARQL Query Result Caching".
- 36 sameAs 36.
- 36 abstract "The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which use triple stores as persistence backends, trade performance for the advantage of flexibility with regard to information structuring. In order to get closer to the performance of relational database-backed Web applications, we developed an approach for improving the performance of triple stores by caching query results and even complete application objects. The selective invalidation of cache objects, following updates of the underlying knowledge bases, is based on analysing the graph patterns of cached SPARQL queries in order to obtain information about what kind of updates will change the query result. We evaluated our approach by extending the BSBM triple store benchmark with an update dimension as well as in typical Semantic Web application scenarios.".
- 36 hasAuthorList authorList.
- 36 isPartOf proceedings.
- 36 keyword "Caching".
- 36 keyword "SPARQL Query Result Caching".
- 36 keyword "SPARQL".
- 36 title "Improving the Performance of Semantic Web Applications with SPARQL Query Result Caching".
- 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 michael-martin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent joerg-unbehauen.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent soeren-auer.
- item-3 previous item-2.
- 44 creator thanh-tran.
- 44 type InProceedings.
- 44 label "Usability of Schema-agnostic Search Paradigms - A Comparative Study of Keyword Search, Query Completion, Result Completion and Faceted Search".
- 44 sameAs 44.
- 44 abstract "The increasing amount of data on the Web bears potential for addressing complex information needs more effectively. Instead of keyword search and browsing along links between results, users can specify the needs in terms of complex queries and obtain precise answers right away. However, users might not always know the query language and more importantly, the underlying schema. Motivated by the burden facing the data Web search users in specifying complex information needs, we identify a particular class of search approaches that we refer to as the schema-agnostic paradigm. Common to these search approaches is that no knowledge about the schema is required to specify complex information needs. We have conducted a systematic study of four popular approaches: (1) simple keyword search, (2) answer completion, which is based on computing complex answers as candidate results for user provided keywords, (3) query completion, which is based on computing structured queries as candidate interpretations of user provided keywords and (4) faceted search. We study these approaches from a process-oriented view to derive the main conceptual steps required for addressing complex information needs. Then, an experimental study is perform based on established conduct of a task-based evaluation. We derive main conclusions from the studies, as well as directions for future research.".
- 44 hasAuthorList authorList.
- 44 isPartOf proceedings.
- 44 keyword "Data Web Search".
- 44 keyword "Faceted Search".
- 44 keyword "Keyword Search".
- 44 keyword "Query Interpretation".
- 44 title "Usability of Schema-agnostic Search Paradigms - A Comparative Study of Keyword Search, Query Completion, Result Completion and Faceted Search".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.