Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben

2010 | Buch

Orthogonal Persistence Revisited Kapitel lesen Erstes Kapitel lesen

Object Databases

Second International Conference, ICOODB 2009, Zurich, Switzerland, July 1-3, 2009. Revised Papers

herausgegeben von: Moira C. Norrie, Michael Grossniklaus

Verlag: Springer Berlin Heidelberg

Buchreihe : Lecture Notes in Computer Science

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Inhaltsverzeichnis

Frontmatter

Session 1

Orthogonal Persistence Revisited
Abstract
The social and economic importance of large bodies of programs and data that are potentially long-lived has attracted much attention in the commercial and research communities. Here we concentrate on a set of methodologies and technologies called persistent programming. In particular we review programming language support for the concept of orthogonal persistence, a technique for the uniform treatment of objects irrespective of their types or longevity. While research in persistent programming has become unfashionable, we show how the concept is beginning to appear as a major component of modern systems. We relate these attempts to the original principles of orthogonal persistence and give a few hints about how the concept may be utilised in the future.
Alan Dearle, Graham N. C. Kirby, Ron Morrison
Verification Technology for Object-Oriented/XML Transactions
Abstract
Typically, object-oriented schemas are lacking declarative specification of the schema integrity constraints. Object-oriented transactions are also typically missing a fundamental ACID requirement: consistency. We present a developed technology based on object-oriented assertion languages that overcomes these limitations of persistent and database object systems. This technology allows specification of object-oriented integrity constraints, their static verification and dynamic enforcement. Proof strategies that are based on static and dynamic verification techniques as they apply to verification of object-oriented transactions are presented in the paper. Most of this work has been motivated by the problems of object-oriented interfaces to XML that have not been able to express typical XML Schema constraints, database constraints in particular. The components of this technology are an object-oriented constraint language, a verification system with advanced typing and logic capabilities, predefined libraries of object-oriented specification and verification theories, and an extended virtual platform for integrating constraints into the run-time type system and their management.
Suad Alagić, Mark Royer, David Briggs

Session 2

Compiler Plugins Can Handle Nested Languages: AST-Level Expansion of LINQ Queries for Java
Abstract
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages contribute to bridge this gap by letting software developers write declarative queries without imposing any specific execution strategy. Although some query optimizers support this paradigm, Java provides no means to embed queries in a seamless and typesafe manner. Interestingly, the benefits of such grammar extension (compile-time type inference and checking, user-friendly syntax) can alternatively be achieved with a compiler plugin as discussed in this paper for the LINQ query language and two Java compilers (from Sun and Eclipse). A prototype confirms the benefits of the approach by automating at compile-time (a) the parsing of LINQ queries nested in Java, (b) their analysis for well-formedness, and (c) their rewriting into statements to build Abstract Syntax Trees (ASTs). The technique is also applicable to other languages (JPQL, XQuery) which are handled nowadays by a Java compiler as uninterpreted strings, being thus prone to runtime exceptions due to breaches of static semantics.
Miguel Garcia
Active Components as a Method for Coupling Data and Services – A Database-Driven Application Development Process
Abstract
In the area of highly interactive systems, the use of object databases has significantly grown in the past few years due to the fact that one can, not only persistently store data in the form of objects, but also provide additional functionality in terms of methods defined on these objects. However, a limitation of such a tight coupling of objects and their methods is that parts of the application logic cannot be reused without also having instances of these objects in the new application database. Based on our experience of designing multiple interactive cross-media applications, we propose an approach where we distinguish between regular database objects containing the data and so-called active components storing metadata about specific services. Active components are first class objects which, at activation time, can perform some operations on the server as well as on the client side. Since active components are standalone lightweight components, they can be dynamically bound to single objects or semantically grouped sets of objects and be automatically invoked by different forms of database interactions. The database-driven development of arbitrary client and server-side application functionality not only simplifies the design of highly interactive systems, but also improves the reuse of existing components across different systems.
Beat Signer, Moira C. Norrie
Optimization of Object-Oriented Queries Involving Weakly Dependent Subqueries
Abstract
A new static optimization method in object query languages is presented. We introduce a special kind of subqueries of a query referred to as “weakly dependent subqueries”. A subquery is weakly dependent if it depends from an external query operator only on an expression returning the result of an enumerated type. If a query contains such subqueries then we rewrite it to an equivalent form which guarantees much better performance. Our method is based on the stack-based approach (SBA) and its query language SBQL (Stack-Based Query Language) implemented in the ODRA system. SBA is relevant for a general object model and for its specific variants. Clean formal semantics and abstract implementation of SBQL, integration with the constructs of programming languages and advanced data structures give the possibility to investigate different areas that are related to query optimization techniques. The paper presents examples how the optimization method works. General and detailed features of the implemented algorithm are also presented.
Michał Bleja, Tomasz Kowalski, Radosław Adamus, Kazimierz Subieta

Session 3

Metamodelling with Datalog and Classes: ConceptBase at the Age of 21
Abstract
ConceptBase is a deductive object-oriented database system intended for the management of metadata. A distinguishing feature of the Telos language underlying ConceptBase is the ability to manage rules and constraints across multiple levels of instantiation in so-called meta formulas, thus offering uniform consistency management across heterogeneous notations or ontologies. Originally developed in the context of model-driven database design in the late 1980’s, ConceptBase has been used in several thousand installations all over the world for numerous applications in areas such as requirements engineering, engineering information management, model management, eLearning, cultural information systems, and data warehousing. The internal representation is based on a quadruple object structure, combined with advanced Datalog engines, such that many optimization techniques in ConceptBase have pioneered ideas later pursued in the implementation of XML databases and ontology-based reasoning and data management engines.
Matthias Jarke, Manfred A. Jeusfeld, Hans W. Nissen, Christoph Quix, Martin Staudt
Unified Event Model for Object Databases
Abstract
Most object databases offer little or no support for event-based programming over and above what is provided in the programming language. Consequently, functionality offered by traditional database triggers and event-condition-action (ECA) rules has to be coded in each application. We believe that a notion of triggers should be offered by object databases to facilitate application development and a clear separation of concerns. We present a general and flexible event model that unifies concepts from programming languages and database triggers. We describe an implementation of the model and how it can support the requirements of a rich variety of applications.
Michael Grossniklaus, Stefania Leone, Alexandre de Spindler, Moira C. Norrie

Session 4

Multi-granular Spatio-temporal Object Models: Concepts and Research Directions
Abstract
The capability of representing spatio-temporal objects is fundamental when analysing and monitoring the changes in the spatial configuration of a geographical area over a period of time. An important requirement when managing spatio-temporal objects is the support for multiple granularities. In this paper we discuss how the modelling constructs of object data models can be extended for representing and querying multi-granular spatio-temporal objects. In particular, we describe object-oriented formalizations for granularities, granules, and multi-granular values, exploring the issues of value conversions. Furthermore, we formally define an object-oriented multi-granular query language, and discuss dynamic multi-granularity. Finally, we discuss open research issues.
Elisa Bertino, Elena Camossi, Michela Bertolotto
Mapping XSD to OO Schemas
Abstract
This paper presents algorithms that make it possible to process XML data that conforms to XML Schema (XSD) in a mainstream object-oriented programming language. These algorithms are based on our object-oriented view of the core of XSD. The novelty of this view is that it is intellectually manageable for object-oriented programmers while still capturing the complexity of the core structural properties of XSD. This paper develops two mappings based on this view. The first one is specified by a set of rules that map a source XSD schema into its object-oriented schema. The second one maps XML instances that conform to an XSD schema to their representation as objects. In addition to mapping elements and attributes, these mappings reflect correctly the particle structures including different types of groups, and type derivation by restriction and extension. The structural properties of identity constraints are also mapped correctly. Formally defined mappings or algorithms of this sort have not been available so far, and existing industrial tools typically do not handle the level of complexity of XSD that our mappings do.
Suad Alagić, Philip A. Bernstein
Backmatter
Metadaten
Titel
Object Databases
herausgegeben von
Moira C. Norrie
Michael Grossniklaus
Copyright-Jahr
2010
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-14681-7
Print ISBN
978-3-642-14680-0
DOI
https://doi.org/10.1007/978-3-642-14681-7

Premium Partner

    Bildnachweise