Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,052,748 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.
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
2014
2014
Optimizing Pipelined Execution for Distributed In-Memory OLAP System
Li Wang
,
Lei Zhang
,
Chengcheng Yu
,
Aoying Zhou
DASFAA Workshops
2014
Corpus ID: 5242137
In the coming big data era, the demand for data analysis capability in real applications is growing at amazing pace. The memory’s…
Expand
2014
2014
Improving opinionated blog retrieval effectiveness with quality measures and temporal features
Leonidas Akritidis
,
Panayiotis Bozanis
World wide web (Bussum)
2014
Corpus ID: 15481166
The massive acceptance and usage of the blog communities by a significant portion of the Web users has rendered knowledge…
Expand
2010
2010
Capacity Planning for Vertical Search Engines
C. Badue
,
J. Almeida
,
+4 authors
N. Ziviani
arXiv.org
2010
Corpus ID: 15897484
Vertical search engines focus on specific slices of content, such as the Web of a single country or the document collection of a…
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
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
2009
2009
Exploiting Stream Request Locality to Improve Query Throughput of a Data Integration System
Rubao Lee
,
Zhiwei Xu
IEEE transactions on computers
2009
Corpus ID: 13522496
This paper focuses on the problem of improving throughput of distributed query processing in an RDBMS-based data integration…
Expand
2008
2008
Dwarfs in the rearview mirror: how big are they really?
J. Dittrich
,
Lukas Blunschi
,
M. V. Salles
Proceedings of the VLDB Endowment
2008
Corpus ID: 6990500
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved…
Expand
2006
2006
Virtual Fingerprinting as a Foundation for Reputation in Open Systems
Adam J. Lee
,
M. Winslett
Trust Management
2006
Corpus ID: 16958037
The lack of available identity information in attribute-based trust management systems complicates the design of the audit and…
Expand
2005
2005
Algorithms for selecting materialized views in a data warehouse
N. A. Yousri
,
K. M. Ahmed
,
Nagwa M. El-Makky
The 3rd ACS/IEEE International Conference…
2005
Corpus ID: 29706660
Summary form only given. A data warehouse stores materialized views of data from one or more sources, for the purpose of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE