DATA CONVERSION RULES FROM NETWORK TO RELATIONAL DATABASES

被引:5
|
作者
FONG, J [1 ]
BLOOR, C [1 ]
机构
[1] UNIV SUNDERLAND,SCH COMP & INFORMAT SYST,SUNDERLAND,ENGLAND
关键词
DATA CONVERSION; NETWORK; RELATIONAL; DATABASE; LOOP-FREE NETWORK SCHEMA; ACYCLICITY; METHODOLOGY; EXISTENCE SEMANTIC; NAVIGATIONAL SEMANTIC;
D O I
10.1016/0950-5849(94)90053-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Because of its popularity and user adaptability, many companies have chosen relational databases as their corporate database systems. However, with a huge investment in existing network and hierarchical database applications, there is a need for some companies to convert them into relational databases. Currently the simplest solution for data conversion is to write an application program for each network database file conversion or to develop a language to implement the conversion process. These are inefficient and costly. This paper describes a methodology for integrating schema translation and data conversion. Schema translation involves semantic reconstruction and the mapping of network schema into relational schema. Data conversion involves unloading records of each record type and their relationship relations into sequential files, and uploading them into relational table files. The conversion process can recover the semantics of the network schema by capturing users' knowledge. The methodology preserves the constraints of the network database by mapping the equivalent data dependencies of a loop-free network schema to a relational schema. The translation of navigational semantic from network schema to relational schema implies that each distinct access path of network schema should be considered as a subschema before conversion. The conversion process translates the existence and navigational semantics of the network database into a relational database without loss of information.
引用
收藏
页码:141 / 153
页数:13
相关论文
共 50 条
  • [21] A DATA DISTRIBUTION MODEL FOR DISTRIBUTED RELATIONAL DATABASES WITH DISSIMILAR COMPUTERS AND NETWORK COSTS
    MOTZKIN, D
    YURK, PD
    MATHEMATICAL AND COMPUTER MODELLING, 1990, 14 : 172 - 177
  • [22] Fuzzy Data in Traditional Relational Databases
    Hudec, Miroslav
    2014 12TH SYMPOSIUM ON NEURAL NETWORK APPLICATIONS IN ELECTRICAL ENGINEERING (NEUREL), 2014, : 195 - 199
  • [23] Storing semistructured data in relational databases
    Magalhaes, KV
    Laender, AHF
    da Silva, AS
    EIGHTH SYMPOSIUM ON STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2001, : 143 - 152
  • [24] A FUZZY REPRESENTATION OF DATA FOR RELATIONAL DATABASES
    BUCKLES, BP
    PETRY, FE
    FUZZY SETS AND SYSTEMS, 1982, 7 (03) : 213 - 226
  • [25] ON DATA DEPENDENCY STRUCTURES OF RELATIONAL DATABASES
    LUK, WS
    INFORMATION SYSTEMS, 1981, 6 (01) : 23 - 29
  • [26] Beyond Relational Databases: Preserving the Data
    Ramalho J.C.
    Ferreira B.
    Faria L.
    Ferreira M.
    New Review of Information Networking, 2020, 25 (02) : 107 - 118
  • [27] Managing Unstructured Data in Relational Databases
    Yafooz, Wael M. S.
    Abidin, Siti Z. Z.
    Omar, Nasiroh
    Idrus, Zanariah
    2013 IEEE CONFERENCE ON SYSTEMS, PROCESS & CONTROL (ICSPC), 2013, : 198 - 203
  • [28] Inheriting Access Control Rules from Large Relational Databases to Materialized Views Automatically
    Cuzzocrea, Alfredo
    Hacid, Mohand-Said
    Grillo, Nicola
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT III, 2010, 6278 : 426 - +
  • [29] Efficient algorithms for mining fuzzy rules in large relational databases
    Chen, Ning
    Chen, An
    Zhou, Long-Xiang
    Ruan Jian Xue Bao/Journal of Software, 2001, 12 (07): : 949 - 959
  • [30] On extending the relational data model for relational databases with incomplete information
    Motzkin, D.
    Mathematical Modelling and Scientific Computing, 1993, 2 (sectiob):