Sciweavers

782 search results - page 5 / 157
» Query interactions in database workloads
Sort
View
SIGMOD
2002
ACM
172views Database» more  SIGMOD 2002»
14 years 8 months ago
Automating physical database design in a parallel database
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman

Publication
197views
15 years 8 months ago
SCRAP: A Statistical Approach for Creating Compact Representational Query Workload based on Performance Bottlenecks
James A. Skarie, Biplob K. Debnath, David J. Lilja, and Mohamed F. Mokbel. "SCRAP: A Statistical Approach for Creating Compact Representational Query Workload based on Perform...
James A. Skarie, Biplob K. Debnath, David J. Lilja...
ICDE
2011
IEEE
273views Database» more  ICDE 2011»
13 years 4 days ago
Shortcut selection in RDF databases
—An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational dat...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
VLDB
1993
ACM
134views Database» more  VLDB 1993»
14 years 15 days ago
Dynamic Memory Allocation for Multiple-Query Workloads
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling...
Manish Mehta 0002, David J. DeWitt
EDBT
2009
ACM
104views Database» more  EDBT 2009»
13 years 6 months ago
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
A typical online Business Intelligence (BI) workload consists of a combination of short, less intensive queries, along with long, resource intensive queries. As such, the longest ...
Chetan Gupta, Abhay Mehta, Song Wang, Umeshwar Day...