Ananthakrishna (Entity Resolution Entity Resolution)
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://doi.org/10.1016/B978-155860869-6/50058-5")
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