Foundations of logic programming
Foundations of logic programming
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
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
Anytime Query Answering in RDF through Evolutionary Algorithms
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Semantics preserving SPARQL-to-SQL translation
Data & Knowledge Engineering
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
ISWC '09 Proceedings of the 8th International Semantic Web Conference
RDFProv: A relational RDF store for querying and managing scientific workflow provenance
Data & Knowledge Engineering
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
An intermediate algebra for optimizing RDF graph pattern matching on MapReduce
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
STUN: Spatio-Temporal Uncertain (Social) Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Efficient Multiview Maintenance under Insertion in Huge Social Networks
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |
Many approaches for RDF stores exist, most of them using very straight-forward techniques to store triples in or mapping RDF Schema classes to database tables. In this paper we propose an RDF store that uses a natural mapping of RDF resources to database tables that does not rely on RDF Schema, but constructs a schema based on the occurring signatures, where a signature is the set of properties used on a resource. This technique can therefore be used for arbitrary RDF data, i.e., RDF Schema or any other schema/ontology language on top of RDF is not required. Our approach can be used for both in-memory and on-disk relational database-based RDF store implementations. A first prototype has been implemented and already shows a significant performance increase compared to other freely available (in-memory) RDF stores.