Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• paper-10 isPartOf proceedings-2.
• paper-10 title "Efficient Execution of Top-K SPARQL Queries".
• 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 sara-magliacane.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent alessandro-bozzon.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent emanuele-della-valle.
• item-3 previous item-2.
• paper-11 type InProceedings.
• paper-11 label "Cost based Query Ordering over OWL Ontologies".
• paper-11 sameAs paper-11.
• paper-11 abstract "The paper presents an approach for cost-based query planning for SPARQL queries issued over an OWL ontology using the OWL Direct Semantics entailment regime of SPARQL 1.1. The costs are based on information about the instances of classes and properties that are extracted from a model abstraction built by an OWL reasoner. A static and a dynamic algorithm are presented which use these costs to find optimal or near optimal execution orders for the atoms of a query. For the dynamic case, we improve the performance by exploiting an individual clustering approach that allows for computing the cost functions based on one individual sample from a cluster. Our experimental study shows that the static ordering usually outperforms the dynamic one when accurate statistics are available. This changes, however, when the statistics are less accurate, e.g., due to non-deterministic reasoning decisions.".
• paper-11 hasAuthorList authorList.
• paper-11 isPartOf proceedings-2.
• paper-11 title "Cost based Query Ordering over OWL Ontologies".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasLastItem item-2.
• item-1 type ListItem.
• item-1 hasContent ilianna-kollia.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent birte-glimm.
• item-2 previous item-1.
• paper-12 type InProceedings.
• paper-12 label "Hybrid SPARQL queries: fresh vs. fast results".
• paper-12 sameAs paper-12.
• paper-12 abstract "For Linked Data query engines, there are inherent trade-offs between centralised approaches that can efficiently answer queries over data cached from parts of the Web, and live decentralised approaches that can provide fresher results over the entire Web at the cost of slower response times. Herein, we propose a hybrid query execution approach that returns fresher results from a broader range of sources vs. the centralised scenario, while speeding up results vs. the live scenario. We first compare results from two public SPARQL stores against current versions of the Linked Data sources they cache; results are often missing or out-of-date. We thus propose using coherence estimates to split a query into a sub-query for which the cached data have good fresh coverage, and a sub-query that should instead be run live. Finally, we evaluate different hybrid query plans and split positions in a real-world setup. Our results show that hybrid query execution can improve freshness vs. fully cached results while reducing the time taken vs. fully live execution.".
• paper-12 hasAuthorList authorList.
• paper-12 isPartOf proceedings-2.
• paper-12 title "Hybrid SPARQL queries: fresh vs. fast results".
• 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 juergen-umbrich.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent marcel-karnstedt.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent aidan-hogan.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent josiane-xavier-parreira.
• item-4 previous item-3.
• paper-13 type InProceedings.
• paper-13 label "Automatic typing of DBpedia entities".
• paper-13 sameAs paper-13.
• paper-13 abstract "We present Tipalo, an algorithm and tool for automatically typing DBpedia entities. Tipalo identifies the most appropriate types for an entity by interpreting its natural language definition, which is extracted from its corresponding Wikipedia page abstract. Types are identified by means of a set of heuristics based on graph patterns, disambiguated to WordNet, and aligned to two top-level ontologies: WordNet supersenses and a subset of DOLCE+DnS Ultra Lite classes. The algorithm has been tuned against a golden standard that has been built online by a group of selected users, and further evaluated in a user study.".
• paper-13 hasAuthorList authorList.
• paper-13 isPartOf proceedings-2.
• paper-13 title "Automatic typing of DBpedia entities".
• 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 hasItem item-6.
• authorList hasLastItem item-6.
• item-1 type ListItem.
• item-1 hasContent aldo-gangemi.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent andrea-giovanni-nuzzolese.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent valentina-presutti.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent francesco-draicchio.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent alberto-musetti.
• item-5 next item-6.
• item-5 previous item-4.
• item-6 type ListItem.

• first
• previous
• next