A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Processing SPARQL queries with regular expressions in RDF databases
2010
Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics - DTMBIO '10
Preserved Fulltext
(bio2rdf.org), SPARQL -a W3C recommendation query for RDF databases -has become an important query language for querying the bioinformatics knowledge bases. ...
Our contributions can be summarized as follows. 1) We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2) We propose a cost model in order ...
In this paper, we propose an efficient framework for efficiently processing the regular expression in the standard SPARQL over an RDF database. ...
doi:10.1145/1871871.1871877
fatcat:vcnofl2ibffczjembckiyyzh7m
Processing SPARQL queries with regular expressions in RDF databases
2011
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(bio2rdf.org), SPARQL -a W3C recommendation query for RDF databases -has become an important query language for querying the bioinformatics knowledge bases. ...
Our contributions can be summarized as follows. 1) We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2) We propose a cost model in order ...
In this paper, we propose an efficient framework for efficiently processing the regular expression in the standard SPARQL over an RDF database. ...
doi:10.1186/1471-2105-12-s2-s6
pmid:21489225
pmcid:PMC3073186
fatcat:zgubl5pwejb4rfxo45dfocbdvi
Hash Tree Indexing for Fast SPARQL Query in Large Scale RDF Data Management Systems
2017
International Semantic Web Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The experimental results demonstrate that the proposed system can improve the query efficiency up to 21.3% compared with the representative RDF data management systems. ...
First, the compact design can effectively reduce the size of the indexes. Second, HTStore utilizes the hash function to significantly reduce the query time. ...
The index structure includes two layers: the hash layer containing a hash table and the tree layer containing hash trees. More specifically, we construct a hash table for fast lookup. ...
dblp:conf/semweb/LiZRCF17
fatcat:33sjuplykjalreplc35bofiasa
HPRD: A High Performance RDF Database
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper a high performance storage system for RDF documents is introduced. The system employs optimized index structures for RDF data and efficient RDF query evaluation. ...
Path index manages frequent RDF path patterns for long path query performance enhancement. Context index is optional for context oriented RDF data and temporal RDF data. ...
Conclusion Query processing for RDF is an important issue for Semantic Web applications and we have determined a set of indices required for efficient RDF query processing. ...
doi:10.1007/978-3-540-74784-0_37
fatcat:ukgmzvd23zexti3r65m3u7xcte
HPRD: a high performance RDF database
2010
International Journal of Parallel, Emergent and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper a high performance storage system for RDF documents is introduced. The system employs optimized index structures for RDF data and efficient RDF query evaluation. ...
Path index manages frequent RDF path patterns for long path query performance enhancement. Context index is optional for context oriented RDF data and temporal RDF data. ...
Conclusion Query processing for RDF is an important issue for Semantic Web applications and we have determined a set of indices required for efficient RDF query processing. ...
doi:10.1080/17445760802431839
fatcat:t24bxb45dvbepir63rga7uj6fu
RQ-RDF-3X: Going beyond triplestores
2014
2014 IEEE 30th International Conference on Data Engineering Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
processing pipeline for queries over reified content. ...
Efficient storage and querying of large repositories of RDF content is important due to the widespread growth of Semantic Web and Linked Open Data initiatives. ...
Contributions In order to address aforementioned concerns, in this paper we present RQ-RDF-3X: a fast and efficient system for efficiently querying enormous amount of RDF data containing meta-facts. ...
doi:10.1109/icdew.2014.6818337
dblp:conf/icde/LeekaB14
fatcat:zwsepdgldvdaphxm2xdffqtr7e
Scalable Indexing and Adaptive Querying of RDF Data in the cloud
2014
Proceedings of Semantic Web Information Management on Semantic Web Information Management - SWIM'14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Towards that direction, we describe H2RDF+, an RDF store that efficiently performs distributed joins over a multiple index scheme. ...
In this work, we emphasize on our novel, scalable and efficient MapReduce indexing process that allows H2RDF+ to handle arbitrarily large RDF datasets. ...
Acknowledgment This research has received funding from IKY fellowships of excellence for postgraduate studies in Greece -SIEMENS program. ...
doi:10.1145/2630602.2630603
dblp:conf/sigmod/PapailiouTKKK14a
fatcat:7asq5xr43fbazklagzowxyynue
Reflections on: Triple Storage for Random-Access Versioned Querying of RDF Archives
2019
International Semantic Web Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this extended abstract, we discuss an RDF archive indexing technique that has a low storage overhead, and adds metadata for reducing lookup times. ...
We introduce algorithms based on this technique for efficiently evaluating versioned queries. Using the BEAR RDF archiving benchmark, we evaluate our implementation, called OSTRICH. ...
Instead, we propose an elementary but efficient versioned triple pattern index that can be used as a basis for query engines. ...
dblp:conf/semweb/TaelmanSHMV19
fatcat:yfedgbxyuzdajmla22yoxpad7e
Fast Processing of SPARQL Queries on RDF Quadruples
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
During query processing, RIQ uses a novel filtering index to first identify candidate groups that may contain matches for the query. ...
In this paper, we propose a new approach for fast processing of SPARQL queries on large RDF datasets containing RDF quadruples (or quads). ...
CONCLUSIONS We presented RIQ, a new approach for indexing large RDF datasets containing quads. RIQ employs a decreaseand-conquer approach to efficiently process SPARQL queries. ...
arXiv:1506.01333v2
fatcat:m36d2evdgjakdm4r2bnqqnukcy
Semantic connection set-based massive RDF data query processing in Spark environment
2019
EURASIP Journal on Wireless Communications and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
However, there is a performance challenge in the distributed environment when RDF queries, which contain multiple join operations, such as network reshuffle and memory overhead, are processed. ...
Secondly, a method for generating query plans based on semantic connection set is proposed in this paper. ...
RDF graph is a finite set of RDF triples. Figure 1 shows an example of RDF graph.
SPARQL SPARQL is one of the standardized languages for RDF data retrieval and query. ...
doi:10.1186/s13638-019-1588-9
fatcat:gchrslcjundhjftqkjpfgujzmi
H2RDF+
2014
Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this demonstration we present H2RDF+, an RDF store that efficiently performs distributed Merge and Sort-Merge joins using a multipleindex scheme over HBase indexes. ...
Through a greedy planner that incorporates our cost-model, it adaptively commands for either single or multi-machine query execution based on join complexity. ...
It proves almost as efficient as RDF-3X, with a small difference (few tenths of a second), for selective queries. ...
doi:10.1145/2588555.2594535
dblp:conf/sigmod/PapailiouTKKK14
fatcat:hlui2tfwlrgxjcfmowkmipnvv4
Storage, Indexing, Query Processing, and Benchmarking in Centralized and Distributed RDF Engines: A Survey
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2009.10331v1 fatcat:ws2dsmbl4rcglpyn4rnsokv6ty
The type of indexing approach used in RDF engines is critical for fast data lookup. ...
The type of the underlying querying language (e.g., SPARQL or SQL) used for query execution is a crucial optimization component of the RDF storage solutions. ...
Thus, this approach can produce give efficient results for the majority of the queries containing joins between triple patterns. ...
arXiv:2009.10331v2
fatcat:ou4nctjyj5c6jbh4osclewj62e
Efficient Parallel Processing of Analytical Queries on Linked Data
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
RDF and SPARQL have been established as de-facto standards for representing and querying linked data and there exists quite a number of RDF stores and SPARQL engines that can be used to work with the data ...
However, for many types of queries on linked data these stores are not the best choice regarding query execution times. ...
Like RDF-3X, Hexastore creates an index for each possible combination of S, P, and O and also the partial indexes. ...
doi:10.1007/978-3-642-41030-7_33
fatcat:6xelv336lbgnfjmq7a4ltt3bnq
Deep integration of spatial query processing into native RDF triple stores
2010
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This calls for efficient data management systems which are capable of querying large amounts of RDF data and support spatial query predicates. ...
This makes it possible to use W3C's standardized SPARQL query language as-is, i.e., without any modifications or extensions for spatial queries. ...
Acknowledgments We would like to thank Bastian Reitschuster, Tim Waizenegger, Oliver Schiller and Nazario Cipriani for greatly supporting our work. ...
doi:10.1145/1869790.1869799
dblp:conf/gis/BrodtNM10
fatcat:agqdkbd4hbc6ziiahyjqi4hu5u
A Main Memory Index Structure to Query Linked Data
2011
The Web Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
An implementation of this idea requires approaches that support an efficient and flexible management of temporary, ad hoc data collections that emerge during query execution. ...
However, existing proposals for managing RDF data primarily focus on persistent storage and query execution for large datasets and, thus, are unsuitable in our dynamic scenario which involves many small ...
All three data structures are based on the same index for RDF data. This index enables an efficient execution of triple pattern queries (i.e. find operations). ...
dblp:conf/www/HartigH11
fatcat:3avk53y7rndlpaimtjan27nf3m
« Previous
Showing results 1 — 15 out of 9,343 results