Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,000,833 papers from all fields of science
Search
Sign In
Create Free Account
Query throughput
Known as:
QphD
, QthD
, Query per Hour
In computer science, Query Throughput (QthD) is a measurement used to determine the performance of a database system. The throughput metric is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (1)
Computer performance
Computer science
Query language
Transactions per second
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Key-Value Store Based Data Center Resource Scheduling System
Qiao Sun
,
Chun Zhang
,
+6 authors
Wan-tao Liu
DEStech Transactions on Computer Science and…
2018
Corpus ID: 65732039
Efficiently scheduling resources in large scale data center is a key problem that distributed resource management systems face…
Expand
2018
2018
SaGe: Preemptive Query Execution for High Data Availability on the Web
Thomas Minier
,
Hala Skaf-Molli
,
P. Molli
arXiv.org
2018
Corpus ID: 44089030
Semantic Web applications require querying available RDF Data with high performance and reliability. However, ensuring both data…
Expand
2016
2016
Using Object-Oriented Big Data Analytics to Reveal Server Performance Dead Zone
Huihong He
,
Haibin Zhai
,
Li-Yu Daisy Liu
,
Yong Wang
Annual International Computer Software and…
2016
Corpus ID: 16771194
So far, big data analytics have proved worth by reaping fruitful achievements in business intelligence, health care and so on…
Expand
2015
2015
Extended Best Peer: A Peer-to-Peer Based System by Corporate Network for Data Sharing
Bhavsar Harshada
2015
Corpus ID: 35622144
: The corporate network is always used for sharing information where share common among the contribute company and make easy…
Expand
2015
2015
Sharing of Probabilistically Large-Scale Data Processing Platform in Peer-to-Peer Network
T. Virajitha
2015
Corpus ID: 27669112
Business organizations of same industry sector generally communicate with each other for selective data sharingg purposes and to…
Expand
2012
2012
Ranked Spatial-keyword Search over Web-accessible Geotagged Data: State of the Art
A. Vlachou
2012
Corpus ID: 54554771
Submitted by Sarafidou Maria (msaraf@ekt.gr) on 2016-05-18T11:27:58Z No. of bitstreams: 1 D1-stateOftheArt.pdf: 592093 bytes…
Expand
2010
2010
Admission polices for outperforming the efficiency of search engines
Hui Li
,
Cunhua Li
,
Yun Hu
,
Shu Zhang
,
Xia Wang
IEEE International Conference on Intelligent…
2010
Corpus ID: 17049953
We study the caching of query result pages in Web search engines. Popular search engines receive millions of queries per day, and…
Expand
2010
2010
Improving Load Balance and Query Throughput of Distributed IR Systems
A. Abusukhon
2010
Corpus ID: 18755408
As the number of queries grows over time it becomes necessary that Information Retrieval (IR) system provides high query…
Expand
2009
2009
Optimizing distributed XML queries through localization and pruning
D. Cheriton
2009
Corpus ID: 17869058
Distributing data collections by fragmenting them is an effective way of improving the scalability of relational database systems…
Expand
2004
2004
Fraîcheur et validité de données répliquées dans des environnements transactionnels
Cécile Le Pape
,
S. Gançarski
Ingénierie des Systèmes d Inf.
2004
Corpus ID: 34950542
Nous proposons un canevas permettant de gerer la qualite des donnees d'un cluster de bases de donnees repliquees de facon…
Expand