Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Generierte DB-Aufrufschnittstellen – Anwendungsspezifische Zugriffsoptimierung durch Bindungsflexibilität (2000)
    Springer
    Informatik, Forschung und Entwicklung 15 (2000), S. 67-82 
    Details
    ISSN: 0949-2925
    Keywords: Schlüsselwörter:Datenbanksysteme, Objektorientierung, Bindungszeitpunkte, Anwendungsprogrammierschnittstelle, Generische Methoden ; Key words: Database systems, Object orientation, Binding time, Application programming interface, Generative methods ; CR Subject Classification: D.1.5, D.3.4, H.2.3, H.2.4
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract. Application programming interfaces (API) for database systems should preserve both the strengths of the database management system and of the programming languages. In addition to this general objective, innovative concepts of both domains as well as requirements of advanced application areas like CAD and software development must be observed. Our approach of generated call-level-interfaces is supposed to contribute to bringing closer together the type systems of object-relational database systems and object-oriented programming languages. Besides generating interfaces it supports application-specific configuration for optimization purposes. In this article, we describe generation/configuration of (generated) call-level-interfaces as well as their exploitation. Furthermore, we give some empirical results, showing possible performance gains. The latter can be achieved by application-specific use of early bindings (of data manipulation operations) as well as of pointer swizzling and prefetching mechanisms.
    Notes: Zusammenfassung. Jede Datenbankprogrammierschnittstelle muß sich daran messen lassen, inwieweit sie die Vorteile der durch sie integrierten Sprachen (Datenbank- und Programmiersprache) erhält. Neben dieser allgemeinen Zielsetzung müssen heutzutage neuere Konzepte in den Bereichen Programmiersprachen und Datenbanksysteme sowie die Anforderungen komplexer Anwendungsbereiche (z. B. CAD oder Software-Entwicklung) beachtet werden. Unser Ansatz der generierten Aufrufschnittstellen soll dazu beitragen, Datenmodelle objekt- relationaler Datenbanksysteme und Typsysteme objektorientierter Programmiersprachen näher zusammenzurücken. Er erlaubt neben der Schnittstellengenerierung ihre anwendungsspezifische Konfigurierung, um die DB-Verarbeitung spezieller Anwendungen gezielt optimieren zu können. Wir werden neben Aspekten der Generierung/Konfigurierung die Nutzung von generierten Aufrufschnittstellen beschreiben und Experimente vorstellen, die den durch diesen Ansatz erzielbaren Leistungsgewinn verdeutlichen. Letzterer kann durch gezielten, auf die jeweilige Anwendung zugeschnittenen Einsatz von frühen Bindungen für Datenmanipulationsoperationen sowie von Pointer-Swizzling-/Prefetching-Mechanismen erreicht werden.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004500050001
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Advanced data processing in KRISYS: modeling concepts, implementation techniques, and client/server issues (1998)
    Springer
    The VLDB journal 7 (1998), S. 79-95 
    Details
    ISSN: 0949-877X
    Keywords: Key words:Object-oriented modeling concepts – Consistency control – Query processing – Run-time optimization – Client/server architectures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. The increasing power of modern computers is steadily opening up new application domains for advanced data processing such as engineering and knowledge-based applications. To meet their requirements, concepts for advanced data management have been investigated during the last decade, especially in the field of object orientation. Over the last couple of years, the database group at the University of Kaiserslautern has been developing such an advanced database system, the KRISYS prototype. In this article, we report on the results and experiences obtained in the course of this project. The primary objective for the first version of KRISYS was to provide semantic features, such as an expressive data model, a set-oriented query language, deductive as well as active capabilities. The first KRISYS prototype became completely operational in 1989. To evaluate its features and to stabilize its functionality, we started to develop several applications with the system. These experiences marked the starting point for an overall redesign of KRISYS. Major goals were to tune KRISYS and its query-processing facilities to a suitable client/server environment, as well as to provide elaborate mechanisms for consistency control comprising semantic integrity constraints, multi-user synchronization, and failure recovery. The essential aspects of the resulting client/server architecture are embodied by the client-side data management needed to effectively support advanced applications and to gain the required system performance for interactive work. The project stages of KRISYS properly reflect the essential developments that have taken place in the research on advanced database systems over the last years. Hence, the subsequent discussions will bring up a number of important aspects with regard to advanced data processing that are of significant general importance, as well as of general applicability to database systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s007780050055
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The intrinsic problems of structural heterogeneity and an approach to their solution (1999)
    Springer
    The VLDB journal 8 (1999), S. 25-43 
    Details
    ISSN: 0949-877X
    Keywords: Key words:Heterogeneity – Legacy systems – Mapping language – Schema integration – Schema mapping – Updatable views
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. This paper focuses on the problems that arise when integrating data from heterogeneous sources in a single, unified database view. At first, we give a detailed analysis of the kinds of structural heterogeneity that occur when unified views are derived from different database systems. We present the results in a multiple tier architecture which distinguishes different levels of heterogeneity and relates them to their underlying causes as well as to the mapping conflicts resulting from the view derivation process. As the second essential contribution, the paper presents our approach to a mapping language solving the identified conflicts. The main characteristics of the language are its descriptiveness, its capability to map between schemas written in the relational, object-oriented, ER, or EXPRESS data model, and its facilities for specifying user-defined update operations on the view that are to be propagated to the data sources. Finally, we briefly discuss how this mapping information is employed to convert queries formulated with respect to the integrated view, into database operations over the heterogeneous data sources.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s007780050072
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Concurrency control issues in nested transactions (1993)
    Springer
    The VLDB journal 2 (1993), S. 39-74 
    Details
    ISSN: 0949-877X
    Keywords: Nested transactions ; concurrency control ; locking ; object hierarchies
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The concept of nested transactions offers more decomposable execution units and finer-grained control over concurrency and recovery than “flat” transactions. Furthermore, it supports the decomposition of a “unit of work” into subtasks and their appropriate distribution in a computer system as a prerequisite of intratransaction parallelism. However, to exploit its full potential, suitable granules of concurrency control as well as access modes for shared data are necessary. In this article, we investigate various issues of concurrency control for nested transactions. First, the mechanisms for cooperation and communication within nested transactions should not impede parallel execution of transactions among parent and children or among siblings. Therefore, a model for nested transactions is proposed allowing for effective exploitation of intra-transaction parallelism. Starting with a set of basic locking rules, we introduce the concept of “downward inheritance of locks” to make data manipulated by a parent available to its children. To support supervised and restricted access, this concept is refined to “controlled downward inheritance.” The initial concurrency control scheme was based on S-X locks for “flat,” non-overlapping data objects. In order to adjust this scheme for practical applications, a set of concurrency control rules is derived for generalized lock modes described by a compatibility matrix. Also, these rules are combined with a hierarchical locking scheme to improve selective access to data granules of varying sizes. After having tied together both types of hierarchies (transaction and object), it can be shown how “controlled downward inheritance” for hierarchical objects is achieved in nested transactions. Finally, problems of deadlock detection and resolution in nested transactions are considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01231798
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Access path support for referential integrity in SQL2 (1996)
    Springer
    The VLDB journal 5 (1996), S. 196-214 
    Details
    ISSN: 0949-877X
    Keywords: Key words: Referential integrity – Relational databases – SQL2 – MATCH clause – Access path support
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. The relational model of data incorporates fundamental assertions for entity integrity and referential integrity. Recently, these so-called relational invariants were more precisely specified by the new SQL2 standard. Accordingly, they have to be guaranteed by a relational DBMS to its users and, therefore, all issues of semantics and implementation became very important. The specification of referential integrity embodies quite a number of complications including the MATCH clause and a collection of referential actions. In particular, $\hbox{{\tt MATCH PARTIAL}}$ turns out to be hard to understand and, if applied, difficult and expensive to maintain. In this paper, we identify the functional requirements for preserving referential integrity. At a level free of implementational considerations, the number and kinds of searches necessary for referential integrity maintenance are derived. Based on these findings, our investigation is focused on the question of how the functional requirements can be supported by implementation concepts in an efficient way. We determine the search cost for referential integrity maintenance (in terms of page references) for various possible access path structures. Our main result is that a combined access path structure is the most appropriatefor checking the regular MATCH option, whereas $\hbox{{\tt MATCH PARTIAL}}$ requires very expensive and complicated check procedures. If it cannot be avoided at all, the best support is achieved by a combination of multiple $\mbox{B}^*$ -trees.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s007780050024
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Book
    Book
    Datenbanksysteme II; 18 (1976)
    Mannheim u.a. :BI,
    Details
    Title: Datenbanksysteme II; 18
    Author: Wedekind, Hartmut
    Contributer: Haerder, Theo
    Publisher: Mannheim u.a. :BI,
    Year of publication: 1976
    Pages: 430 S.
    Series Statement: Informatik 18
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 7
    Book
    Book
    Implementierung von Datenbanksystemem (1978)
    Muenchen u.a. :Hanser,
    Details
    Title: Implementierung von Datenbanksystemem
    Author: Haerder, Theo
    Publisher: Muenchen u.a. :Hanser,
    Year of publication: 1978
    Pages: 322 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...