Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Free
Faster access than browser!
 

K-independent hashing

Index K-independent hashing

In computer science, a family of hash functions is said to be k-independent or k-universal if selecting a function at random from the family guarantees that the hash codes of any designated k keys are independent random variables (see precise mathematical definitions below). [1]

18 relations: Byte, Chernoff bound, Computer science, Double hashing, Exclusive or, Hash function, Image (mathematics), Independence (probability theory), International Colloquium on Automata, Languages and Programming, Journal of the ACM, Lecture Notes in Computer Science, Linear probing, Polynomial, SIAM Journal on Computing, Statistical distance, Symposium on Foundations of Computer Science, Tabulation hashing, Universal hashing.

Byte

The byte is a unit of digital information that most commonly consists of eight bits, representing a binary number.

New!!: K-independent hashing and Byte · See more »

Chernoff bound

In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail distributions of sums of independent random variables.

New!!: K-independent hashing and Chernoff bound · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: K-independent hashing and Computer science · See more »

Double hashing

Double hashing is a computer programming technique used in hash tables to resolve hash collisions, in cases when two different values to be searched for produce the same hash key.

New!!: K-independent hashing and Double hashing · See more »

Exclusive or

Exclusive or or exclusive disjunction is a logical operation that outputs true only when inputs differ (one is true, the other is false).

New!!: K-independent hashing and Exclusive or · See more »

Hash function

A hash function is any function that can be used to map data of arbitrary size to data of a fixed size.

New!!: K-independent hashing and Hash function · See more »

Image (mathematics)

In mathematics, an image is the subset of a function's codomain which is the output of the function from a subset of its domain.

New!!: K-independent hashing and Image (mathematics) · See more »

Independence (probability theory)

In probability theory, two events are independent, statistically independent, or stochastically independent if the occurrence of one does not affect the probability of occurrence of the other.

New!!: K-independent hashing and Independence (probability theory) · See more »

International Colloquium on Automata, Languages and Programming

ICALP, the International Colloquium on Automata, Languages and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe.

New!!: K-independent hashing and International Colloquium on Automata, Languages and Programming · See more »

Journal of the ACM

The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.

New!!: K-independent hashing and Journal of the ACM · See more »

Lecture Notes in Computer Science

Springer Lecture Notes in Computer Science (LNCS) is a series of computer science books published by Springer Science+Business Media (formerly Springer-Verlag) since 1973.

New!!: K-independent hashing and Lecture Notes in Computer Science · See more »

Linear probing

Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key.

New!!: K-independent hashing and Linear probing · See more »

Polynomial

In mathematics, a polynomial is an expression consisting of variables (also called indeterminates) and coefficients, that involves only the operations of addition, subtraction, multiplication, and non-negative integer exponents of variables.

New!!: K-independent hashing and Polynomial · See more »

SIAM Journal on Computing

The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science.

New!!: K-independent hashing and SIAM Journal on Computing · See more »

Statistical distance

In statistics, probability theory, and information theory, a statistical distance quantifies the distance between two statistical objects, which can be two random variables, or two probability distributions or samples, or the distance can be between an individual sample point and a population or a wider sample of points.

New!!: K-independent hashing and Statistical distance · See more »

Symposium on Foundations of Computer Science

The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science.

New!!: K-independent hashing and Symposium on Foundations of Computer Science · See more »

Tabulation hashing

In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or operations.

New!!: K-independent hashing and Tabulation hashing · See more »

Universal hashing

In mathematics and computing universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below).

New!!: K-independent hashing and Universal hashing · See more »

Redirects here:

K-Independent Hashing, K-universal hashing.

References

[1] https://en.wikipedia.org/wiki/K-independent_hashing

OutgoingIncoming
Hey! We are on Facebook now! »