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

Peter Brössler

dblp:95/1928 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Software engineering, systems software and programming languages · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 44% Empirical software engineering · 44% Requirements engineering and software design · 13%
Databases, data mining, and information retrieval
2 papers
Transaction processing and concurrency control · 79% Data models and query languages · 21%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering
controlled experiment
0.012001
A Controlled Experiment in Maintenance Comparing Design Patterns to Simpler Solutions · IEEE Trans. Software Eng. 2001
Transaction processing and concurrency control
concurrency control
0.011993
Semantic Concurrency Control in Object-Oriented Database Systems · ICDE 1993
Transaction processing and concurrency control
nested transactions
0.011993
Semantic Concurrency Control in Object-Oriented Database Systems · ICDE 1993
Data models and query languages
object-oriented database
0.011993
Semantic Concurrency Control in Object-Oriented Database Systems · ICDE 1993
Transaction processing and concurrency control › concurrency control › locking
semantic locking
0.011993
Semantic Concurrency Control in Object-Oriented Database Systems · ICDE 1993
Requirements engineering and software design
design patterns
0.012001
A Controlled Experiment in Maintenance Comparing Design Patterns to Simpler Solutions · IEEE Trans. Software Eng. 2001
Transaction processing and concurrency control
recovery
0.011990
Multi-Level Recovery · PODS 1990

Methods — techniques the papers use, named apart from their topics

maintenance task analysis · 0.0controlled experiment · 0.0method commutativity · 0.0locking protocols · 0.0
YearPublicationVenuePosition
2003 Critical Success Factors in Software Maintenance-A Case Study
abstract
The objective of this paper is to identify those factors, which are critical to the success of a maintenance operation in general and to apply them to a particular maintenance project. The project in question is the maintenance and evolution of a very large and complex banking application system for securities processing which has been in progress since several years. Eight factors are defined and evaluated in accordance with the existing literature on software maintenance and with the experience gained on several such maintenance projects. Each of the eight factors is scored according to a given metric scale. It is left to the evaluator to weigh and evaluate the significance of the individual factors. The study is based on empirical data collected over the duration of the project and is intended to contribute to the overall knowledge of software maintenance management.
Harry M. Sneed, Peter Brössler
ICSM2
2001 A Controlled Experiment in Maintenance Comparing Design Patterns to Simpler Solutions
abstract
Software design patterns package proven solutions to recurring design problems in a form that simplifies reuse. We are seeking empirical evidence whether using design patterns is beneficial. In particular, one may prefer using a design pattern even if the actual design problem is simpler than that solved by the pattern, i.e., if not all of the functionality offered by the pattern is actually required. Our experiment investigates software maintenance scenarios that employ various design patterns and compares designs with patterns to simpler alternatives. The subjects were professional software engineers. In most of our nine maintenance tasks, we found positive effects from using a design pattern: either its inherent additional flexibility was achieved without requiring more maintenance time or maintenance time was reduced compared to the simpler alternative. In a few cases, we found negative effects: the alternative solution was less error-prone or required less maintenance time. Overall, we conclude that, unless there is a clear reason to prefer the simpler solution, it is probably wise to choose the flexibility provided by the design pattern because unexpected new requirements often appear. We identify several questions for future empirical research.
Lutz Prechelt, Barbara Unger 0001, Walter F. Tichy, Peter Brössler, Lawrence G. Votta
IEEE Trans. Software Eng.4
2000 Project Experience Database: A Report Based on First Practical Experience
Stefan Engelkamp, Susanne Hartkopf, Peter Brössler
PROFES3
1999 Knowledge Management at a Software House. An Experience Report
Peter Brössler
SEKE1
1993 Semantic Concurrency Control in Object-Oriented Database Systems
abstract
A locking protocol for object-oriented database systems (OODBSs) is presented. The protocol can exploit the semantics of methods invoked on encapsulated objects. Compared to conventional page-oriented or record-oriented concurrency control protocols, the proposed protocol greatly improves the possible concurrency because commutative method executions on the same object are not considered as a conflict. An OODBS application example is presented. The principle of open-nested transactions is reviewed. It is shown that, using the locking protocol in an open-nested transaction, the locks of a subtransaction are released when the subtransaction completes, and only a semantic lock is held further by the parent of the subtransaction.>
Peter Muth, Thomas C. Rakow, Gerhard Weikum, Peter Brössler, Christof Hasse
ICDE4
1990 Multi-Level Recovery
abstract
Multi-level transactions have received considerable attention as a framework for high-performance concurrency control methods. An inherent property of multi-level transactions is the need for compensating actions, since state-based recovery methods do no longer work correctly for transaction undo. The resulting requirement of operation logging adds to the complexity of crash recovery. In addition, multi-level recovery algorithms have to take into account that high-level actions are not necessarily atomic, e.g., if multiple pages are updated in a single action.
Gerhard Weikum, Christof Hasse, Peter Brössler, Peter Muth
PODS3