Concepts inEfficient top-k count queries over imprecise duplicates

Record linkage

Record linkage (RL) refers to the task of finding records in a data set that refer to the same entity across different data sources (e.g. , data files, books, websites, databases). Record linkage is necessary when joining data sets based on entities that may or may not share a common identifier, as may be the case due to differences in record shape, storage location, and/or curator style or preference.
more from Wikipedia

Data deduplication

In computing, data deduplication is a specialized data compression technique for eliminating coarse-grained redundant data. The technique is used to improve storage utilization and can also be applied to network data transfers to reduce the number of bytes that must be sent across a link. In the deduplication process, unique chunks of data, or byte patterns, are identified and stored during a process of analysis.
more from Wikipedia

NP-hard

NP-hard, in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP". A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H (i.e. , L¿¿¿TH). In other words, L can be solved in polynomial time by an oracle machine with an oracle for H.
more from Wikipedia

Tuple

In mathematics and computer science, a tuple is an ordered list of elements. In set theory, an (ordered) -tuple is a sequence (or ordered list) of elements, where is a positive integer. There is also one 0-tuple, an empty sequence. An -tuple is defined inductively using the construction of an ordered pair. Tuples are usually written by listing the elements within parentheses "" and separated by commas; for example, denotes a 5-tuple.
more from Wikipedia

Time complexity

In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
more from Wikipedia

R (programming language)

R is an open source programming language and software environment for statistical computing and graphics. The R language is widely used among statisticians for developing statistical software and data analysis. R is an implementation of the S programming language combined with lexical scoping semantics inspired by Scheme. S was created by John Chambers while at Bell Labs.
more from Wikipedia

Cluster analysis

Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more similar (in some sense or another) to each other than to those in other clusters. Clustering is a main task of explorative data mining, and a common technique for statistical data analysis used in many fields, including machine learning, pattern recognition, image analysis, information retrieval, and bioinformatics.
more from Wikipedia

Filter (higher-order function)

In functional programming, filter is a higher-order function that processes a data structure in some order to produce a new data structure containing exactly those elements of the original data structure for which a given predicate returns the boolean value true.
more from Wikipedia