Algorithms of graph partitioning exploited in conceptual database design for researches common to both information systems and software engineering approaches have recently been reused in concept theory to define a methodology of database concept preservation. An algorithm, called concept construction algorithm has been designed. The paper examines the advances in the database conceptual graph partitioning research. Relationships between conceptual graphs and concept generalization hierarchies are established at the boundary between concept theory and computer science. An algorithm for the integration of concept generalization hierarchies is proposed as a refinement step of the concept construction algorithm.
Evolving database conceptual graph partitioning
Locuratolo EI
2015
Abstract
Algorithms of graph partitioning exploited in conceptual database design for researches common to both information systems and software engineering approaches have recently been reused in concept theory to define a methodology of database concept preservation. An algorithm, called concept construction algorithm has been designed. The paper examines the advances in the database conceptual graph partitioning research. Relationships between conceptual graphs and concept generalization hierarchies are established at the boundary between concept theory and computer science. An algorithm for the integration of concept generalization hierarchies is proposed as a refinement step of the concept construction algorithm.File | Dimensione | Formato | |
---|---|---|---|
prod_295313-doc_84850.pdf
solo utenti autorizzati
Descrizione: Evolving database conceptual graph partitioning
Dimensione
1.84 MB
Formato
Adobe PDF
|
1.84 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.