• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 424
  • 73
  • 18
  • 15
  • 15
  • 15
  • 15
  • 15
  • 15
  • 14
  • 7
  • 5
  • 5
  • 3
  • 3
  • Tagged with
  • 674
  • 674
  • 274
  • 219
  • 195
  • 153
  • 128
  • 123
  • 97
  • 83
  • 80
  • 67
  • 56
  • 54
  • 53
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
171

Resource-Aware Query Scheduling in Database Management Systems

Gruska, Natalie 09 June 2011 (has links)
Database Management Systems (DBMSs) are an integral part of many applications. Web-based applications, such as e-commerce sites, are faced with highly variable workloads. The number of customers browsing and purchasing items varies throughout the day and business managers can further complicate the workload by requesting complex reports on sales data. This means the load on a database system can fluctuate dramatically with a sudden influx of requests or a request involving a complex query. If there are too many requests operating in the DBMS concurrently, then resources are strained and performance drops. To keep the DBMS’s performance consistent across varying loads, a load control system can be used. This thesis investigates the concept of a load control system based on regulating individual resource usage in a predictive manner. For the purpose of this proof-of- concept study, we focus on a specific resource; namely, the sort heap. A method of estimating sort heap usage based on the query execution plan is presented and several scheduling methods based on these estimations are proposed. A prototype load control system is used to evaluate and compare the scheduling methods. Experiments show that it is possible to both estimate sort heap requirements and to control sort heap usage using our load control system. / Thesis (Master, Computing) -- Queen's University, 2011-06-09 11:02:31.595
172

Implementation of a domain algebra and a functional syntax for a relational database system

Van Rossum, Ted. January 1983 (has links)
No description available.
173

On-line tuning of data placement in parallel databases

Achyutuni, Kiran Jyotsna January 1996 (has links)
No description available.
174

Indexing in parallel database systems

Jeong, Byeong-Soo January 1995 (has links)
No description available.
175

System support for scalable services

Kordale, Rammohan January 1997 (has links)
No description available.
176

Approximate answering of aggregate queries in relational databases

Jermaine, Christopher 08 1900 (has links)
No description available.
177

An approximate load balancing parallel hash join algorithm to handle data skew in a parallel data base system

Geum, Seong 05 1900 (has links)
No description available.
178

Extensions to Aldat to support distributed database operations with no global scheme

Gaudon, Melanie E. January 1986 (has links)
No description available.
179

AUTONOMIC WORKLOAD MANAGEMENT FOR DATABASE MANAGEMENT SYSTEMS

Zhang, Mingyi 07 May 2014 (has links)
In today’s database server environments, multiple types of workloads, such as on-line transaction processing, business intelligence and administrative utilities, can be present in a system simultaneously. Workloads may have different levels of business importance and distinct performance objectives. When the workloads execute concurrently on a database server, interference may occur and result in the workloads failing to meet the performance objectives and the database server suffering severe performance degradation. To evaluate and classify the existing workload management systems and techniques, we develop a taxonomy of workload management techniques. The taxonomy categorizes workload management techniques into multiple classes and illustrates a workload management process. We propose a general framework for autonomic workload management for database management systems (DBMSs) to dynamically monitor and control the flow of the workloads and help DBMSs achieve the performance objectives without human intervention. Our framework consists of multiple workload management techniques and performance monitor functions, and implements the monitor–analyze–plan–execute loop suggested in autonomic computing principles. When a performance issue arises, our framework provides the ability to dynamically detect the issue and to initiate and coordinate the workload management techniques. To detect severe performance degradation in database systems, we propose the use of indicators. We demonstrate a learning-based approach to identify a set of internal DBMS monitor metrics that best indicate the problem. We illustrate and validate our framework and approaches using a prototype system implemented on top of IBM DB2 Workload Manager. Our prototype system leverages the existing workload management facilities and implements a set of corresponding controllers to adapt to dynamic and mixed workloads while protecting DBMSs against severe performance degradation. / Thesis (Ph.D, Computing) -- Queen's University, 2014-05-07 13:35:42.858
180

Multipaged implementation of MRDS on UNIX

Pal, Jatinder. January 1984 (has links)
No description available.

Page generated in 0.1857 seconds