Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin Bever

dblp:69/1705 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › database programming language
database programming language integration
0.011985
Database Hosting in Strongly-Typed Programming Languages · ACM Trans. Database Syst. 1985
Programming languages and type systems
abstract data types
0.011985
Database Hosting in Strongly-Typed Programming Languages · ACM Trans. Database Syst. 1985
YearPublicationVenuePosition
1993 Communication support for cooperative work
Thomas Kirsche, Richard Lenz, Horst Lührsen, Klaus Meyer-Wegener, Hartmut Wedekind, Martin Bever, Ulrich Schäffer, Claus Schottmüller
Comput. Commun.6
1985 A Framework for Application Systems Engineering
Heinrich C. Mayr, Peter C. Lockemann, Martin Bever
Inf. Syst.3
1985 Database Hosting in Strongly-Typed Programming Languages
abstract
Database system support has become an essential part of many computer applications, which have extended beyond the more traditional commercial applications to, among others, engineering applications. Correspondingly, application programming with the need to access databases has progressively shifted to scientifically oriented languages. Modern developments in these languages are characterized by advanced mechanisms for the liberal declaration of data types, for type checking, and facilities for modularization of large programs. The present paper examines how a DBMS can be accessed from such a language in a way that conforms to its syntax and utilizes its type-checking facilities, without modifying the language specification itself, and hence its compilers. The basic idea is to rely on facilities for defining modules as separately compilable units, and to use these to declare user-defined abstract data types. The idea is demonstrated by an experiment in which a specific DBMS (ADABAS) is hosted in the programming language (LIS). The paper outlines a number of approaches and their problems, shows how to embed the DML into LIS, and how a more user-oriented DML can be provided in LIS.
Martin Bever, Peter C. Lockemann
ACM Trans. Database Syst.1