Elicitation and conversion of hidden objects and restrictions in a database schema
Proceedings of the 2002 ACM symposium on Applied computing
Automated elicitation of inclusion dependencies from the source code for database transactions
Journal of Software Maintenance: Research and Practice
Wrapper-based evolution of legacy information systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Extracting entity-relationship diagram from a table-based legacy database
Journal of Systems and Software
A methodology for database reengineering to web services
ECMDA-FA'06 Proceedings of the Second European conference on Model Driven Architecture: foundations and Applications
Integrating and querying source code of programs working on a database
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Querying external source code files of programs connecting to a relational database
Proceedings of the 5th Ph.D. workshop on Information and knowledge
Aiding Maintenance of Database Applications Through Extracting Attribute Dependency Graph
Journal of Database Management
| Hi-index | 0.00 |
Database reverse engineering (DBRE) attempts to recover the technical and semantic specifications of he persistent data of information systems. Dependencies between records (data dependency) form a major class that need to be recovered. Since most of these dependencies are not supported by the DBMS, (foreign keys are the main exception, at least in modern relational DBMS), they have not be explicitly declared in the database schema. Careless reverse engineering will inevitably ignore them, leading to poor quality conceptual schema. Several information sources can contribute to the elicitation of these hidden dependencies. The program source code has long been considered the richest, but also the most complex, of them. In this paper, we analyze and compare, through their respective quality and cost, different program understanding techniques that can be used to elicit data dependencies.