Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
* Copyright 2015 Manish R Jain <manishrjain@gmail.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package main
import (
"bytes"
"container/heap"
"flag"
"io/ioutil"
"github.com/dgraph-io/dgraph/store/rocksdb"
"github.com/dgraph-io/dgraph/x"
)
type Item struct {
key, value []byte
itIdx int
index int
}
type PriorityQueue []*Item
var stores = flag.String("stores", "", "Folder containing rocksDB directories")
var destinationDB = flag.String("destination", "",
"Folder to store merged rocksDB")
var glog = x.Log("rocksmerge")
func (pq PriorityQueue) Len() int { return len(pq) }
func (pq PriorityQueue) Swap(i, j int) {
pq[i], pq[j] = pq[j], pq[i]
pq[i].index = i
pq[j].index = j
}
func (pq PriorityQueue) Less(i, j int) bool {
return (bytes.Compare(pq[i].key, pq[j].key) <= 0)
}
func (pq *PriorityQueue) Push(y interface{}) {
n := len(*pq)
item := y.(*Item)
item.index = n
*pq = append(*pq, item)
}
func (pq *PriorityQueue) Pop() interface{} {
old := *pq
n := len(old)
item := old[n-1]
item.index = -1 // for safety
*pq = old[0 : n-1]
return item
}
func main() {
flag.Parse()
if len(*stores) == 0 {
glog.Fatal("No Directory specified")
}
files, err := ioutil.ReadDir(*stores)
if err != nil {
glog.Fatal("Cannot open stores directory")
}
var opt *rocksdb.Options
var ropt *rocksdb.ReadOptions
var wopt *rocksdb.WriteOptions
opt = rocksdb.NewOptions()
opt.SetCreateIfMissing(true)
fp := rocksdb.NewBloomFilter(16)
opt.SetFilterPolicy(fp)
ropt = rocksdb.NewReadOptions()
wopt = rocksdb.NewWriteOptions()
wopt.SetSync(true)
var itVec []*rocksdb.Iterator
var db *rocksdb.DB
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
count := 0
for range files {
count++
}
pq := make(PriorityQueue, count)
i := 0
for _, f := range files {
curDb, err := rocksdb.Open(*stores+f.Name(), opt)
if err != nil {
glog.WithField("filepath", *stores+f.Name()).
Fatal("While opening store")
}
it := curDb.NewIterator(ropt)
it.SeekToFirst()
if !it.Valid() {
continue
}
pq[i] = &Item{
key: it.Key(),
value: it.Value(),
itIdx: i,
index: i,
}
i++
itVec = append(itVec, it)
}
heap.Init(&pq)
db, err = rocksdb.Open(*destinationDB, opt)
if err != nil {
glog.WithField("filepath", *destinationDB).
Fatal("While opening store")
}
for pq.Len() > 0 {
top := heap.Pop(&pq).(*Item)
if bytes.Compare(top.key, lastKey) == 0 {
if bytes.Compare(top.value, lastValue) != 0 {
glog.Fatalf("different value for same key %s", lastKey)
}
} else {
db.Put(wopt, top.key, top.value)
lastKey = top.key
lastValue = top.value
}
itVec[top.itIdx].Next()
if !itVec[top.itIdx].Valid() {
continue
}
item := &Item{
key: itVec[top.itIdx].Key(),
value: itVec[top.itIdx].Value(),
itIdx: top.itIdx,
}
heap.Push(&pq, item)
}
db.Close()
}