Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A RDF-based Model for Expressing Spatio-Temporal Relations Between Web Sites
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
OntoLog: Temporal Annotation Using Ad Hoc Ontologies and Application Profiles
ECDL '02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
SKG '05 Proceedings of the First International Conference on Semantics, Knowledge and Grid
IEEE Transactions on Knowledge and Data Engineering
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
On Temporal Cardinality in the Context of the TOWL Language
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
From information to knowledge: harvesting entities and relationships from web sources
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
x-RDF-3X: fast querying, high update rates, and consistency for RDF databases
Proceedings of the VLDB Endowment
AnQL: SPARQLing up annotated RDFS
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Representing and querying validity time in RDF and OWL: a logic-based approach
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Representing and querying validity time in RDF and OWL: A logic-based approach
Web Semantics: Science, Services and Agents on the World Wide Web
SensorStream: a semantic real-time stream management system
International Journal of Ad Hoc and Ubiquitous Computing
YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia
Artificial Intelligence
Temporal description logic for ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The World Wide Web Consortium's RDF standard primarily consists of (subject, property, object) triples that specify the value that a given subject has for a given property. However, it is frequently the case that even for a fixed subject and property, the value varies with time. As a consequence, efforts have been made to annotate RDF triples with "valid time" intervals. However, to date, no proposals exist for efficient indexing of such temporal RDF databases. It is clearly beneficial to store RDF data in a relational DB - however, standard relational indexes are inadequately equipped to handle RDF's graph structure. In this paper, we propose the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS. Past efforts to store RDF in relational stores include Jena2 from HP, Sesame from OpenRDF.org, and 3store from the University of Southampton. We show that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the tGRIN index exhibits superior performance. In terms of index build time, tGRIN takes two thirds or less of the time used by any other system, and it uses a comparable amount of memory and less disk space than Jena, Sesame and 3store. More importantly, tGRIN can answer queries three to six times faster for average query graph patterns and five to ten times faster for complex queries than these systems.