Shared nothing architecture

Known as: Shared-nothing, Shared nothing, Shared-nothing architecture 
A shared nothing architecture (SN) is a distributed computing architecture in which each node is independent and self-sufficient, and there is no… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Data processing systems offer an ever increasing degree of parallelism on the levels of cores, CPUs, and processing nodes. Query… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2014
Highly Cited
2014
SQL query processing for analytics over Hadoop data has recently gained significant traction. Among many systems providing some… (More)
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We investigate a new approach to the design of distributed, shared-nothing RDF engines. Our engine, coined "TriAD", combines join… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Multitenant data infrastructures for large cloud platforms hosting hundreds of thousands of applications face the challenge of… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2011
2011
The need for efficient data generation for the purposes of testing and benchmarking newly developed massively-parallel data… (More)
  • figure 1
Is this relevant?
2010
2010
The amount of Semantic Web data is outgrowing the capacity of Semantic Web stores. Similar to traditional databases, scaling up… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1999
1999
Effective data placement is crucial to the performance of any parallel database system as it is an important lever for load… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?