Data partitioning deals with the dividing of a collection of data into smaller collections of data for the purpose of faster processing, easier statistics gathering and smaller memory/persistence footprint.
Questions tagged [data-partitioning]
337 questions
2
votes
3 answers
Matlab partition problem
My head gets stucked finding an algorithm for my problem.
Assume I have N Numbers (lets say 4) and I want have ALL X-Partitions (X = N/2)
Example:
2-Partitions of {1,2,3,4} are: (1,2) (1,3) (1,4) (2,3) (2,4) (3,4) [Simply: all combinations]
I don't…

Bigbohne
- 1,356
- 3
- 12
- 24
2
votes
1 answer
Algorithm for number of transitions between pair of set (graph) partitions
Say I have a set (or graph) which is partitioned into groups. I am interested to find the number of transitions between two partitions, where a transition involves taking an element out of one partition and moving it into another (or singleton…

zenna
- 9,006
- 12
- 73
- 101
2
votes
2 answers
Generating partitions in Java
I am given an integer (lets call it x) and I need to generate an array of arrays, where each subarray is a list of elements which are one of a given set of integers, and the sum of all of the elements of each subarray is x. The array of arrays needs…

Kamran
- 111
- 4
2
votes
1 answer
Cassandra not balancing data over existing nodes in cluster
Greeings,
I have configured 3 node Cassandra 1.2.12 cluster and I am able to connect to master and create keyspaces and tables over all nodes. However, I want to run YCSB over my cluster so when I run YCSB and load data it is all loaded on Master.…

Nika
- 43
- 4
2
votes
1 answer
Predicate syntax when partitioning a vector of pointers (C++)
I have a vector of pointers to objects. I'd like to remove objects from this vector according to an attribute that's reported by a member function.
I'm trying to follow a nice example I found on how to delete certain pointers (and their associated…

Sarah
- 1,614
- 1
- 23
- 37
2
votes
6 answers
How can I maximally partition a set?
I'm trying to solve one of the Project Euler problems. As a consequence, I need an algorithm that will help me find all possible partitions of a set, in any order.
For instance, given the set 2 3 3 5:
2 | 3 3 5
2 | 3 | 3 5
2 | 3 3 | 5
2 | 3 | 3 |…

Gregory Higley
- 15,923
- 9
- 67
- 96
2
votes
1 answer
Partitions vs multiple cubes performance
Given this scenario,
Sales information for three countries.
CountryA: 0.9M records.
CountryB: 0.8M records.
CountryC: 0.7M records.
Theoretically, what would be the expected performance difference(*) between the following approaches?
A single Cube…

daniloquio
- 3,822
- 2
- 36
- 56
2
votes
1 answer
retrieving partial content using multiple http requsets to fetch data via parllel tasks
i am trying to be as thorough as i can in this post, as it is very important for me,
though the issue is very simple, and only by reading the title of this question, you can get the idea...
question is:
with healthy bandwidth (30mb Vdsl)…

LoneXcoder
- 2,121
- 6
- 38
- 76
2
votes
1 answer
Python partitioning function needs optimization
While researching for a project euler exercise (#78), I've learned that in order to partition a number you can create a power series. From that series you can expand and use the terms coefficient to get the number of ways to partition a particular…

tijko
- 7,599
- 11
- 44
- 64
2
votes
3 answers
Paritioning data using subList in java
I have an List implemented ArrayList having large number of indices. I would like to parition
it into separate ArrayList. I have done as
List
- > list = new ArrayList
- >(10000000);
List
- > sublist1 =…

thetna
- 6,903
- 26
- 79
- 113
2
votes
1 answer
Find all partitions from a list of subsets
Given a list of specific subsets like
S = [ {1, 2}, {3, 4}, {1}, {2, 3}, {4}, {3} ]
and a "universe" set like
U = {1, 2, 3, 4}
what elegant and simple algorithm can be used to find all the possible partitions of U made of sets from S? With this…

Eric O. Lebigot
- 91,433
- 48
- 218
- 260
1
vote
3 answers
in place partition does not work for duplicate elements
I was trying to implement the in place partition subroutine of quicksort.It works with array of unique elements,but fails when the array contains duplicate elements
The code goes like this
def inplace_partitioning(input,l,r):
len_a=len(input)
…

damon
- 8,127
- 17
- 69
- 114
1
vote
1 answer
Partition an array into two arrays in only one pass?
I'd like to pass through an array and make two new arrays: one with the elements that meet a certain condition, and one that does not.
Is this possible in one pass, or will I necessarily have to pass twice: once to determine how big the new arrays…

SN.
- 31
- 1
- 1
- 2
1
vote
2 answers
Grouping strings lexicographically (python)
I have N strings that I want to divide lexicographic into M even-sized buckets (+/- 1 string). Also, N>>M.
The direct way would be to sort all the strings and split the resulting list into the M buckets.
I would like to instead approximate this by…

vsekhar
- 5,090
- 5
- 22
- 23
1
vote
1 answer
Partitioning a large integer using Prolog
I've been trying to teach myself Prolog for a few weeks. Right now I'm trying to find all ways to make a large integer from several smaller integers, using a predicate partition/3 that I want to work like:
| ?- partition(4, [1, 2, 3], X).
X = [1,…

thko
- 113
- 1
- 1
- 8