Database System

LOGRES is a new project for the development of extended database systems which is based on the integration of the object-oriented data modelling paradigm and of the rule-based approach for the specification of queries and updates. The data model supports generalization hierarchies and object sharing, the rule-based language extends Datalog to support generalized type constructors (sets, multisets, and sequences), rule-based integrity constraints are automatically produced by analyzing schema definitions. Modularization is a fundamental feature, as modules encapsulate queries and updates, when modules are applied to a LOGRES database, their side effects can be controlled. The LOGRES project is a follow-up of the ALGRES project, and takes advantage of the ALGRES programming environment for the development of a fast prototype.

Logres is a new-generation database system integrating features from deductive and object-oriented databases [1, 2, 3, 4, 5]. The data model of Logres supports structural and semantic complexity through a rich collection of concepts from object-oriented models. The rule language allows for the manipulation of complex objects, the generation of new objects, and the definition of passive and active constraints. The application of set of rules to database states is controlled by means of qualifiers, which dictate the side effects of rules; qualifiers are the unique procedural feature of Logres, otherwise a fully declarative language.

The International Rice Information System (IRIS, http://www.iris.irri.org) is the rice implementation of the International Crop Information System (ICIS, http://www.icis.cgiar.org), a database system for the management and integration of global information on genetic resources and germplasm improvement for any crop. Building upon the germplasm genealogy and field data components of ICIS, IRIS is being extended to handle diverse rice genomics data including: genetic mapping, genome annotation, genotype, mutant, transcripteome, proteome and metabolomic data. Users can access information in the database through stand-alone programs and WWW interfaces offering specialist views to researchers with different interests. Availability: http://bioinformatics.org/project/?group_id=141 Contact: r.bruskiewich@cgiar.org Keywords: database, crop, rice, germplasm, genotype, phenotype, genomics *To whom correspondence should be addressed.

Temporal knowledge representation and reasoning is a major research field in Artificial Intelligence, in Database Systems, and in Web and Semantic Web research. The ability to model and process time and calendar data is essential for many applications like appointment scheduling, planning, Web services, temporal and active database systems, adaptive Web applications, and mobile computing applications. This article aims at three complementary goals. First, to provide with a general background in temporal data modeling and reasoning approaches. Second, to serve as an orientation guide for further specific reading. Third, to point to new application fields and research perspectives on temporal knowledge representation and reasoning in the Web and Semantic Web.

PurposeA dynamic approach to making legacy databases, like CDS/ISIS, interoperable with OAI‐compliant digital libraries (DLs).Design/methodology/approachThere are many bibliographic databases that are being maintained using legacy database systems. CDS/ISIS is one such legacy database system. It was designed and developed specifically for handling textual data. Over the years, many databases have been developed using this package. There is, however, no mechanism supported by the package for seamless interoperability of databases. The open archives initiative (OAI) addresses the issue of interoperability by using a framework to facilitate the discovery of content stored in distributed archives or bibliographic databases through the use of the OAI Protocol for Metadata Harvesting (OAI‐PMH). The protocol is becoming a de facto standard for interoperability of DLs. Many of the legacy database systems that are in use today, to the best of our knowledge, for various reasons, are not OAI‐c...

Recent developments of middleware products enabling J2EE enterprise architectures include high availability features in, e.g., J2EE application servers and database systems. This is a step towards making the cornerstones of a J2EE enterprise infrastructure more autonomous, in the sense that their high availability becomes less dependent on dedicated system management software ensuring application and system availability. The article reports about a project exploring recent high-availability features of respective IBM products in an industry application context.

The Cloud technology is widely used now-a-days. Cloud technology is useful for storing huge amounts of data and also for performing computations. The join queries in cloud are computed by execution server using different storage servers. In the existing system when the client wants to execute a join query, the query is sent to the execution server which gets the data from different storage servers and performs the join operation. The execution server then returns the results to the client. The client must be able to verify the results received from execution server. Various techniques are described in this paper to verify that the results returned by the join query are proper i.e. the results are correct and complete. Also the results provided by the servers must be secure. Integrity indicates that all the valid tuples are included in the result and no valid tuple is missing. Integrity of result helps in further data processing.

To assure the consistency in a database, transactions have been used as a technique for a long time. Commonly transactions impart consistency at the overhead of appropriateness (abort or retry) and source (duplicate shared data and locking), Considerable attempts have been made to confine these two qualities of transactions while fulfilling application constraints. Consistency or operational trade-off develops severe concern for any retrieval of data over a network is not only costly, but comparatively slow when compared to co-located client/database systems, in situations where consumers are geologically far from a database. Additionally, improved transactions overhead may also boost power overhead for consumers hooked on battery power. Nevertheless, for all these shortcomings, transactions do provide the data consistency which is a basic requirement for many applications. In this paper we study the solution associated to prompt transactional systems for isolated clients and centra...

The present invention relates to a System and method for accessing non-relational data Stored in records on a host System by a relational access method. The implementation of a relational interface component allows data transforma tion and type conversion and gives a relational interface to non-relational data. An integrated mapping component is used to define the relational Structure of non-relational records or data. This relational Structure is used by the application program or database request. The mapping com ponent allows one to define columns with their characteristic (i.e. byte offset, data type, length). The definitions can be grouped in maps equivalent to a relational table and views representing a Subset of the columns defined in a map. Multiple different maps and views can be defined for one record. The information of the maps, columns and views are Stored in a repository. The inventive interface component uses the definitions Stored in the repository to access the non-...

Active database systems support mechanisms that enable them to respond automatically to events that are taking place either inside or outside the database system itself. Considerable effort has been directed towards improving understanding of such systems in recent years, and many different proposals have been made and applications suggested. This high level of activity has not yielded a single agreed-upon standard approach to the integration of active functionality with conventional database systems, but has led to improved understanding of active behavior description languages, execution models, and architectures. This survey presents the fundamental characteristics of active database systems, describes a collection of representative systems within a common framework, considers the consequences for implementations of certain design decisions, and discusses tools for developing active applications.

There has been a growing interest in improving the publication processes for database research papers. This panel reports on recent changes in those processes and presents an initial cut at historical data for the VLDB Journal and ACM Transactions on Database Systems.

We compiled S-P times and first-motion polarities for earthquakes in Kanto region, central Japan on the basis of seismic phase data from 1923 to 2011 provided by the Japan Meteorological Agency (JMA), and that for 3,086 earthquakes which occurred from April 1st, 2008 to June 5th, 2012, from the Metropolitan Seismic Observation Network (MeSO-net). The number of target stations, where these data can be comparable with 26 stations which had operated in early stage of instrumental observations is 69 by JMA, and 19 by MeSO-net and other networks. These data would be helpful for determining hypocenters and focal mechanism solutions of old earthquakes with limited instrumental data by comparing with S-P times and first-motion polarities for old earthquakes. As an example of application, we then compiled the characteristics of S-P times and first-motion polarities in southwestern Ibaraki and northwestern Chiba regions where the inter-mediate depth earthquakes frequently occur, and inferred ...

We have implemented a dense seismic network, MeSO-net (Metropolitan Seismic Observation network), since 2007 in the greater Tokyo urban region under the Special Project for Earthquake Disaster Mitigation in Tokyo Metropolitan Area (FY2007-FY2011) and Special Project for Reducing Vulnerability for Urban Mega Earthquake Disasters (FY2012-FY2016; Hirata et al., 2009). So far we have acquired more than 150TB continuous seismic data form MeSO-net, which consists of about 300 seismic stations. Using the MeSO-net data, we obtained clear Pand Swave velocity tomograms (Nakagawa et al., 2010) and Qp, Qs tomograms (Panayotopoulos et al., 2014), which show a clear image of the Philippine Sea Plate (PSP) and the Pacific Plate (PAP). Our results showed that the depth to the top of PSP beneath the northern part of Tokyo bay is roughly 20 to 30 km, which is approximately 10 km shallower than previous estimates based on distribution of seismicity (Ishida, 1992). We are developing a method to estimat...

Concurrency in computing systems brings numerous benefits, but it also introduces challenges, including the potential occurrence of deadlocks. Deadlocks arise when multiple processes are unable to proceed due to each waiting for a resource held by another process, halting system progress and leading to resource wastage. The knowledge gap in deadlock detection in concurrent programming involves understanding various techniques and algorithms to identify and prevent deadlocks. Also, distinguish the difference between deadlock detection algorithms. In this work, the deadlock detection process and various deadlock detection algorithms used in concurrent programming were explored. Additionally, a variety of these algorithms were discussed in depth, including the banker's algorithm, the wait-for graph algorithm, and the resource allocation graph algorithm. It was also provided with a comprehensive explanation to help understand how it works. Moreover, an analysis was conducted on the strengths, weaknesses, and performance characteristics of different deadlock detection techniques.

Abstract. Mapping XML documents into relational database is a promising solution because relational databases are mature and scale very well and they have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort. In this paper, we propose two algorithms (XRD, XRS) that maps XML documents into relational database. The algorithm steps are given in details to describe how to map the XML documents into relational ...

This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experimental results obtained by implementing this solution over a PC cluster with Oracle9i DBMS. The goal of those experimentations is to measure the time spent to check global constraints in a distributed systems. The results show that the overhead induced by our distributed constraint checking is reduced by 50% compared to a centralized checking of constraints.

Given a Boolean function $f$ provided as a black-box with $n$ variables, this paper will propose a quantum algorithm for testing if a certain variable is junta or $\epsilon$-far from being junta. The proposed algorithm constructs another black-box using two copies of the provided black-box. The constructed black-box is used with the partial diffusion operator in an amplitude amplification technique to test whether the variable being tested is junta or not, using $\mathcal{O}(\sqrt{2^n})$ queries to the constructed black-box. The proposed algorithm considers a Boolean function of general form, contrary to relevant algorithms proposed by others.

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

Malware analysis is a process of determining the intent and modus operandi of a given malware sample. It is the first step in process of developing any preventive or defensive measure against a malware attack. The work presented in this paper is focused ...

This paper describes state of the art in reason maintenance with a focus on its future usage in the KiWi project. To give a bigger picture of the field, it also mentions closely related issues such as non-monotonic logic and paraconsistency. The paper is organized as follows: first, two motivating scenarios referring to semantic wikis are presented which are then used to introduce the different reason maintenance techniques. Keyword List reason maintenance, belief revision, reasoning, paraconsistency, explanation, rules Project funded by the European Commission within the Seventh Framework Programme. © KIWI 2008