Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ words
(Derived: store a key for each entry in the "Create Key" phase)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1998
Reference
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1023/A:1009761603038