5,477 research outputs found

    Temporal Support in Relational Databases

    Get PDF
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. © 2012 Higher Education AcademyThis paper examines the current state of temporal support in relational databases and the type of situations where we need that support. There has been much research in this area and there were attempts in the American National Standards Institute (ANSI) and the International Organisation for Standardisation (ISO) standards committees in the late 1990s to add an extension called TSQL2 to the existing SQL standard. However no agreement could be reached as it was felt that some of the suggested extensions did not fit well with the relational model, as well as being difficult to implement. TSQL2 was abandoned and since then vendors have added their own data types, and if we are lucky, operators too in an attempt to provide support. However, to novice students and database designers it is often not apparent why some temporal concepts are difficult to deal with in a relational database. In teaching these concepts to students we use a Case Study (based on a real example) which illustrates the problems of providing temporal support by using examples of the data types which could be useful to solve temporal problems and the operators which are necessary to provide this

    Object-oriented querying of existing relational databases

    Get PDF
    In this paper, we present algorithms which allow an object-oriented querying of existing relational databases. Our goal is to provide an improved query interface for relational systems with better query facilities than SQL. This seems to be very important since, in real world applications, relational systems are most commonly used and their dominance will remain in the near future. To overcome the drawbacks of relational systems, especially the poor query facilities of SQL, we propose a schema transformation and a query translation algorithm. The schema transformation algorithm uses additional semantic information to enhance the relational schema and transform it into a corresponding object-oriented schema. If the additional semantic information can be deducted from an underlying entity-relationship design schema, the schema transformation may be done fully automatically. To query the created object-oriented schema, we use the Structured Object Query Language (SOQL) which provides declarative query facilities on objects. SOQL queries using the created object-oriented schema are much shorter, easier to write and understand and more intuitive than corresponding S Q L queries leading to an enhanced usability and an improved querying of the database. The query translation algorithm automatically translates SOQL queries into equivalent SQL queries for the original relational schema

    Operations on (ordered) interval sets

    Get PDF
    Intervals play an important role in various kinds of database-applications in practice, for example in historical, spatial, and temporal databases. As a consequence, there is a practical need for a clear and proper treatment of various useful operations on intervals and interval sets in a database context. However, the semantics of some important operations on interval sets are not always treated or not treated very clearly in the literature; e.g., often they are defined in an algorithmic rather than a declarative manner. Moreover, implementation proposals are often not as straightforward as they could be. This paper presents a declarative treatment of various operations on interval sets, also introducing some new notions (such as ordered interval sets, their visible points, and their surface). Then the paper formally ?links? such (mathematical) intervals to their database representations. Finally the paper provides straightforward translations from these formal database representations to standard SQL, without the need for SQL extensions.

    Snapshot Semantics for Temporal Multiset Relations (Extended Version)

    Full text link
    Snapshot semantics is widely used for evaluating queries over temporal data: temporal relations are seen as sequences of snapshot relations, and queries are evaluated at each snapshot. In this work, we demonstrate that current approaches for snapshot semantics over interval-timestamped multiset relations are subject to two bugs regarding snapshot aggregation and bag difference. We introduce a novel temporal data model based on K-relations that overcomes these bugs and prove it to correctly encode snapshot semantics. Furthermore, we present an efficient implementation of our model as a database middleware and demonstrate experimentally that our approach is competitive with native implementations and significantly outperforms such implementations on queries that involve aggregation.Comment: extended version of PVLDB pape

    Model-driven performance evaluation for service engineering

    Get PDF
    Service engineering and service-oriented architecture as an integration and platform technology is a recent approach to software systems integration. Software quality aspects such as performance are of central importance for the integration of heterogeneous, distributed service-based systems. Empirical performance evaluation is a process of measuring and calculating performance metrics of the implemented software. We present an approach for the empirical, model-based performance evaluation of services and service compositions in the context of model-driven service engineering. Temporal databases theory is utilised for the empirical performance evaluation of model-driven developed service systems
    corecore