Scalable Semantic Web Data Management Using Vertical Partitioning

By Daniel J. Abadi, Adam Marcus, Samuel Madden, Katherine J. Hollenbach. 2007

786 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Split learning for health: Distributed deep learning without sharing raw patient data (2018, background): “That said, with regards to non-neural network based federated learning techniques, the work in [27] shows their applicability to vertically partitioned distributed data [33, 34, 26, 35] shows applicability to multi-task learning in distributed settings.”
The Internet of Things: A Survey from the Data-Centric Perspective (2013, unknown): “It was argued in [110] that the scheme in [1] is also not particularly effective, unless the properties appear as bound variables.”
RDF-3X: a RISC-style engine for RDF (2008, methodology): “We implemented the approach as described in [1], but used MonetDB 5.”
Scalable SPARQL querying of large RDF graphs (2011, background): “RDFSuite [7], and continued through many new systems that have been proposed in the last few years [12, 4, 24, 32, 29, 25, 15].”
Foundations of SPARQL query optimization (2008, background): “In addition, indices [13] and storage schemes [30, 34, 6, 3] for RDF have been explored, to provide efficient data access paths.”
SP^2Bench: A SPARQL Performance Benchmark (2008, methodology): “To give another proof of concept, in [33] we have successfully used SP (2)Bench to identify previously unknown limitations of RDF storage schemes: Among others, we identified scenarios where the advanced vertical storage scheme from [12] was slower than a simple triple store approach.”
The RDF-3X engine for scalable management of RDF data (2010, methodology): “We implemented the approach as described in [1], but used MonetDB 5.”
A Native and Adaptive Approach for Unified Processing of Linked Streams and Linked Data (2011, methodology): “We apply dictionary encoding, a method commonly used by triple stores [1, 16, 13].”
Binary RDF representation for publication and exchange (HDT) (2013, background): “Predicate degree constitutes an important metric for vertical partitioning technique [21], in which an index (subject, object) is”
Multi-tenant databases for software as a service: schema-mapping techniques (2008, background): “) databases [4, 23], which leverage the ability to selectively read in columns to improve the performance of analytics [23] and RDF data [1].”
gStore: Answering SPARQL Queries via Subgraph Matching (2011, background): “Recent studies have focused on scalable techniques for large RDF repositories (e.g. [2, 12, 13, 25, 22]).”
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data (2009, background): “Recently, many database researchers have proposed solutions for the efficient storage and querying of RDF data (e.g. [3], [4], [5]).”