temp

Author: ArnauPrat

src/main/java/ldbc/socialnet/dbgen/generator/MRWriter.java

@@ -65,7 +65,8 @@ public void writeReducedUserProfiles(int from, int to, int pass,
         try {
             to = to % windowSize;
             for (int i = from; i != to; i = (i+1)%windowSize) {
-                int key = userProfiles[i].getDicElementId(pass);
+                //int key = userProfiles[i].getDicElementId(pass);
+                int key[] = userProfiles[i].getDicElementIds();
                 int block = 0;
                 long id = userProfiles[i].getAccountId();
                 MapReduceKey mpk = new MapReduceKey(block,key,id);

src/main/java/ldbc/socialnet/dbgen/generator/ScalableGenerator.java

@@ -901,11 +901,7 @@ public void mrGenerateUserInfo(int pass, Context context){
                 ReducedUserProfile reduceUserProf = generateGeneralInformation(j);
                 ++numUsersToGenerate;
                 try {
-                    int block =  0;                                                                  // The mapreduce group this university will be assigned.
-                    int key = reduceUserProf.getDicElementId(pass);                                  // The key used to sort within the block.
-                    long id = reduceUserProf.getAccountId();                                         // The id used to sort within the key, to guarantee determinism.
-                    MapReduceKey mpk = new MapReduceKey( block, key, id );
-                    context.write(mpk, reduceUserProf);
+                    context.write(generateKey(pass,reduceUserProf), reduceUserProf);
                 } catch (IOException e) {
                     e.printStackTrace();
                 } catch (InterruptedException e) {
@@ -915,6 +911,17 @@ public void mrGenerateUserInfo(int pass, Context context){
         }
         System.out.println("Number of generated users: "+numUsersToGenerate);
     }
+    private MapReduceKey generateKey( int pass, ReducedUserProfile user ) {
+        int block =  0;                                                                  // The mapreduce group this university will be assigned.
+        int key[] = new int[3];
+         = reduceUserProf.getDicElementIds();                                  // The key used to sort within the block.
+        for( int i = 0; i < NUM_FRIENDSHIP_HADOOP_JOBS;++i) {
+            key[]
+        }
+        long id = reduceUserProf.getAccountId();                                         // The id used to sort within the key, to guarantee determinism.
+        MapReduceKey mpk = new MapReduceKey( block, key, id );
+        return mpk;
+    }
 
     private void generateCellOfUsers2(int newStartIndex, ReducedUserProfile[] _cellReduceUserProfiles){
         int curIdxInWindow;

src/main/java/ldbc/socialnet/dbgen/util/MapReduceKey.java

@@ -49,29 +49,37 @@
 
 public class MapReduceKey implements WritableComparable<MapReduceKey> {
     public int block;       
-    public int key;
+    public int key[];
     public long id;
 
     public MapReduceKey( ) {
+        this.key = new int[3];
     }
 
-    public MapReduceKey( int block, int key, long id) {
+    public MapReduceKey( int block, int key[], long id) {
         this.block = block;
-        this.key = key;
+        this.key = new int[3];
+        this.key[0] = key[0];
+        this.key[1] = key[1];
+        this.key[2] = key[2];
         this.id = id;
     }
 
     @Override
     public void write(DataOutput out) throws IOException {
         out.writeInt(block);
-        out.writeInt(key);
+        out.writeInt(key[0]);
+        out.writeInt(key[1]);
+        out.writeInt(key[2]);
         out.writeLong(id);
     }
 
     @Override
     public void readFields(DataInput in) throws IOException {
         block = in.readInt();
-        key = in.readInt();
+        key[0] = in.readInt();
+        key[1] = in.readInt();
+        key[2] = in.readInt();
         id = in.readLong();
     }
 

src/main/java/ldbc/socialnet/dbgen/util/MapReduceKeyComparator.java

@@ -56,11 +56,13 @@ public int compare(byte[] b1, int s1, int l1, byte[] b2, int s2, int l2){
         int block1 = readInt(b1, s1);
         int block2 = readInt(b2, s2);
         if( block1 != block2 ) return block1 - block2;
-        int key1 = readInt(b1,s1+4);
-        int key2 = readInt(b2,s2+4);
-        if( key1 != key2) return key1 - key2;
-        long id1 = readLong(b1,s1+8);
-        long id2 = readLong(b2,s2+8);
+        int key1[] = {readInt(b1,s1+4), readInt(b1,s1+8), readInt(b1,s1+12)};
+        int key2[] = {readInt(b2,s2+4), readInt(b2,s2+8), readInt(b2,s2+12)};
+        if( key1[0] != key2[0]) return key1[0] - key2[0];
+        if( key1[1] != key2[1]) return key1[1] - key2[1];
+        if( key1[2] != key2[2]) return key1[2] - key2[2];
+        long id1 = readLong(b1,s1+16);
+        long id2 = readLong(b2,s2+16);
         return (int)(id1 - id2);
     }
 }