Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Path Summaries and Path Partitioning in Modern XML Databases
World Wide Web
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
Column-store support for RDF data management: not all swans are white
Proceedings of the VLDB Endowment
SW-Store: a vertically partitioned DBMS for Semantic Web data management
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Scalable indexing of RDF graphs for efficient join processing
Proceedings of the 18th ACM conference on Information and knowledge management
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
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management
gStore: answering SPARQL queries via subgraph matching
Proceedings of the VLDB Endowment
dipLODocus[RDF]: short and long-tail RDF analytics for massive webs of data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
An intelligent RDF management system with hybrid querying approach
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
What we talk about when we talk about graphs
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Regularities and dynamics in bisimulation reductions of big graphs
First International Workshop on Graph Data Management Experiences and Systems
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Bisimulation reduction of big graphs on mapreduce
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Hi-index | 0.00 |
As an essential part of the W3C's semantic web stack and linked data initiative, RDF data management systems (also known as triplestores) have drawn a lot of research attention. The majority of these systems use value-based indexes (e.g., B+-trees) for physical storage, and ignore many of the structural aspects present in RDF graphs. Structural indexes, on the other hand, have been successfully applied in XML and semi-structured data management to exploit structural graph information in query processing. In those settings, a structural index groups nodes in a graph based on some equivalence criterion, for example, indistinguishability with respect to some query workload (usually XPath). Motivated by this body of work, we have started the SAINT-DB project to study and develop a native RDF management system based on structural indexes. In this paper we present a principled framework for designing and using RDF structural indexes for practical fragments of SPARQL, based on recent formal structural characterizations of these fragments. We then explain how structural indexes can be incorporated in a typical query processing workflow; and discuss the design, implementation, and initial empirical evaluation of our approach.