Identifying New Directions in Database Performance Tuning

Database performance tuning is a complex and varied active research topic. With enterprise relational database management systems still reliant on the same set-based relational concepts that defined early data management products, the disparity between the object-oriented application development model and the object-relational database model, called the object-relational impedance mismatch problem, is addressed by techniques such as object-relational mapping (ORM). However, this has resulted in generally poor query performance for SQL developed by object applications and an irregular fit with cost-based optimisation algorithms, and leads to questions about the need for the relational model to better adapt to ORM-generated queries. This paper discusses database performance optimisation developments and seeks to demonstrate that current database performance tuning approaches need re-examination. Proposals for further work include exploring concepts such as dynamic schema redefinition; query analysis and optimisation modelling driven by machine learning; and augmentation or replacement of the cost-based optimiser model

Evaluation of Main Memory : Join Algorithms for Joins with Set Comparison Predicates

Current data models like the NF2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on the set equality and the subset predicates

Cooperative scans

Data mining, information retrieval and other application areas exhibit a query load with multiple concurrent queries touching a large fraction of a relation. This leads to individual query plans based on a table scan or large index scan. The implementation of this access path in most database systems is straightforward. The Scan operator issues next page requests to the buffer manager without concern for the system state. Conversely, the buffer manager is not aware of the work ahead and it focuses on keeping the most-recently-used pages in the buffer pool. This paper introduces cooperative scans -- a new algorithm, based on a better sharing of knowledge and responsibility between the Scan operator and the buffer manager, which significantly improves performance of concurrent scan queries. In this approach, queries share the buffer content, and progress of the scans is optimized by the buffer manager by minimizing the number of disk transfers in light of the total workload ahead. The experimental results are based on a simulation of the various disk-access scheduling policies, and implementation of the cooperative scans within PostgreSQL and MonetDB/X100. These real-life experiments show that with a little effort the performance of existing database systems on concurrent scan queries can be strongly improve

DATA CONSTRUCTORS: ON THE INTEGRATION OF RULES AND RELATIONS

Although the goals and means of rule-based and data-based systems are too different to be fully integrated at the present time, it seems appropriate to investigate a closer integration of language constructs and a better cooperation of execution models for both kinds of approaches. In this paper, we propose a new language construct called constructor that â when applied to a base relation â causes relation membership to become true for all tuples constructable through the predicates provided by the constructor definition. The approach is shown to provide expressive power at least equivalent to PROLOG's declarative semantics while blending well both with a strongly typed modular programming language and with a relational calculus query formalism. A three-step compilation, optimization, and evaluation methodology for expressions with constructed relations is described that integrates constructors with the surrounding database programming environment. In particular, many recursive queries can be evaluated more efficiently within the set-construction framework of database systems than with proof-oriented methods typical for a rule-based approach.Information Systems Working Papers Serie

Semantics-based locking:from isolation to cooperation

'Advanced database applications', such as CAD/CAM, CASE, large AI applications or imageand voice processing, place demands on transaction management which differ substantially from those of traditional database applications. In particular, there is a need to support 'enriched' data models (which include, for example, complex objects or version and configuration management), 'synergistic' cooperative work, and application- or user-supported consistency. This paper deals with a subset of these problems. It develops a methodology for implementing semantics-based concurrency control on the basis of ordinary locking. More specifically, it will be shown how conventional locking can step by step be improved and refined to finally reach our initial goal, namely a comprehensive support of synergistic cooperative work by the exploitation of application-specific semantics. In addition to the 'conventional' binding of locks to transactions we consider the binding of locks to objects (object related) and subjects (subject related locks). Object related locks can define persistent and adaptable access restrictions on objects. This permits, among others, the modeling of different types of version models (time versions, version graphs) as well as library (standard) objects. Subject related locks are bound to subjects (user, application, etc.) and can be used among others to supervise or direct the transfer of objects between transactions.<br/

ANALOGICAL AND DEPENDENCY DIRECTED REASONING STRATEGIES FOR LARGE SYSTEMS EVOLUTION

The maintenance of large information systems involves continuous design modifications to designs in response to evolving business conditions or changing user requirements. Because of the complexity barrier associated with engineering such systems, changes can be ad hoc and prone to errors. Based on our observations of such a process in the oil industry, we believe that the systems maintenance activity would benefit greatly if the process knowledge reflecting the teleology of a design could be captured and used in order to reason about changing requirements, and to design parts of systems that might be âsimilarâ to existing ones. In this paper, we describe a partially implemented formalism called REMAP (REpresentation and MAintenance of Process knowledge) that accumulates design process knowledge to manage systems evolution. To accomplish this, REMAP acquires and maintains dependencies among the design decisions made during a prototyping process as well as the general domain-specific design rules on which such dependencies are based. This knowledge can then be applied to prototype refinement, systems maintenance, and the re-use of existing designs to construct âsimilarâ design fragments.Information Systems Working Papers Serie

Identifying single influential publications in a research field: New analysis opportunities of the CRExplorer

Reference Publication Year Spectroscopy (RPYS) has been developed for identifying the cited references (CRs) with the greatest influence in a given paper set (mostly sets of papers on certain topics or fields). The program CRExplorer (see www.crexplorer.net) was specifically developed by Thor, Marx, Leydesdorff, and Bornmann (2016a, 2016b) for applying RPYS to publication sets downloaded from Scopus or Web of Science. In this study, we present some advanced methods which have been newly developed for CRExplorer. These methods are able to identify and characterize the CRs which have been influential across a longer period (many citing years). The new methods are demonstrated in this study using all the papers published in Scientometrics between 1978 and 2016. The indicators N_TOP50, N_TOP25, and N_TOP10 can be used to identify those CRs which belong to the 50%, 25%, or 10% most frequently cited publications (CRs) over many citing publication years. In the Scientometrics dataset, for example, Lotka's (1926) paper on the distribution of scientific productivity belongs to the top 10% publications (CRs) in 36 citing years. Furthermore, the new version of CRExplorer analyzes the impact sequence of CRs across citing years. CRs can have below average (-), average (0), or above average (+) impact in citing years (whereby average is meant in the sense of expected values). The sequence (e.g. 00++---0--00) is used by the program to identify papers with typical impact distributions. For example, CRs can have early, but not late impact ("hot papers", e.g. +++---) or vice versa ("sleeping beauties", e.g. ---0000---++)

Comparison of neuromuscular development in two dinophilid species (Annelida) suggests progenetic origin of <i>Dinophilus gyrociliatus</i>

BACKGROUND: Several independent meiofaunal lineages are suggested to have originated through progenesis, however, morphological support for this heterochronous process is still lacking. Progenesis is defined as an arrest of somatic development (synchronously in various organ systems) due to early maturation, resulting in adults resembling larvae or juveniles of the ancestors. Accordingly, we established a detailed neuromuscular developmental atlas of two closely related Dinophilidae using immunohistochemistry and CLSM. This allows us to test for progenesis, questioning whether i) the adult smaller, dimorphic Dinophilus gyrociliatus resembles a younger developmental stage of the larger, monomorphic D. taeniatus and whether ii) dwarf males of D. gyrociliatus resemble an early developmental stage of D. gyrociliatus females. RESULTS: Both species form longitudinal muscle bundles first, followed by circular muscles, creating a grid of body wall musculature, which is the densest in adult D. taeniatus, while the architecture in adult female D. gyrociliatus resembles that of prehatching D. taeniatus. Both species display a subepidermal ganglionated nervous system with an anterior dorsal brain and five longitudinal ventral nerve bundles with six sets of segmental commissures (associated with paired ganglia). Neural differentiation of D. taeniatus and female D. gyrociliatus commissures occurs before hatching: both species start out forming one transverse neurite bundle per segment, which are thereafter joined by additional thin bundles. Whereas D. gyrociliatus arrests its development at this stage, adult D. taeniatus condenses the thin commissures again into one thick commissural bundle per segment. Generally, D. taeniatus adults demonstrate a seemingly more organized (= segmental) pattern of serotonin-like and FMRFamide-like immunoreactive elements. The dwarf male of D. gyrociliatus displays a highly aberrant neuromuscular system, showing no close resemblance to any early developmental stage of female Dinophilus, although the onset of muscular development mirrors the early myogenesis in females. CONCLUSION: The apparent synchronous arrest of nervous and muscular development in adult female D. gyrociliatus, resembling the prehatching stage of D. taeniatus, suggests that D. gyrociliatus have originated through progenesis. The synchrony in arrest of three organ systems, which show opposing reduction and addition of elements, presents one of the morphologically best-argued cases of progenesis within Spiralia

A logic programming framework for modeling temporal objects

Published versio