Query throughput - Wikipedia

This article may have been previously nominated for deletion: Wikipedia:Articles for deletion/Query throughput exists.
It is proposed that this article be deleted because of the following concern:

Does not meet WP:GNG (proposed by Tooncool64)

If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it.

This message has remained in place for seven days, so the article may be deleted without further notice.

If you created the article, please don't be offended. Instead, consider improving the article so that it is acceptable according to the deletion policy.
Find sources: "Query throughput" – news · newspapers · books · scholar · JSTOR

Timestamp: 20240121020541 02:05, 21 January 2024 (UTC)
Administrators: delete

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Query throughput" – news · newspapers · books · scholar · JSTOR (December 2007) (Learn how and when to remove this message)

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Query throughput" – news · newspapers · books · scholar · JSTOR (January 2024) (Learn how and when to remove this message)

(Learn how and when to remove this message)

In computer science, query throughput (QthD) is a measurement used to determine the performance of a database system. The throughput metric is a classical throughput measure characterizing the ability of the system to support a multi-user workload in a balanced way.

Background

In the background there is an update stream that runs a series of insert/delete operations (one pair for each query user). The choice of the number of users is at the discretion of the test sponsor.

The throughput metric is computed as the total amount of work (S×17), converted to hours from seconds (3600 seconds per hour), scaled by the database volume (SF) and divided by the total elapsed time (T_s) required between the first query starting and the last query or update function completing.

Therefore, the complete formulation is:

{\mathit {QthD}}={\frac {S\times 17\times 3600}{T_{s}}}\times {\mathit {SF}}

References

This database-related article is a stub. You can help Wikipedia by expanding it.