Demo Data from EDBT 2026 / reviewers in the wild / expert
Yossi Cohen
dblp:44/5503
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2003
0009-0008-8998-0709ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 2 first-authorArtificial 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
2 papers |
Software maintenance and evolution · 59% Compilers and program optimization · 41% | |
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 85% Data models and query languages · 15% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software maintenance and evolution › software reengineering
legacy system reengineering |
0.0 | 1 | 2003 | Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementation · ACM Trans. Softw. Eng. Methodol. 2003 |
Compilers and program optimization
program transformation |
0.0 | 1 | 2003 | Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementation · ACM Trans. Softw. Eng. Methodol. 2003 |
Query processing and optimization
query optimization |
0.0 | 1 | 1997 | Automatic High-Quality Reengineering of Database Programs by Temporal Abstraction · ASE 1997 |
Software maintenance and evolution
software reengineering |
0.0 | 1 | 1997 | Automatic High-Quality Reengineering of Database Programs by Temporal Abstraction · ASE 1997 |
Query processing and optimization › query optimization
declarative query optimization |
0.0 | 1 | 2003 | Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementation · ACM Trans. Softw. Eng. Methodol. 2003 |
Data models and query languages
relational model |
0.0 | 1 | 1997 | Automatic High-Quality Reengineering of Database Programs by Temporal Abstraction · ASE 1997 |
Methods — techniques the papers use, named apart from their topics
plan calculus · 0.1query graphs · 0.0query graph · 0.0temporal abstraction · 0.0program analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Inferring region salience from binary and gray-level images
Yossi Cohen, Ronen Basri |
Pattern Recognit. | 1 |
| 2003 | Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementationabstractOld-generation database models, such as the indexed-sequential, hierarchical, or network models, provide record-level access to their data, with all application logic residing in the hosting program. In contrast, relational databases can perform complex operations, such as filter, aggregation, and join, on multiple records without an external specification of the record-access logic. Programs written for relational databases attempt to move as much of the application logic as possible into the database, in order to make the most of the optimizations performed internally by the database.This conceptual gap between the programming styles makes automatic high-quality translation of programs written for the older database models to the relational model difficult. It is not enough to convert just the database-access operations, since this would result in unacceptably inefficient programs. It is necessary to convert parts of the application logic from the procedural style of the hosting program (which is almost always Cobol) to the declarative style of SQL.This article describes an automatic system, called MIDAS, that performs high-quality reengineering of legacy database programs in this way. MIDAS is based on the paradigm of translation by abstraction, transformation, and reimplementation. The abstract representation is based on the Plan Calculus, with the addition of Query Graphs, introduced in this article in order to abstract the temporal behavior of database access patterns.The results of MIDAS's translation were found to be superior to those of the naive translation that only converts database-access operations in terms of readability, size of code, speed, and network data traffic. Initial industrial experience with MIDAS also demonstrates the high quality of its translations on large-scale programs. Yossi Cohen, Yishai A. Feldman |
ACM Trans. Softw. Eng. Methodol. | 1 |
| 1997 | Automatic High-Quality Reengineering of Database Programs by Temporal AbstractionabstractThe relational database model is currently the target of choice for the conversion of legacy software that uses older models (such as indexed-sequential, hierarchical or network models). The relational model makes up for its lower efficiency by a greater expressive power and by optimization of queries, using indexes and other means. However, sophisticated analysis is required in order to take advantage of these features, since converting each database access operation separately does not use the greater expressive power of the target database and does not enable it to perform useful optimizations. By analyzing the behavior of the host program around the database access operations, it is possible to discover patterns such as filtering, joins and aggregative operations. It is then possible to remove those operations from the host program and re-implement them in the target database query language. This paper describes an automatic system, called MIDAS (MIgrator of Database Application Systems), that performs high-quality reengineering of legacy database programs in this way. The results of MIDAS were found to be superior to those of the naive one-to-one translation in terms of readability, size, speed and network data traffic. Yossi Cohen, Yishai A. Feldman |
ASE | 1 |