Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 next item-3.
- item-2 previous item-10.
- item-3 type ListItem.
- item-3 hasContent sam-coppens.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent tom-de-nies.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent pedro-debevere.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent laurens-de-vocht.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent pieterjan-de-potter.
- item-7 next item-8.
- item-7 previous item-6.
- item-8 type ListItem.
- item-8 hasContent davy-van-deursen.
- item-8 next item-9.
- item-8 previous item-7.
- item-9 type ListItem.
- item-9 hasContent erik-mannens.
- item-9 previous item-8.
- paper-12 type InProceedings.
- paper-12 label "Extracting Relevant Subgraphs from Graph Navigation".
- paper-12 sameAs paper-12.
- paper-12 abstract "The main goal of current Web navigation languages is to retrieve set of nodes reachable from a given node. No information is provided about the fragments of the Web navigated to reach these nodes. In other words, information about their connections is lost. This paper presents an efficient algorithm to extract relevant parts of these Web fragments and shows the importance of producing subgraphs besides of sets of nodes. We discuss examples with real data using an implementation of the algorithm in the EXpRESs tool.".
- paper-12 hasAuthorList authorList.
- paper-12 isPartOf poster-demo-proceedings.
- paper-12 title "Extracting Relevant Subgraphs from Graph Navigation".
- 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 valeria-fionda.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent claudio-gutierrez.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent giuseppe-pirro.
- item-3 previous item-2.
- paper-13 type InProceedings.
- paper-13 label "INSTANS: High-Performance Event Processing with Standard RDF and SPARQL".
- paper-13 sameAs paper-13.
- paper-13 abstract "Smart environments require collaboration of multi-platform sensors operated by multiple parties. Proprietary event processing solutions do not have enough interoperation flexibility, easily leading to overlapping functions wasting hardware and software resources as well as data communications. Our goal is to verify the applicability of standard-compliant SPARQL for any complex event processing task. If found feasible, semantic web methods RDF, SPARQL and OWL have the built-in support for interconnecting disjoint vocabularies, enriching event information with linked open data and reasoning over semantically annotated content, yielding a very flexible event processing environment. Our approach is designed to meet these requirements. Our INSTANS platform based on continuous execution of interconnected SPARQL queries using the Rete-algorithm is a new approach showing improved performance for event processing tasks over current SPARQL-based solutions.".
- paper-13 hasAuthorList authorList.
- paper-13 isPartOf poster-demo-proceedings.
- paper-13 title "INSTANS: High-Performance Event Processing with Standard RDF and SPARQL".
- 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 mikko-rinne.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent esko-nuutila.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent seppo-toermae.
- item-3 previous item-2.
- paper-14 type InProceedings.
- paper-14 label "Jena-HBase: A Distributed, Scalable and Effcient RDF Triple Store".
- paper-14 sameAs paper-14.
- paper-14 abstract "Lack of scalability is one of the most significant problems faced by single machine RDF data stores. The advent of Cloud Computing and related tools and technologies has paved a way for a distributed ecosystem of RDF triple stores that can potentially allow up to a planet scale storage along with distributed query processing capabilities. Towards this end, we present Jena-HBase, a HBase backed triple store that can be used with the Jena framework. Jena-HBase provides end-users with a scalable storage and querying solution that supports all features from the RDF specification.".
- paper-14 hasAuthorList authorList.
- paper-14 isPartOf poster-demo-proceedings.
- paper-14 title "Jena-HBase: A Distributed, Scalable and Effcient RDF Triple Store".
- 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 vaibhav-khadilkar.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent murat-kantarcioglu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent bhavani-thuraisingham.
- item-3 next item-4.
- item-3 previous item-2.