-
Notifications
You must be signed in to change notification settings - Fork 44
Expand file tree
/
Copy pathJoin.hs
More file actions
348 lines (316 loc) · 13.3 KB
/
Join.hs
File metadata and controls
348 lines (316 loc) · 13.3 KB
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
92
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}
module DataFrame.Operations.Join where
import Control.Applicative (asum)
import qualified Data.HashMap.Strict as HM
import qualified Data.Map.Strict as M
import Data.Maybe (fromMaybe)
import qualified Data.Text as T
import Data.Type.Equality (TestEquality (..))
import qualified Data.Vector as VB
import qualified Data.Vector.Unboxed as VU
import DataFrame.Internal.Column as D
import DataFrame.Internal.DataFrame as D
import DataFrame.Operations.Aggregation as D
import DataFrame.Operations.Core as D
import Type.Reflection
-- | Equivalent to SQL join types.
data JoinType
= INNER
| LEFT
| RIGHT
| FULL_OUTER
validateJoinColumns :: [T.Text] -> DataFrame -> DataFrame -> ()
validateJoinColumns cs df1 df2 =
let
df1Cols = D.columnNames df1
df2Cols = D.columnNames df2
missingInDf1 = filter (`notElem` df1Cols) cs
missingInDf2 = filter (`notElem` df2Cols) cs
missing = missingInDf1 ++ missingInDf2
in
if not (null missing)
then error $ "Column not found: " <> show missing
else ()
{- | Join two dataframes using SQL join semantics.
Only inner join is implemented for now.
-}
join ::
JoinType ->
[T.Text] ->
DataFrame -> -- Right hand side
DataFrame -> -- Left hand side
DataFrame
join INNER xs right = innerJoin xs right
join LEFT xs right = leftJoin xs right
join RIGHT xs right = rightJoin xs right
join FULL_OUTER xs right = fullOuterJoin xs right
{- | Performs an inner join on two dataframes using the specified key columns.
Returns only rows where the key values exist in both dataframes.
==== __Example__
@
ghci> df = D.fromNamedColumns [("key", D.fromList ["K0", "K1", "K2", "K3"]), ("A", D.fromList ["A0", "A1", "A2", "A3"])]
ghci> other = D.fromNamedColumns [("key", D.fromList ["K0", "K1", "K2"]), ("B", D.fromList ["B0", "B1", "B2"])]
ghci> D.innerJoin ["key"] df other
-----------------
key | A | B
------|-----|----
Text | Text| Text
------|-----|----
K0 | A0 | B0
K1 | A1 | B1
K2 | A2 | B2
@
-}
innerJoin :: [T.Text] -> DataFrame -> DataFrame -> DataFrame
innerJoin cs right left =
let
_ = validateJoinColumns cs right left
-- Prepare Keys for the Right DataFrame
rightIndicesToGroup =
[c | (k, c) <- M.toList (D.columnIndices right), k `elem` cs]
rightRowRepresentations :: VU.Vector Int
rightRowRepresentations = D.computeRowHashes rightIndicesToGroup right
-- Build the Hash Map: Int -> Vector of Indices
-- We use ifoldr to efficiently insert (index, key) without intermediate allocations.
rightKeyMap :: HM.HashMap Int (VU.Vector Int)
rightKeyMap =
let accumulator =
VU.ifoldr
(\i key acc -> HM.insertWith (++) key [i] acc)
HM.empty
rightRowRepresentations
in HM.map (VU.fromList . reverse) accumulator
-- Prepare Keys for Left DataFrame
leftIndicesToGroup =
[c | (k, c) <- M.toList (D.columnIndices left), k `elem` cs]
leftRowRepresentations :: VU.Vector Int
leftRowRepresentations = D.computeRowHashes leftIndicesToGroup left
-- Perform the Join
(leftIndexChunks, rightIndexChunks) =
VU.ifoldr
( \lIdx key (lAcc, rAcc) ->
case HM.lookup key rightKeyMap of
Nothing -> (lAcc, rAcc)
Just rIndices ->
let len = VU.length rIndices
-- Replicate the Left Index to match the number of Right matches
lChunk = VU.replicate len lIdx
in (lChunk : lAcc, rIndices : rAcc)
)
([], [])
leftRowRepresentations
-- Flatten chunks
expandedLeftIndicies = VU.concat leftIndexChunks
expandedRightIndicies = VU.concat rightIndexChunks
resultLen = VU.length expandedLeftIndicies
-- Construct Result DataFrames
expandedLeft =
left
{ columns = VB.map (D.atIndicesStable expandedLeftIndicies) (D.columns left)
, dataframeDimensions = (resultLen, snd (D.dataframeDimensions left))
}
expandedRight =
right
{ columns = VB.map (D.atIndicesStable expandedRightIndicies) (D.columns right)
, dataframeDimensions = (resultLen, snd (D.dataframeDimensions right))
}
leftColumns = D.columnNames left
rightColumns = D.columnNames right
insertIfPresent _ Nothing df = df
insertIfPresent name (Just c) df = D.insertColumn name c df
in
D.fold
( \name df ->
if name `elem` cs
then df
else
( if name `elem` leftColumns
then insertIfPresent ("Right_" <> name) (D.getColumn name expandedRight) df
else insertIfPresent name (D.getColumn name expandedRight) df
)
)
rightColumns
expandedLeft
{- | Performs a left join on two dataframes using the specified key columns.
Returns all rows from the left dataframe, with matching rows from the right dataframe.
Non-matching rows will have Nothing/null values for columns from the right dataframe.
==== __Example__
@
ghci> df = D.fromNamedColumns [("key", D.fromList ["K0", "K1", "K2", "K3"]), ("A", D.fromList ["A0", "A1", "A2", "A3"])]
ghci> other = D.fromNamedColumns [("key", D.fromList ["K0", "K1", "K2"]), ("B", D.fromList ["B0", "B1", "B2"])]
ghci> D.leftJoin ["key"] df other
------------------------
key | A | B
------|-----|----------
Text | Text| Maybe Text
------|-----|----------
K0 | A0 | Just "B0"
K1 | A1 | Just "B1"
K2 | A2 | Just "B2"
K3 | A3 | Nothing
@
-}
leftJoin ::
[T.Text] -> DataFrame -> DataFrame -> DataFrame
leftJoin cs right left =
let
_ = validateJoinColumns cs right left
leftIndicesToGroup = M.elems $ M.filterWithKey (\k _ -> k `elem` cs) (D.columnIndices left)
leftRowRepresentations = D.computeRowHashes leftIndicesToGroup left
rightIndicesToGroup = M.elems $ M.filterWithKey (\k _ -> k `elem` cs) (D.columnIndices right)
rightRowRepresentations = D.computeRowHashes rightIndicesToGroup right
rightKeyCountsAndIndices =
VU.foldr
(\(i, v) acc -> M.insertWith (++) v [i] acc)
M.empty
(VU.indexed rightRowRepresentations)
rightKeyCountsAndIndicesVec = M.map VU.fromList rightKeyCountsAndIndices
leftRowCount = fst (D.dimensions left)
pairs =
[ (i, maybeRight)
| i <- [0 .. leftRowCount - 1]
, maybeRight <-
case M.lookup (leftRowRepresentations VU.! i) rightKeyCountsAndIndicesVec of
Nothing -> [Nothing]
Just rVec -> map Just (VU.toList rVec)
]
expandedLeftIndicies = VU.fromList (map fst pairs)
expandedRightIndicies = VB.fromList (map snd pairs)
expandedLeft =
left
{ columns = VB.map (D.atIndicesStable expandedLeftIndicies) (D.columns left)
, dataframeDimensions =
(VU.length expandedLeftIndicies, snd (D.dataframeDimensions left))
}
expandedRight =
right
{ columns = VB.map (D.atIndicesWithNulls expandedRightIndicies) (D.columns right)
, dataframeDimensions =
(VB.length expandedRightIndicies, snd (D.dataframeDimensions right))
}
leftColumns = D.columnNames left
rightColumns = D.columnNames right
initDf = expandedLeft
insertIfPresent _ Nothing df = df
insertIfPresent name (Just c) df = D.insertColumn name c df
in
D.fold
( \name df ->
if name `elem` cs
then df
else
( if name `elem` leftColumns
then insertIfPresent ("Right_" <> name) (D.getColumn name expandedRight) df
else insertIfPresent name (D.getColumn name expandedRight) df
)
)
rightColumns
initDf
{- | Performs a right join on two dataframes using the specified key columns.
Returns all rows from the right dataframe, with matching rows from the left dataframe.
Non-matching rows will have Nothing/null values for columns from the left dataframe.
==== __Example__
@
ghci> df = D.fromNamedColumns [("key", D.fromList ["K0", "K1", "K2", "K3"]), ("A", D.fromList ["A0", "A1", "A2", "A3"])]
ghci> other = D.fromNamedColumns [("key", D.fromList ["K0", "K1"]), ("B", D.fromList ["B0", "B1"])]
ghci> D.rightJoin ["key"] df other
-----------------
key | A | B
------|-----|----
Text | Text| Text
------|-----|----
K0 | A0 | B0
K1 | A1 | B1
@
-}
rightJoin ::
[T.Text] -> DataFrame -> DataFrame -> DataFrame
rightJoin cs left right = leftJoin cs right left
fullOuterJoin ::
[T.Text] -> DataFrame -> DataFrame -> DataFrame
fullOuterJoin cs right left =
let
_ = validateJoinColumns cs right left
leftIndicesToGroup = M.elems $ M.filterWithKey (\k _ -> k `elem` cs) (D.columnIndices left)
leftRowRepresentations = D.computeRowHashes leftIndicesToGroup left
leftKeyCountsAndIndices =
VU.foldr
(\(i, v) acc -> M.insertWith (++) v [i] acc)
M.empty
(VU.indexed leftRowRepresentations)
leftKeyCountsAndIndicesVec = M.map VU.fromList leftKeyCountsAndIndices
rightIndicesToGroup = M.elems $ M.filterWithKey (\k _ -> k `elem` cs) (D.columnIndices right)
rightRowRepresentations = D.computeRowHashes rightIndicesToGroup right
rightKeyCountsAndIndices =
VU.foldr
(\(i, v) acc -> M.insertWith (++) v [i] acc)
M.empty
(VU.indexed rightRowRepresentations)
rightKeyCountsAndIndicesVec = M.map VU.fromList rightKeyCountsAndIndices
matchedPairs =
concatMap
( \(lVec, rVec) ->
[ (Just lIdx, Just rIdx)
| lIdx <- VU.toList lVec
, rIdx <- VU.toList rVec
]
)
( M.elems
(M.intersectionWith (,) leftKeyCountsAndIndicesVec rightKeyCountsAndIndicesVec)
)
leftOnlyPairs =
concatMap
(map (\lIdx -> (Just lIdx, Nothing)) . VU.toList)
(M.elems (leftKeyCountsAndIndicesVec `M.difference` rightKeyCountsAndIndicesVec))
rightOnlyPairs =
concatMap
(map (\rIdx -> (Nothing, Just rIdx)) . VU.toList)
(M.elems (rightKeyCountsAndIndicesVec `M.difference` leftKeyCountsAndIndicesVec))
pairs = matchedPairs ++ leftOnlyPairs ++ rightOnlyPairs
expandedLeftIndicies = VB.fromList (map fst pairs)
expandedRightIndicies = VB.fromList (map snd pairs)
expandedLeft =
left
{ columns = VB.map (D.atIndicesWithNulls expandedLeftIndicies) (D.columns left)
, dataframeDimensions =
(VB.length expandedLeftIndicies, snd (D.dataframeDimensions left))
}
expandedRight =
right
{ columns = VB.map (D.atIndicesWithNulls expandedRightIndicies) (D.columns right)
, dataframeDimensions =
(VB.length expandedRightIndicies, snd (D.dataframeDimensions right))
}
leftColumns = D.columnNames left
rightColumns = D.columnNames right
initDf = expandedLeft
insertIfPresent _ Nothing df = df
insertIfPresent name (Just c) df = D.insertColumn name c df
in
D.fold
( \name df ->
if name `elem` cs
then case (D.unsafeGetColumn name expandedRight, D.unsafeGetColumn name expandedLeft) of
( OptionalColumn (left :: VB.Vector (Maybe a))
, OptionalColumn (right :: VB.Vector (Maybe b))
) -> case testEquality (typeRep @a) (typeRep @b) of
Nothing -> error "Cannot join columns of different types"
Just Refl ->
D.insert
name
(VB.map (fromMaybe undefined) (VB.zipWith (\l r -> asum [l, r]) left right))
df
_ -> error "Join should have optional keys."
else
( if name `elem` leftColumns
then insertIfPresent ("Right_" <> name) (D.getColumn name expandedRight) df
else insertIfPresent name (D.getColumn name expandedRight) df
)
) -- ???
rightColumns
initDf