Filters








88,763 Hits in 5.1 sec

Towards Efficient Dissemination of Linked Data in the Internet of Things

Yongrui Qin, Quan Z. Sheng, Nickolas J.G. Falkner, Ali Shemshadi, Edward Curry
2014 Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14  
TP-automata, as the first approach designed for pattern matching over Linked Data streams, also provides two to three orders of magnitude improvements on throughput compared with semantic matching approaches  ...  Experiments show that an MVR-tree designed for semantic matching can achieve a twofold increase in throughput compared with the naive R-tree based method.  ...  The root cause is that MVRtree is designed for semantic matching in a hashing space (e.g., handling NN queries) while TP-automata is designed for pattern matching.  ... 
doi:10.1145/2661829.2661889 dblp:conf/cikm/QinSFSC14 fatcat:vxvht5ly6bfa5a66gvsojv4ium

RDFChain: Chain Centric Storage for Scalable Join Processing of RDF Graphs using MapReduce and HBase

Pilsik Choi, Jooik Jung, Kyong-Ho Lee
2013 International Semantic Web Conference  
In addition, the proposed cost-based map-side join of RDFChain reduces the number of map jobs since it processes as many joins as possible in a map job using statistics.  ...  Most of previous researches focus on reducing the number of MapReduce jobs for processing join operations in SPARQL queries.  ...  Storage Design The proposed method stores RDF triples as follows:  RDF triples with the terms that co-exist in both the subject and object parts of triples are located in the T com table .  ... 
dblp:conf/semweb/ChoiJL13 fatcat:mpt2peglkbe75jocoo2p4xybsm

A Generic Mapping-based Query Translation from SPARQL to Various Target Database Query Languages

Franck Michel, Catherine Faron-Zucker, Johan Montagnat
2016 Proceedings of the 12th International Conference on Web Information Systems and Technologies  
with relevant mappings.  ...  First, given an xR2RML mapping describing how native database entities can be mapped to RDF, a SPARQL query is translated into a pivot abstract query language independent of the database.  ...  Let m be an xR2RML mapping graph consisting of a set of xR2RML triples maps, gp be a well-designed graph pattern, tp be a triple pattern of gp, and f be a SPARQL filter expression.  ... 
doi:10.5220/0005905401470158 dblp:conf/webist/MichelFM16 fatcat:6bqu5orpzjbkrc2lemyqlweghe

Storing and Querying Scientific Workflow Provenance Metadata Using an RDBMS

Artem Chebotko, Xubo Fei, Cui Lin, Shiyong Lu, Farshad Fotouhi
2007 Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007)  
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  ...  patterns and X is a subject and object, respectively, in these triple patterns.  ... 
doi:10.1109/e-science.2007.70 dblp:conf/eScience/ChebotkoFLLF07 fatcat:ec4eya6unfaajinpsltkg77lva

BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Queries

Medha Atre, Jagannathan Srinivasan, James A. Hendler
2008 International Semantic Web Conference  
This poster proposes BitMat, a bit matrix structure for representing a large number of RDF triples in memory and processing conjunctive triple pattern (multi-join) queries using it.  ...  The compact in-memory storage and use of bitwise operations, can lead to a faster processing of join queries when compared to the conventional RDF triple stores.  ...  However, RDFCube's design approximates the mapping of a triple to a cell by treating each cell as a hash bucket containing multiple triples.  ... 
dblp:conf/semweb/AtreSH08 fatcat:bsor3cscefen3okk4ctqsks5hy

Arts and Humanities e-Science From Ad Hoc Experimentation to Systematic Investigation

Tobias Blanke, Stuart Dunn, Mark Hedges
2007 Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007)  
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  ...  patterns and X is a subject and object, respectively, in these triple patterns.  ... 
doi:10.1109/e-science.2007.14 dblp:conf/eScience/BlankeDH07 fatcat:ucitfhyuujcbrkse4rgwtfbk5i

A Database Backend for OWL

Jörg Henss, Joachim Kleb, Stephan Grimm
2009 International Semantic Web Conference  
Our proposed system allows for a native mapping of OWL constructs to a database-schema without an unnecessary complex transformation in triples.  ...  Consequential storage systems focusing on the triple-based representation of ontologies seem to be no longer adequate as persistence layer for OWL ontologies.  ...  Acknowledgment The work presented in this paper has been funded by the German Federal State of Baden-Württemberg and by the German Federal Ministry of Economics and Technology in the THESEUS ("New Technologies for  ... 
dblp:conf/semweb/HenssKG08 fatcat:b5vgbochrvebli3fg7mvo7fthq

A design space for RDF data representations

Tomer Sagi, Matteo Lissandrini, Torben Bach Pedersen, Katja Hose
2022 The VLDB journal  
However, as recently shown for designing data structures, many design choices are biased by outdated considerations and may not result in the most efficient data representation for a given query workload  ...  Within this design space, we map the trade-offs between different RDF data representations employed as part of an RDF triplestore and identify unexplored solutions.  ...  Acknowledgements We wish to thank the anonymous reviewers for the detailed and insightful comments that allowed us to greatly improve the final version of this manuscript.  ... 
doi:10.1007/s00778-021-00725-x fatcat:rj5y2e3lrbhbfhhhmteslr42im

Cascading map-side joins over HBase for scalable join processing [article]

Martin Przyjaciel-Zablocki, Alexander Schätzle, Thomas Hornung, Christopher Dorner, Georg Lausen
2012 arXiv   pre-print
We demonstrate the significant benefits of MAPSIN joins for the processing of SPARQL basic graph patterns on large RDF datasets by an evaluation with the LUBM and SP2Bench benchmarks.  ...  While retaining the flexibility of commonly used reduce-side joins, we leverage the effectiveness of map-side joins without any changes to the underlying framework.  ...  The input for the map function contains either a mapping for the first triple pattern or a mapping for previously joined triple patterns.  ... 
arXiv:1206.6293v1 fatcat:towdefhca5dufanmehey3pyavy

A Distributed Query Execution Method for RDF Storage Managers

Kiyoshi Nitta, Iztok Savnik
2014 International Semantic Web Conference  
A distributed query execution method for Resource Description Framework (RDF) storage managers is proposed.  ...  Method is intended for use with an RDF storage manager called big3store to enable it to perform efficient query execution over large-scale RDF data sets.  ...  It must have a triple_pattern property for representing a triple pattern that consists of IRIs, literals, or variables in subject, predicate, and object slots.  ... 
dblp:conf/semweb/NittaS14 fatcat:wxmg3a2j6vayzj3dzjhhtuqtlm

Incomplete Information in RDF [article]

Charalampos Nikolaou, Manolis Koubarakis
2012 arXiv   pre-print
Following ideas from the incomplete information literature, we develop a semantics for this extension of RDF, called RDFi, and study SPARQL query evaluation in this framework.  ...  Section A gives formal definitions for the concept of well-designed graph patterns and relevant concepts, such as subsumption for mappings and weak monotonicity, while it presents known results for well-designed  ...  This is the case in which the object part of the triple pattern is not a literal from C. The "if" part accommodates the case in which the triple pattern involves a literal o from the set C.  ... 
arXiv:1209.3756v3 fatcat:46bd3excybcffjibr6bidzgtze

Streaming transformation of XML to RDF using XPath-based mappings

Jyun-Yao Huang, Christoph Lange, Sören Auer
2015 Proceedings of the 11th International Conference on Semantic Systems - SEMANTICS '15  
To process the XML input efficiently, we employ XML filtering techniques and a strategy for selecting relevant XML nodes for generating RDF triples.  ...  We introduce an XML to RDF transformation approach, which is based on mappings comprising RDF triple templates that employ simple XPath expressions.  ...  Acknowledgments This work is supported by the European Commission under the Seventh Framework Program FP7 for grant 601043 (http://diachron-fp7.eu).  ... 
doi:10.1145/2814864.2814880 dblp:conf/i-semantics/Huang0A15 fatcat:uf4nsi2abzaddjjbeb6lpxsxlq

Bridging the Semantic Web and NoSQL Worlds: Generic SPARQL Query Translation and Application to MongoDB [chapter]

Franck Michel, Catherine Faron-Zucker, Johan Montagnat
2019 Lecture Notes in Computer Science  
Let m be an xR2RML mapping graph consisting of a set of xR2RML mappings, gp be a well-designed graph pattern, and tp a triple pattern of gp.  ...  by means of referencing object maps that use values produced by the subject map of a parent mapping as the objects of triples produced by a child mapping.  ... 
doi:10.1007/978-3-662-58664-8_5 fatcat:ixku3mam5zdclftctvv4jmkx7m

A Framework For Semantics Preserving Sparql-To-Sql Translation

N. Soussi, M. Bahaj
2015 Zenodo  
The problem today is not limited to expanding the size of the information highways, but to design a system for intelligent search.  ...  The vast majority of this information is stored in relational databases, which in turn represent a backend for managing RDF data of the semantic web.  ...  i equal to the subject of triple pattern j then the join condition is written in the following form:R[i].s = R[j].s  If the subject of triple pattern i equal to the object of triple pattern j then: R[  ... 
doi:10.5281/zenodo.1108033 fatcat:3bz4omegtzfdfoxqz5o3m3biq4

The SPARQL2XQuery Interoperability Framework. Utilizing Schema Mapping, Schema Transformation and Query Translation to Integrate XML and the Semantic Web [article]

Nikos Bikakis, Chrisa Tsinaraki, Ioannis Stavrakantonakis, Nektarios Gioldasis, Stavros Christodoulakis
2014 arXiv   pre-print
The SPARQL2XQuery Framework provides a mapping model for the expression of OWL-RDF/S to XML Schema mappings as well as a method for SPARQL to XQuery translation.  ...  On the other hand, the dominant standard for information exchange in the Web today is XML.  ...  ACKNOWLEDGMENTS We would like to thank Yiannis Karagiorgos, Giorgos Giannopoulos, Konstantinos Makris, Dimitris Sacharidis, and Theodore Dalamagas, for many helpful comments on earlier versions of this  ... 
arXiv:1311.0536v3 fatcat:hrwu4zaarngqpcpfti2mrh63v4
« Previous Showing results 1 — 15 out of 88,763 results