• 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.
261

A data dictionary for the INGRES data base management system

Wilson, Loren. January 1986 (has links)
Call number: LD2668 .T4 1986 W546 / Master of Science / Computing and Information Sciences
262

Fuzzy logic, estimated null values and their application in relational databases

Powell, Susan E. January 1986 (has links)
Call number: LD2668 .T4 1986 P68 / Master of Science / Computing and Information Sciences
263

A model for the evaluation of risks and control features in ORACLE 7

08 September 2015 (has links)
M.Com. / The proliferation of computers and the advances in technology introduced a number of new and additional management and control considerations. The inherent complexity of these environments has also increased the need to evaluate the adequacy of controls from an audit perspective. Due to the increasing use of database management systems as the backbone of information processing applications and the inherent complexities and diversity of these environments, the auditor is faced with the challenge of whether and to what extent reliance may be placed on the data contained in these databases...
264

Agilní správa databáze / Agile database management

Kotyza, David January 2009 (has links)
This diploma thesis is focused on agile management of relational databases. The gole is to provide detail analysis of changes which are performed on daily bases by DBA or software developers and describe how these changes can hugely affect performance of database system and its data. The principles of best known development methodics are described in part one (chapter 2 and 3). Following second part (chapter 4) contains descriptions of basics steps of agile strategies which have been often used in application solutions. Finally the third part (chapter 5 and following) contains detail information about usual performed database tasks.
265

A Systems Approach to Rule-Based Data Cleaning

Amr H Ebaid (6274220) 10 May 2019 (has links)
<div>High quality data is a vital asset for several businesses and applications. With flawed data costing billions of dollars every year, the need for data cleaning is unprecedented. Many data-cleaning approaches have been proposed in both academia and industry. However, there are no end-to-end frameworks for detecting and repairing errors with respect to a set of <i>heterogeneous</i> data-quality rules.</div><div><br></div><div>Several important challenges exist when envisioning an end-to-end data-cleaning system: (1) It should deal with heterogeneous types of data-quality rules and interleave their corresponding repairs. (2) It can be extended by various data-repair algorithms to meet users' needs for effectiveness and efficiency. (3) It must support continuous data cleaning and adapt to inevitable data changes. (4) It has to provide user-friendly interpretable explanations for the detected errors and the chosen repairs.</div><div><br></div><div>This dissertation presents a systems approach to rule-based data cleaning that is <b>generalized</b>, <b>extensible</b>, <b>continuous </b>and <b>explaining</b>. This proposed system distinguishes between a <i>programming interface</i> and a <i>core </i>to address the above challenges. The programming interface allows the user to specify various types of data-quality rules that uniformly define and explain what is wrong with the data, and how to fix it. Handling all the rules as black-boxes, the core encapsulates various algorithms to holistically and continuously detect errors and repair data. The proposed system offers a simple interface to define data-quality rules, summarizes the data, highlights violations and fixes, and provides relevant auditing information to explain the errors and the repairs.</div>
266

Physical Plan Instrumentation in Databases: Mechanisms and Applications

Psallidas, Fotis January 2019 (has links)
Database management systems (DBMSs) are designed with the goal set to compile SQL queries to physical plans that, when executed, provide results to the SQL queries. Building on this functionality, an ever-increasing number of application domains (e.g., provenance management, online query optimization, physical database design, interactive data profiling, monitoring, and interactive data visualization) seek to operate on how queries are executed by the DBMS for a wide variety of purposes ranging from debugging and data explanation to optimization and monitoring. Unfortunately, DBMSs provide little, if any, support to facilitate the development of this class of important application domains. The effect is such that database application developers and database system architects either rewrite the database internals in ad-hoc ways; work around the SQL interface, if possible, with inevitable performance penalties; or even build new databases from scratch only to express and optimize their domain-specific application logic over how queries are executed. To address this problem in a principled manner in this dissertation, we introduce a prototype DBMS, namely, Smoke, that exposes instrumentation mechanisms in the form of a framework to allow external applications to manipulate physical plans. Intuitively, a physical plan is the underlying representation that DBMSs use to encode how a SQL query will be executed, and providing instrumentation mechanisms at this representation level allows applications to express and optimize their logic on how queries are executed. Having such an instrumentation-enabled DBMS in-place, we then consider how to express and optimize applications that rely their logic on how queries are executed. To best demonstrate the expressive and optimization power of instrumentation-enabled DBMSs, we express and optimize applications across several important domains including provenance management, interactive data visualization, interactive data profiling, physical database design, online query optimization, and query discovery. Expressivity-wise, we show that Smoke can express known techniques, introduce novel semantics on known techniques, and introduce new techniques across domains. Performance-wise, we show case-by-case that Smoke is on par with or up-to several orders of magnitudes faster than state-of-the-art imperative and declarative implementations of important applications across domains. As such, we believe our contributions provide evidence and form the basis towards a class of instrumentation-enabled DBMSs with the goal set to express and optimize applications across important domains with core logic over how queries are executed by DBMSs.
267

A simulation study of alternatives to upgrading large computer systems

Kreimer, Daniel E January 2010 (has links)
Typescript, etc. / Digitized by Kansas Correctional Industries
268

A user-transparent distributed data base management system

Housh, Richard Dale January 2010 (has links)
Typescript, etc. / Digitized by Kansas Correctional Industries
269

A simulation study comparing five consistency algorithms for a multicomputer-redundant data base environment

Buzzell, Calvin A January 2010 (has links)
Photocopy of typescript. / Digitized by Kansas Correctional Industries
270

Concurrent programming of the user envelope in a distributed data base management system

Farrell, Michael Wayne January 2010 (has links)
Photocopy of typescript. / Digitized by Kansas Correctional Industries

Page generated in 0.1161 seconds