Relational schema optimization for RDF-based knowledge graphs
TLDR
This paper introduces a novel technique, for merging CSs based on their hierarchical structure, which employs a lattice to capture the hierarchical relationships between CSs, identifies denseCSs and merges dense CSs with their ancestors.About:
This article is published in Information Systems.The article was published on 2022-02-01 and is currently open access. It has received 4 citations till now. The article focuses on the topics: Computer science & RDF.read more
Citations
More filters
Journal ArticleDOI
Learning knowledge graph embeddings by deep relational roto-reflection
TL;DR: DeepER as discussed by the authors proposes a group convolution and hyper-network-based neural embedding model for knowledge graph completion, which utilizes rotation and reflection transformations of group convolutions to produce more expressive feature maps for entities and relations.
Journal ArticleDOI
Semantic Units: Organizing knowledge graphs into semantically meaningful units of representation
TL;DR: In this paper , the authors discuss four challenges that impede the use of FAIR knowledge graphs and discuss the potential of semantic units to solve the challenges by structuring a knowledge graph into identifiable and semantically meaningful subgraphs.
Proceedings ArticleDOI
mStore: Schema Mining based-RDF Data Storage
TL;DR: mStore as mentioned in this paper is a prototype system with flexible schemas based on schema mining, which can replace costly joins with low-cost selects, improving the query performance and reducing the pre-processing time overhead.
Proceedings Article
CoPMP: Correlated Predicates Merging and Partition for SPARQL Query Optimization
TL;DR: In this article , the authors proposed CoPMP, which combines CSs based on the correlations between predicates within the CSs and partitioning predicates to reduce the number of CSs.
References
More filters
Journal ArticleDOI
LUBM: A benchmark for OWL knowledge base systems
TL;DR: This work describes the method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications and presents the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks.
Proceedings Article
Scalable semantic web data management using vertical partitioning
TL;DR: The results show that a vertical partitioned schema achieves similar performance to the property table technique while being much simpler to design, and if a column-oriented DBMS is used instead of a row-oriented database, another order of magnitude performance improvement is observed, with query times dropping from minutes to several seconds.
Journal ArticleDOI
Hexastore: sextuple indexing for semantic web data management
TL;DR: This paper proposes an RDF storage scheme that uses the triple nature of RDF as an asset, which confers significant advantages compared to previous approaches for RDF data management, at the price of a worst-case five-fold increase in index space.
Journal ArticleDOI
The RDF-3X engine for scalable management of RDF data
Thomas Neumann,Gerhard Weikum +1 more
TL;DR: The RDF-3X engine is presented, an implementation of SPARQL that achieves excellent performance by pursuing a RISC-style architecture with streamlined indexing and query processing, and can outperform the previously best alternatives by one or two orders of magnitude.
Proceedings ArticleDOI
Index selection for OLAP
TL;DR: The authors give algorithms that automate the selection of summary tables and indexes, and present a family of algorithms of increasing time complexities, and prove strong performance bounds for them.