Construct · 1 fields · 1 citations

Fagin's threshold algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Database systems

an algorithm for top-k queries over several sorted lists that stops once k objects score at least a threshold computed from the last values seen, and is instance optimal.

In database systems, Fagin's threshold algorithm refers to an algorithm for top-k queries over several sorted lists that stops once k objects score at least a threshold computed from the last values seen, and is instance optimal. This meaning comes from Fagin (2003) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Fagin's threshold algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

instance optimality1 fields · 1 citationsanchor · a standalone construct score2 fields · 3 citationsjingle · one word, two constructs threshold5 fields · 6 citationsjingle · one word, five constructs

References

Fagin, R., Lotem, A., & Naor, M. (2003). Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 66(4), 614-656. https://doi.org/10.1016/s0022-0000(03)00026-6

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct