Ananthakrishna (Entity Resolution Entity Resolution)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2} k)$
Space Complexity
$O(n)$ words
(Derived: the token table, the children table, and the tuples in G are stored in main memory, each are of size $O(n)$)
Description
Delphi algorithm
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2002