Database System

Distinct software metrics have been proposed for programs. By contrast, metrics for databases have been neglected on the grounds that databases were mere plain files that do not affect considerably information systems maintainability. However, later enhancements on database systems ...

Abstract With the increasing popularity of object-relational technology, it is becoming important to have a methodology which allows designers to exploit the great modelling power of object-oriented conceptual models (OOCMs) and yet which still facilitates ...

Watermarks are the most important tool for dating old, not explicitly dated paper documents. Hence, catalogues and databases of watermarks play an eminent role for the work of medievalist and paper historians. This article presents an integrated software system developed for storage, retrieval, manipulation, digital processing, and identification of watermarks in old manuscripts. The whole processing pipeline beginning with the scanning of watermarks up to their identification is described. Most of these watermarks were captured from manuscripts kept in the Klosterneuburg monastery (Austria).

The use of software agents as Database Management System components lead to database systems that may be conflgured and extended to support new requirements. We focus here with the self-tuning feature, which demands a somewhat intelligent behavior that agents could add to traditional DBMS modules. We propose in this paper an agent-based database architecture to deal with automatic index creation.

The nested transaction model was introduced to satisfy the requirements of advanced database applications. Moreover, it is currently the basic transaction model for new databases like workflow systems, mobile databases, and objectrelational databases. Though there are several performance evaluation studies of different concurrency control mechanisms in nested transactions, effects of transaction parameters on the overall system performance have not received any attention. In this paper, we study the effects of transactions characteristics on system performance. We developed a detailed simulation model and conducted several experiments to measure the impact of transactions characteristics on the performance. First, the effect of the number of leaves on the performance of nested transactions is investigated under different shaping parameters. Also, effects of the depth of the transaction tree on the system performance are investigated.

TESTING RELATIONAL DATABASE USING SQLLint Hassan Reza and Kris Zarns University of North Dakota School of Aerospace Sciences Grand Forks, ND 58202, USA reza@aero.und. edu Abstract – Database systems are an important element of any web based systems. ...

Abstract: Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little built-in query language support for temporal data management. The model itself ...

Manipulating a database system on a quantum computer is an essential aim to benefit from the promising speed-up of quantum computers over classical computers in areas that take a vast amount of storage and processing time such as in databases. In this paper, the ...

In this paper, evolutionary algorithms are explored with the objective of demonstrating that they offer the most efficient and adequate solution to the Index Selection Problem (ISP). The final target is to develop a self-tuning database system requiring little (or no) intervention from experts in physical design. Following the evaluation of the proposal and the discussion of experimental results, conclusions are made regarding the possibilities presented by evolutionary algorithms for future projects.

Benchmarking graph-oriented database workloads and graph-oriented database systems are increasingly becoming relevant in analytical Big Data tasks, such as social network analysis. In graph data, structure is not mainly found inside the nodes, but especially in the way nodes happen to be connected, i.e. structural correlations. Because such structural correlations determine join fan-outs experienced by graph analysis algorithms and graph

Security facilities of information systems with high security requirements should be consistently and continuously developed, used, and maintained based on some common standards of information security. However, there is no engineering environment that can support all tasks in security engineering consistently and continuously. To construct a security engineering environment, a database that can manage all data concerning all tasks in

Stockholm Syndrome is a paradoxical psychological experience which both intrigues and often frustrates law enforcement and mental health professionals alike. Much attention has been directed toward understanding and defining the contextual variables associated with the development of Stockholm Syndrome. Since it appears that the formation of Stockholm Syndrome may increase the likelihood of hostage survival, discerning the factors that may encourage its occurrence is a priority for crisis negotiators. The purpose of this paper is to (1) analyze crisis situations using actual case examples in which evidence of Stockholm Syndrome has been reported and (2) examine the variables associated with the development of this phenomenon. Case information was obtained from the Hostage Barricade Database System (HOBAS) of the FBI’s Crisis Negotiation Unit. Results of this analysis conclude that some, but not all, factors previously hypothesized as requisite to the development of Stockholm Syndrome find additional support from this case analysis.

Web applications built using Java technologies usually access relational databases via JDBC API. This requires a database system specific JDBC driver to be installed on the application side. On the other hand, a paradigm shift is taking place in web application architectures. Future web applications will be built around Service-Oriented Architectures (SOA) where applications will be assembled using remote "web

Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been proposed: logic-based and ...

The most important feature of a multidatabase system (MDBS) is to provide the global schema with integrating various models of local database systems (LDBS). However, it is difficult to integrate local schemas into the global schema due to the difference of the syntactical and semantic expressions of LDBSs. In this paper, we propose the standard SQL extension for MDBS called by Multidatabase Query Language (MQL). In addition, we analyze semantic conflicts using case studies and provide solutions to the semantic conflicts using MQL.

We describe a new database management system architecture designed for long term evolutionary growth of modular DBMSs. This architecture includes the development of Ada package speci cations for the individual modules. Alternative code bodies can be written corresponding to these package speci cations for variations in desired functionality. These alternative code bodies can also exist side by side, such as a hash structure package along with a B-tree package, or a relational storage module along with an object storage module. Functional speci cations are written in Anna, a formal annotation language for Ada. This e ort does not represent a new data model but rather a new approach to database implementation. This approach can be used to build database systems of any model, including a hybrid relational and object store approach suitable for applications such as Computer Aided Software Engineering (CASE). Our architecture speci cally takes into consideration multi-level security, dis...

Today’s real-time systems (RTS) are characterized by managing large volumes of dispersed data making real-time distributed data processing a reality. Large business houses need to do distributed processing for many reasons, and they often must do it in order to stay competitive. So, efficient database management algorithms and protocols for accessing and manipulating data are required to satisfy timing constraints of supported applications. Therefore, new research in distributed real-time database systems (DRTDBS) is needed to investigate possible ways of applying database systems technology to real-time systems. This paper first discusses the performance issues that are important to DRTDBS, and then surveys the research that has been done so far on the issues like priority assignment policy, commit protocols and optimizing the use of memory in non-replicated/replicated environment pertaining to distributed real time transaction processing. In fact, this study provides a foundation for addressing performance issues important for the management of very large real time data and pointer to other publications in journals and conference proceedings for further investigation of unanswered research questions.