FAQ

Partition (database)

Known as: Horizontal partitioning, Partition, Range partitioning 
A partition is a division of a logical database or its constituent elements into distinct independent parts. Database partitioning is normally done… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
020406019762018

Related topics

Related topics

31 relations
Block Range IndexCUBRIDColumn (database)Column-oriented DBMS
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Partition (database)
Database
Scalability
Load balancing (computing)
Relational database management system
Column (database)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
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
2004
Highly Cited
2004
Integrating Vertical and Horizontal Partitioning Into Automated Physical Database Design
In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 9
  • figure 7
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Database Tuning Advisor for Microsoft SQL Server 2005
Database Tuning Advisor (DTA) is a physical database design tool that is part of Microsoft's SQL Server 2005 relational database… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Dynamic Metadata Management for Petabyte-Scale File Systems
In petabyte-scale distributed file systems that decouple read and write from metadata operations, behavior of the metadata server… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
An affine partitioning algorithm to maximize parallelism and minimize communication
An affine partitioning Framework unifies many useful program transforms such as unimodular transformations (interchange, reversal… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Exploiting Dual Data-Memory Banks in Digital Signal Processors
Over the past decade, digital signal processors (DSPs) have emerged as the processors of choice for implementing embedded… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Vertical Partitioning for Database Design: A Graphical Algorithm
Vertical partitioning is the process of subdividing the attributes of a relation or a record type, creating fragments. Previous… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Vertical Partitioning Algorithms for Database Design
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind… (More)
  • figure 1
  • figure 2
  • table II
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Database Partitioning in a Cluster of Processors
In a distributed database system the partitioning and allocation of the database over the processor nodes of the network can be a… (More)
Is this relevant?