Skip to main content
. Author manuscript; available in PMC: 2017 Feb 14.
Published in final edited form as: Proc Int Conf Data Eng. 2016 Jun 23;2016:906–917. doi: 10.1109/ICDE.2016.7498300

Algorithm 1.

Greedy Algorithm for Problem 3
Input: k (Number of rules required), T (database table), mw (max weight), W
    (weight function)
Output: S (Solution set of rules)
S = ϕ
for i from 1 to k do
graphic file with name nihms843641t1.jpg Rm = Find_best_marginal_rule(S, T, mw, W)
S = S ∪ {Rm}
return S