User:WikiLinuz/Notes

TCP reset attack
For TCP reset attack.

AVL Tree
This article also needs to be re-written. The recommended encyclopedic structure:
 * Definition
 * Balance factor
 * Operations
 * Search
 * Traversal
 * Insert
 * Rotations
 * Delete
 * Rotations

Insert::Rotations

LL, RR, RL, LR

Delete::Rotations

R0, R1, R-1, L0, L1, L-1

Remove every C++ nonsense and replace it with (sourced) language-agnostic MOS:ALGO.

Potential nominees

 * 1) Consistent hashing — mostly good, needs a bit of ce.
 * 2) Hash table — re-written basically core parts, but needs work starting from "Performance" sub-heading.
 * 3) Heartbeat (computing) — a picture?

Currently active ones

 * 1) Binary search tree
 * 2) Trie

Distributed cache

 * See also: 1 and 2
 * See also: 1 and 2
 * See also: 1 and 2
 * See also: 1 and 2
 * See also: 1 and 2



Miscellaneous/off-topic

 * See also: 1
 * See also: 1



A wild wild west Dutch bulletproof hoster (AS202425 based in Seychelles, virtually impenetrable) - wildly known for hosting child abuse material on the open web (cybercrime, etc.), and refusing to remove those.
 * IP Volume Inc

Height
This should be probably moved to AVL tree  Height of the binary search tree is defined as the maximum of the heights of left subtree and right subtree incremented by a factor of 1. Following is a recursive procedure for calculating the height of the BST given a root $$x$$:

Hash tables
Remarks from David Eppstein:

A few points:
 * Space-time tradeoff paragraph of lead: makes no sense to me and not summarizing anything later.
 * History really deserves more than a three-line summary.
 * "Ershov had the same idea": Who? When? How was it disseminated?
 * "finite entries in the hash table": what would an entry that is not finite look like?
 * There is no overview section saying what a hash table is; the only material about that is in the lead.
 * Hash function section starts getting into details about desiderata and methods without ever saying clearly what it is: a function, often incorporating a small random seed, for mapping keys to table addresses.
 * "Uniformity is sometimes difficult to ensure by design, but may be evaluated empirically using statistical tests,": this feels like really out-of-date advice when we now have theoretical methods for guaranteeing correct behavior of hash functions (k-independence). K-independence and universal are written about in two separate paragraphs as if they are two separate things (they are not).
 * Somewhere around here is the point, about 1/3 of the way of the article, where in a real review I would have given up and quick-failed it because there are just too many points where it is too far from having the appropriate coverage. The next section, on collision resolution methods, for instance, is probably too detailed on some methods and again really misses the big picture, failing both WP:GACR 3a and 3b.
 * In case you plan to make the necessary significant revisions and might find it helpful, my lecture notes on this material (for one week out of a graduate-level course on data structures) are https://www.ics.uci.edu/~eppstein/261/lecture2a.pdf, https://www.ics.uci.edu/~eppstein/261/lecture2b.pdf, https://www.ics.uci.edu/~eppstein/261/lecture2c.pdf — there's also related material in weeks 1 (the dynamic arrays you need for resizable hash tables) and weeks 3-4 (other hashing-related data structures that are not actually hash tables).