Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
BRAHMS: a workbench RDF store and high performance memory system for semantic association discovery
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Benchmarking database representations of RDF/S stores
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
RDFBroker: a signature-based high-performance RDF store
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Proceedings of the 17th international conference on World Wide Web
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics preserving SPARQL-to-SQL translation
Data & Knowledge Engineering
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
ISWC '09 Proceedings of the 8th International Semantic Web Conference
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
RDFProv: A relational RDF store for querying and managing scientific workflow provenance
Data & Knowledge Engineering
Query optimization for ontology-based information integration
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
x-RDF-3X: fast querying, high update rates, and consistency for RDF databases
Proceedings of the VLDB Endowment
Selecting materialized views for RDF data
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Using reformulation trees to optimize queries over distributed heterogeneous sources
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
gStore: answering SPARQL queries via subgraph matching
Proceedings of the VLDB Endowment
Optimizing query shortcuts in RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Linked data indexing methods: a survey
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
View selection in Semantic Web databases
Proceedings of the VLDB Endowment
A pattern-based approach for efficient query processing over RDF data
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Heuristics-based query optimisation for SPARQL
Proceedings of the 15th International Conference on Extending Database Technology
A structural approach to indexing triples
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Building an efficient RDF store over a relational database
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Repairing broken RDF links in the web of data
International Journal of Web Engineering and Technology
Editorial: Efficient incremental update and querying in AWETO RDF storage system
Data & Knowledge Engineering
Hi-index | 0.00 |
RDF ("Resource Description Framework") is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy. In this paper, we focus on providing a very lightweight indexing mechanism for certain kinds of RDF queries, namely graph-based queries where there is a need to traverse edges in the graph determined by an RDF database. Our approach uses the idea of drawing circles around selected "center" vertices in the graph where the circle would encompass those vertices in the graph that are within a given distance of the "center" vertex. We come up with methods of finding such "center" vertices and identifying the radius of the circles and then leverage this to build an index called GRIN. We compare GRIN with three existing RDF indexex: Jena, Sesame. and RDFBroker. We compared (i) the time to answer graph based queries, (ii) memory needed to store the index, and (iii) the time to build the index. GRIN outperforms Jena, Sesame and RDFBroker on all three measures for graph based queries (for other types of queries, it may be worth building one of these other indexes and using it), at the expense of using a larger amount of memory when answering queries.