Matches in ScholarlyData for { ?s ?p ?o. }
- item-5 previous item-4.
- 110 type InProceedings.
- 110 label "Relationalizing RDF Stores for Tools Reusability".
- 110 sameAs 110.
- 110 abstract "The emergence of Semantic Web technologies and standards such as Resource Description Framework (RDF) has introduced novel data storage models such as the RDF Graph Model. In this paper, we present a research effort called R2D, which attempts to bridge the gap between RDF and RDBMS concepts by presenting a relational view of RDF data stores. Thus, R2D is essentially a relational wrapper around RDF stores that aims to make the variety of stable relational tools that are currently in the market available to RDF stores without data duplication and synchronization issues.".
- 110 hasAuthorList authorList.
- 110 isPartOf proceedings.
- 110 keyword "Poster Session".
- 110 title "Relationalizing RDF Stores for Tools Reusability".
- 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 sunitha-ramanujam.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent anubha-gupta.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent latifur-khan.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent steven-seida.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent bhavani-thuraisingham.
- item-5 previous item-4.
- 111 type InProceedings.
- 111 label "C-SPARQL: SPARQL for Continuous Querying".
- 111 sameAs 111.
- 111 abstract "C-SPARQL is an extension of SPARQL to support continuous queries over RDF data streams. Supporting streams in RDF format guarantees interoperability and opens up important applications, in which reasoners can deal with knowledge that evolves over time. We present C-SPARQL by means of examples in Urban Computing.".
- 111 hasAuthorList authorList.
- 111 isPartOf proceedings.
- 111 keyword "Poster Session".
- 111 title "C-SPARQL: SPARQL for Continuous Querying".
- 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 davide-francesco-barbieri.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent daniele-braga.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stefano-ceri.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent emanuele-della-valle.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent michael-grossniklaus.
- item-5 previous item-4.
- 112 type InProceedings.
- 112 label "Interactive Search in XML Data".
- 112 sameAs 112.
- 112 abstract "In a traditional keyword-search system in XML data, a user composes a keyword query, submits it to the system, and retrieves relevant subtrees. In the case where the user has limited knowledge about the data, often the user feels "left in the dark" when issuing queries, and has to use a tryand-see approach for finding information. In this paper, we study a new information-access paradigm for XML data, called "Inks," in which the system searches on the underlying data "on the fly" as the user types in query keywords. Inks extends existing XML keyword search methods by interactively answering keyword queries. We propose effective indices, early-termination techniques, and efficient search algorithms to achieve a high interactive speed. We have implemented our algorithm. The experimental results show that Inks achieves high search efficiency and result quality.".
- 112 hasAuthorList authorList.
- 112 isPartOf proceedings.
- 112 keyword "Poster Session".
- 112 title "Interactive Search in XML 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 guoliang-li.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jianhua-feng.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent lizhu-zhou.
- item-3 previous item-2.
- 113 type InProceedings.
- 113 label "Is There Anything Worth Finding on the Semantic Web?".
- 113 sameAs 113.
- 113 abstract "There has recently been an upsurge of interest in the possibilities of combining structured data and ad-hoc information retrieval from traditional hypertext. In this experiment, we run queries extracted from a query log of a major search engine against the Semantic Web to discover if the Semantic Web has anything of interest to the average user. We show that there is indeed much information on the Semantic Web that could be relevant for many queries for people, places and even abstract concepts, although they are overwhelmingly clustered around a Semantic Web-enabled export of Wikipedia known as DBPedia. to a more specialized search engine. We use a search query log of approximately 15 million distinct queries from Microsoft Live Search. This query log contains 14,921,285 queries. Of these queries, 7,095,302 (47.55%) were unique, and corrected for capitalization, 6,623,635 (44.39%) were unique.".
- 113 hasAuthorList authorList.
- 113 isPartOf proceedings.
- 113 keyword "Poster Session".