Matches in ScholarlyData for { ?s ?p ?o. }
- 10 hasAuthorList authorList.
- 10 isPartOf proceedings.
- 10 keyword "Ontology Repository".
- 10 keyword "Quad Stores".
- 10 keyword "SPARQL".
- 10 keyword "Scalability".
- 10 title "The Quad Economy of a Semantic Web Ontology Repository".
- 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 manuel-salvadores.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent paul-r-alexander.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent mark-a-musen.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent natalya-noy.
- item-4 previous item-3.
- 11 creator ian-emmons.
- 11 creator mike-dean.
- 11 creator mounika-garlapati.
- 11 creator suzanne-collier.
- 11 type InProceedings.
- 11 label "RDF Literal Data Types in Practice".
- 11 sameAs 11.
- 11 abstract "Conjunctive query answering is a key reasoning service for many ontology-basedapplications. With the advent of lightweight ontology languages, such as OWL2 QL, several query answering systems have been proposed which compute the socalled emph{UCQ rewriting} of a given query. It is often the case in realisticscenarios, that users refine their original queries, by e.g., extending themwith new constraints and making them more precise. To the best of ourknowledge, in such cases, all OWL 2 QL systems would need to recompute therewriting of the refined query from scratch. In this paper we study the problemof computing the rewriting of the refined query by `extending".
- 11 hasAuthorList authorList.
- 11 isPartOf proceedings.
- 11 keyword "Datatypes".
- 11 keyword "Literal".
- 11 keyword "RDF".
- 11 title "RDF Literal Data Types in Practice".
- 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 ian-emmons.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent suzanne-collier.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent mounika-garlapati.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent mike-dean.
- item-4 previous item-3.
- 13 creator martin-znamirowski.
- 13 creator ralf-heese.
- 13 type InProceedings.
- 13 label "Resource centered RDF data management".
- 13 sameAs 13.
- 13 abstract "Since the first publication of RDF researchers developed systems to store and to query RDF data efficiently. First, they mapped the RDF data model to the relational one. As relational databases performed poorly for generic RDF graphs researches focused on native repositories using B-trees to index triples in most cases. However, native repositories still calculate the result of a query by joining single triples.Because queries can be decomposed into star-like graph patterns we argue that managing RDF data as a set of subgraphs has advantages over existing approaches. Thus, we propose a storage model that manages an RDF graph as a collection of subgraphs and evaluates queries by joining the results of star-like subqueries. In cause of the results of some preliminary tests we are confident that a system based on our approach can efficiently process queries.".
- 13 hasAuthorList authorList.
- 13 isPartOf proceedings.
- 13 keyword "RDF repository".
- 13 keyword "query processing".
- 13 keyword "storage model".
- 13 title "Resource centered RDF data management".
- 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 ralf-heese.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent martin-znamirowski.
- item-2 previous item-1.
- 3 creator ralf-moeller.
- 3 creator sebastian-wandelt.
- 3 type InProceedings.
- 3 label "Sound and Complete SHI Instance Retrieval for 1 Billion ABox Assertions".
- 3 sameAs 3.
- 3 abstract "One of the more mysterious aspects of RDF (Resource Description Framework) is typed literals. For instance, confusion over the difference between a plain character string ("foo") and a string that is explicitly typed ("foo"^^xsd:string) is common. Also, questions often arise about comparisons between literals of the various numeric types (e.g., long, integer, decimal, and float). This paper explores how several popular triple stores handle literals via direct testing, and also compares their behavior to the relevant standards. Along the way, we highlight a number of implementation inconsistencies and some surprising aspects of the standards themselves.".
- 3 hasAuthorList authorList.
- 3 isPartOf proceedings.
- 3 keyword "Description Logics".
- 3 keyword "Instance Retrieval".
- 3 keyword "Semantic Web".
- 3 title "Sound and Complete SHI Instance Retrieval for 1 Billion ABox Assertions".
- authorList type List.
- authorList hasFirstItem item-1.