Results 11 - 20
of
54
Storing and Querying Scientific Workflow Provenance Metadata Using an RDBMS
- THIRD IEEE INTERNATIONAL CONFERENCE ON E-SCIENCE AND GRID COMPUTING
, 2007
"... Provenance management has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow environments. This paper proposes an approach to provenance management that seamlessly integrates the interoperability, extensi ..."
Abstract
-
Cited by 14 (10 self)
- Add to MetaCart
(Show Context)
Provenance management has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow environments. This paper proposes an approach to provenance management that seamlessly integrates the interoperability, extensibility, and reasoning advantages of Semantic Web technologies with the storage and querying power of an RDBMS. Specifically, we propose: i) two schema mapping algorithms to map an arbitrary OWL provenance ontology to a relational database schema that is optimized for common provenance queries; ii) two efficient data mapping algorithms to map provenance RDF metadata to relational data according to the generated relational database schema, and iii) a schema-independent SPARQL-to-SQL translation algorithm that is optimized on-the-fly by using the type information of an instance available from the input provenance ontology and the statistics of the sizes of the tables in the database. Experimental results are presented to show that our algorithms are efficient and scalable.
Database to semantic web mapping using rdf query languages
- In ER
, 2006
"... Abstract. One of the main drawbacks of the Semantic Web is the lack of semantically rich data, since most of the information is still stored in relational databases. In this paper, we present an approach to map legacy data stored in relational databases into the Semantic Web using virtually any mode ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
(Show Context)
Abstract. One of the main drawbacks of the Semantic Web is the lack of semantically rich data, since most of the information is still stored in relational databases. In this paper, we present an approach to map legacy data stored in relational databases into the Semantic Web using virtually any modern RDF query language, as long as it is closed within RDF. Consequently, a Semantic Web developer does not need to learn and adopt a new mapping language, but he may perform the mapping task using his preferred RDF query language. 1
RDFProv: A Relational RDF Store for Querying and Managing Scientific Workflow Provenance
, 2010
"... Provenance metadata has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow environments. The provenance management problem concerns the efficiency and effectiveness of the modeling, recording, representat ..."
Abstract
-
Cited by 11 (2 self)
- Add to MetaCart
Provenance metadata has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow environments. The provenance management problem concerns the efficiency and effectiveness of the modeling, recording, representation, integration, storage, and querying of provenance metadata. Our approach to provenance management seamlessly integrates the interoperability, extensibility, and inference advantages of Semantic Web technologies with the storage and querying power of an RDBMS to meet the emerging requirements of scientific workflow provenance management. In this paper, we elaborate on the design of a relational RDF store, called RDFProv, that is optimized for scientific workflow provenance querying and management. Specifically, we propose: i) two schema mapping algorithms to map an OWL provenance ontology to a relational database schema that is optimized for common provenance queries; ii) three efficient data mapping algorithms to map provenance RDF metadata to relational data according to the generated relational database schema, and iii) a schema-independent SPARQL-to-SQL translation algorithm that is optimized on-the-fly by using the type information of an instance available from the input provenance ontology and the statistics of the sizes of the tables in the database. Experimental results are presented to show that our algorithms are efficient and scalable. The comparison with two popular relational RDF stores, Jena and Sesame, and two commercial native RDF stores, AllegroGraph and BigOWLIM, showed that our optimizations result in improved performance and scalability for provenance metadata management. Finally, our case study for provenance management in a real-life biological simulation workflow showed the production quality and capability of the RDFProv system. Although presented in the context of scientific workflow provenance management, many of our proposed techniques apply to general RDF data management as well.
The Internet of Things: A survey from the data-centric perspective,” in Managing and Mining Sensor Data,
, 2013
"... ..."
(Show Context)
Efficient Linked-List RDF Indexing in Parliament
"... Abstract. As the number and scale of Semantic Web applications in use increases, so does the need to efficiently store and retrieve RDF data. Current published schemes for RDF data management either fail to embrace the schema flexibility inherent in RDF or make restrictive assumptions about applicat ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
(Show Context)
Abstract. As the number and scale of Semantic Web applications in use increases, so does the need to efficiently store and retrieve RDF data. Current published schemes for RDF data management either fail to embrace the schema flexibility inherent in RDF or make restrictive assumptions about application usage models. This paper describes a storage and indexing scheme based on linked lists and memory-mapped files, and presents theoretical and empirical analysis of its strengths and weaknesses versus other techniques. This scheme is currently used in Parliament (formerly DAML DB), a triple store with rule support that has recently been released as open source. 1
Graph data management and mining: a survey of algorithms and applications
- Wang (Eds.), Managing and Mining Graph Data, of Advances in Database Systems
, 2010
"... ..."
Clustered TDB: A Clustered Triple Store for Jena
"... This paper describes the design of Clustered TDB, a clustered triple store designed to store and query very large quantities of Resource Description Framework (RDF) data. It presents an evaluation of an initial prototype, showing that Clustered TDB offers excellent scaling characteristics with respe ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
This paper describes the design of Clustered TDB, a clustered triple store designed to store and query very large quantities of Resource Description Framework (RDF) data. It presents an evaluation of an initial prototype, showing that Clustered TDB offers excellent scaling characteristics with respect to load times and query throughput. Design decisions are justified in the context of a literature review on Database Management System (DBMS) and RDF store clustering, and it is shown that many techniques created during the course of DBMS research are applicable to the problem of storing RDF data. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed
Rdfmatview: Indexing rdf data for sparql queries
, 2010
"... Abstract. The Semantic Web as an evolution of the World Wide Web aims to create a universal medium for the exchange of semantically described data. The idea of representing this information by means of directed labelled graphs, RDF, has been widely accepted by the scientific community. However query ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
(Show Context)
Abstract. The Semantic Web as an evolution of the World Wide Web aims to create a universal medium for the exchange of semantically described data. The idea of representing this information by means of directed labelled graphs, RDF, has been widely accepted by the scientific community. However querying RDF data sets to find the desired information often is highly time consuming due to the number of comparisons that are needed. In this article we propose indexes on RDF to reduce the search space and the SPARQL query processing time. Our approach is based on materialized queries, i.e., precomputed query patterns and their occurrences in the data sets. We provide a formal definition of RDFMatView indexes for SPARQL queries, a cost model to evaluate their potential impact on query performance, and a rewriting algorithm to use indexes in SPARQL queries. We also develop and compare different approaches to integrate such indexes into an existing SPARQL query engine. Our preliminary results show that our approach can drastically decrease the query processing time in comparison to conventional query processing.
Semantic logger: Supporting service building from personal context
- In Proceedings of Capture, Archival and Retrieval of Personal Experiences (CARPE) Workshop at ACM MM. ACM MultiMedia
, 2006
"... The Semantic Logger 1 (SL) is presented as a system for the importing, housing, and exploiting of personal information. The system has been implemented using a number of Semantic Web enabling technologies, and attempts to store the information in a manner adhering to as many W3C recommendations as p ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
The Semantic Logger 1 (SL) is presented as a system for the importing, housing, and exploiting of personal information. The system has been implemented using a number of Semantic Web enabling technologies, and attempts to store the information in a manner adhering to as many W3C recommendations as possible. The Semantic Logger’s utility is grounded in two context-based applications, namely a recommender system, and a photo-annotation tool. Categories and Subject Descriptors
Jena Property Table Design
- Proceedings of the Jena Users Conference
, 2006
"... ..."
(Show Context)
