aboutsummaryrefslogtreecommitdiffstats
path: root/lib/algebra.ml
blob: 8701dcbb219f465f2762b65e9bfef2e48fd53406 (plain) (blame)
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
type error =
  | StorageError   of string
  | GeneratorError of string

module Make(Storage : Management.Physical.S) = struct
  module Ops = Manipulation.Make(Storage)
  type storage = Storage.t

  (* Internal generator utilities *)

  let rec list_generator : Tuple.t list -> Generator.t = function
    | []        -> (fun _pos -> Generator.Done)
    | t :: rest -> (fun _pos -> Generator.Value (t, list_generator rest))

  let drain gen =
    let rec go gen pos acc =
      match gen (Some pos) with
      | Generator.Done            -> Ok (List.rev acc)
      | Generator.Error e         -> Error (GeneratorError e)
      | Generator.Value (t, next) -> go next (pos + 1) (t :: acc)
    in go gen 0 []

  let to_generator (storage : storage) (rel : Relation.t) : Generator.t =
    match rel.Relation.generator with
    | Some gen -> gen
    | None ->
      let hashes = Ops.tuple_hashes rel in
      (match Ops.load_tuples storage hashes with
       | Error _ -> (fun _pos -> Generator.Error ("Failed to load: " ^ rel.Relation.name))
       | Ok ts -> list_generator (List.map (fun t -> Tuple.Materialized t) ts))

  let of_generator ~name ~schema gen =
    Relation.make
      ~hash:None ~name ~schema ~tree:None ~constraints:None
      ~cardinality:Conventions.Cardinality.AlephZero
      ~generator:(Some gen)
      ~membership_criteria:(fun _ -> true)
      ~provenance:Relation.Provenance.Undefined
      ~lineage:(Relation.Lineage.Base "derived")

  let const_relation (pairs : (string * Conventions.AbstractValue.t) list) : Relation.t =
    let attrs = List.fold_left (fun acc (k, v) ->
      Tuple.AttributeMap.add k { Attribute.value = v } acc)
      Tuple.AttributeMap.empty pairs
    in
    let tuple = Tuple.Materialized { Tuple.relation = "const"; attributes = attrs } in
    let schema = List.map (fun (k, _) -> (k, "abstract")) pairs in
    of_generator ~name:"const" ~schema (list_generator [tuple])

  (* Operators *)

  let select_fn storage predicate rel =
    let gen = to_generator storage rel in
    let lazy_gen =
      let rec go g pos =
        match g pos with
        | Generator.Done    -> Generator.Done
        | Generator.Error e -> Generator.Error e
        | Generator.Value (t, next) ->
          if predicate t then Generator.Value (t, go next)
          else go next (Option.map ((+) 1) pos)
      in fun pos -> go gen pos
    in
    Ok (of_generator ~name:("σ_" ^ rel.Relation.name) ~schema:rel.Relation.schema lazy_gen)

  let project storage (attrs : string list) rel =
    let gen = to_generator storage rel in
    let project_tuple = function
      | Tuple.Materialized t ->
        let attrs' = List.fold_left (fun acc k ->
          match Tuple.AttributeMap.find_opt k t.Tuple.attributes with
          | None   -> acc
          | Some v -> Tuple.AttributeMap.add k v acc)
          Tuple.AttributeMap.empty attrs in
        Tuple.Materialized { t with attributes = attrs' }
      | other -> other
    in
    let new_schema = List.filter (fun (n, _) -> List.mem n attrs) rel.Relation.schema in
    let lazy_gen =
      let rec go g pos = match g pos with
        | Generator.Done    -> Generator.Done
        | Generator.Error e -> Generator.Error e
        | Generator.Value (t, next) -> Generator.Value (project_tuple t, go next)
      in fun pos -> go gen pos
    in
    Ok (of_generator ~name:("π_" ^ rel.Relation.name) ~schema:new_schema lazy_gen)

  let rename storage (renames : (string * string) list) rel =
    let rename_key k = match List.assoc_opt k renames with Some k' -> k' | None -> k in
    let rename_tuple = function
      | Tuple.Materialized t ->
        let attrs' = Tuple.AttributeMap.fold (fun k v acc ->
          Tuple.AttributeMap.add (rename_key k) v acc)
          t.Tuple.attributes Tuple.AttributeMap.empty in
        Tuple.Materialized { t with attributes = attrs' }
      | other -> other
    in
    let gen = to_generator storage rel in
    let new_schema = List.map (fun (n, d) -> (rename_key n, d)) rel.Relation.schema in
    let lazy_gen =
      let rec go g pos = match g pos with
        | Generator.Done    -> Generator.Done
        | Generator.Error e -> Generator.Error e
        | Generator.Value (t, next) -> Generator.Value (rename_tuple t, go next)
      in fun pos -> go gen pos
    in
    Ok (of_generator ~name:("ρ_" ^ rel.Relation.name) ~schema:new_schema lazy_gen)

  let equijoin storage (attrs : string list) left right =
    let right_gen = to_generator storage right in
    match drain right_gen with
    | Error e -> Error e
    | Ok right_tuples ->
      let left_gen = to_generator storage left in
      let get_vals attr_list = function
        | Tuple.Materialized t ->
          List.map (fun a -> Tuple.AttributeMap.find_opt a t.Tuple.attributes) attr_list
        | _ -> List.map (fun _ -> None) attr_list
      in
      let merge lt rt = match lt, rt with
        | Tuple.Materialized l, Tuple.Materialized r ->
          Tuple.Materialized { l with attributes =
            Tuple.AttributeMap.union (fun _ a _ -> Some a)
              l.Tuple.attributes r.Tuple.attributes }
        | _ -> lt
      in
      let merged_schema =
        left.Relation.schema @
        List.filter (fun (n, _) ->
          not (List.mem n attrs) &&
          not (List.exists (fun (m, _) -> m = n) left.Relation.schema))
          right.Relation.schema
      in
      let join_gen =
        let rec chain_with_cont g cont pos =
          match g pos with
          | Generator.Done            -> cont pos
          | Generator.Value (t, next) -> Generator.Value (t, fun p -> chain_with_cont next cont p)
          | Generator.Error e         -> Generator.Error e
        in
        let rec from_left lgen lpos =
          fun pos ->
          match lgen (Some lpos) with
          | Generator.Done    -> Generator.Done
          | Generator.Error e -> Generator.Error e
          | Generator.Value (lt, next_left) ->
            let lv = get_vals attrs lt in
            let matches = List.filter_map (fun rt ->
              if get_vals attrs rt = lv then Some (merge lt rt) else None) right_tuples in
            (match matches with
             | [] -> from_left next_left (lpos + 1) pos
             | _  ->
               chain_with_cont (list_generator matches)
                 (from_left next_left (lpos + 1)) pos)
        in
        from_left left_gen 0
      in
      let name = "⋈_" ^ left.Relation.name ^ "_" ^ right.Relation.name in
      Ok (of_generator ~name ~schema:merged_schema join_gen)

  let union storage rel1 rel2 =
    let gen1 = to_generator storage rel1 in
    let gen2 = to_generator storage rel2 in
    let chain_gen =
      let rec go g1 g2 pos =
        match g1 pos with
        | Generator.Done    -> g2 pos
        | Generator.Error _ -> g2 pos
        | Generator.Value (t, next) -> Generator.Value (t, fun p -> go next g2 p)
      in fun pos -> go gen1 gen2 pos
    in
    let name = "∪_" ^ rel1.Relation.name ^ "_" ^ rel2.Relation.name in
    Ok (of_generator ~name ~schema:rel1.Relation.schema chain_gen)

  let attrs_equal
      (m1 : Attribute.materialized Tuple.AttributeMap.t)
      (m2 : Attribute.materialized Tuple.AttributeMap.t) =
    Tuple.AttributeMap.equal
      (fun a b -> Stdlib.(=) a.Attribute.value b.Attribute.value) m1 m2

  let diff storage rel1 rel2 =
    let right_gen = to_generator storage rel2 in
    match drain right_gen with
    | Error e -> Error e
    | Ok right_tuples ->
      let right_mats = List.filter_map (function
        | Tuple.Materialized t -> Some t | _ -> None) right_tuples in
      let left_gen = to_generator storage rel1 in
      let not_in_right = function
        | Tuple.Materialized t ->
          not (List.exists (fun r ->
            attrs_equal t.Tuple.attributes r.Tuple.attributes) right_mats)
        | _ -> true
      in
      let lazy_gen =
        let rec go g pos =
          match g pos with
          | Generator.Done    -> Generator.Done
          | Generator.Error e -> Generator.Error e
          | Generator.Value (t, next) ->
            if not_in_right t then Generator.Value (t, go next)
            else go next (Option.map ((+) 1) pos)
        in fun pos -> go left_gen pos
      in
      let name = "−_" ^ rel1.Relation.name ^ "_" ^ rel2.Relation.name in
      Ok (of_generator ~name ~schema:rel1.Relation.schema lazy_gen)

  let take storage n rel =
    let gen = to_generator storage rel in
    let lazy_gen =
      let rec go g count pos =
        if count = 0 then Generator.Done
        else match g pos with
          | Generator.Done    -> Generator.Done
          | Generator.Error e -> Generator.Error e
          | Generator.Value (t, next) -> Generator.Value (t, go next (count - 1))
      in fun pos -> go gen n pos
    in
    Ok (of_generator ~name:("τ_" ^ rel.Relation.name) ~schema:rel.Relation.schema lazy_gen)

  let materialize storage rel : (Tuple.materialized list, error) Result.t =
    match drain (to_generator storage rel) with
    | Error e -> Error e
    | Ok tuples ->
      Ok (List.filter_map (function Tuple.Materialized t -> Some t | _ -> None) tuples)

end

module Memory = Make(Management.Physical.Memory)