Graph data model and its data language
著者
書誌事項
Graph data model and its data language
Springer-Verlag, c1990
- : us
- : ja
- : gw
- : softcover
- タイトル別名
-
Graph data model
大学図書館所蔵 件 / 全17件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Softcover reprint of the hardcover 1st edition 1990"--T.p. verso
Bibliography: p. [97]-100
内容説明・目次
- 巻冊次
-
: gw ISBN 9783540700586
内容説明
Complex databases can be understood well with visual representation. A graph is a very intuitive and rational structure to visually represent such databases. The graph data model proposed in this treatise formalizes data representation and operations on the data in terms of the graph concept. In this model, a database is defined by a schema graph where nodes represent record types and arcs represent link types that are relationships between two record types. The capabilities of the model include direct representation of many-to-many relationships and of the relationships within a single record type.
- 巻冊次
-
: softcover ISBN 9784431681168
内容説明
Complex databases can be understood well with visual representation. A graph is a very intuitive and rational structure to visually represent such databases. Graph Data Model (GDM) proposed by the author formalizes data representation and operations on the data in terms of the graph concept. The GDM is an extension of the relational model toward structural representation. In this model, a database is defined by a schema graph where nodes represent record types and arcs represent link types that are relationships between two record types. The capabilities of the GDM include direct representation of many-to-many relationships and of the relationships within a single record type. The characteristic operators are those associated with links: existential, universal, numerical and transitive link operators. Graph Data Language (GDL) is a data language based on this GDM. The essence of the GDL is path expressions used for formulation of queries. The concepts of GDM and GDL have actually been implemented by Ricoh Co., Ltd. and a system based on these concepts is commercially available for many UNIX machines.
目次
1. Introduction.- 1.1 Motivation.- 1.2 Overview.- 1.3 Related Work.- 2. Graph Data Model.- 2.1 Overview.- 2.2 Schema.- 2.3 Elementary Data Operations.- 2.3.1 Record List.- 2.3.2 Restriction.- 2.3.3 Record List Projection.- 2.3.4 Projection.- 2.3.5 Link Creation.- 2.3.6 Link Operators.- 2.3.6.1 Grouping.- 2.3.6.2 Existential link operators.- 2.3.6.3 Numerical link operators.- 2.3.6.4 Transitive link operators.- 2.3.6.5 Formation of resultant record list type.- 2.3.7 Storage Operations.- 3. Data Definition Language.- 3.1 Overview.- 3.2 Schema Definition.- 3.2.1 Record Type Definition.- 3.2.2 Link Type Definition.- 3.2.3 Constraint Definition.- 3.3 Views.- 3.4 Schema Evolution.- 4. Data Manipulation Language.- 4.1 Overview.- 4.2 Volatile Object Definition.- 4.3 Record Selection and Creation.- 4.3.1 Variables.- 4.3.2 Record Selection.- 4.3.3 Path Expressions.- 4.3.4 Inter-Record Restrictions.- 4.3.5 Nested Path Expressions.- 4.3.6 Set Operators.- 4.3.7 Select Record Statement.- 4.3.8 Translation of DML Statements.- 4.3.9 Graph-Driven Interactive Query Interface.- 4.4 Link Selection and Creation.- 4.4.1 Select Link Statement.- 4.4.2 Connect Link Statement.- 4.5 Storage Operations.- 4.5.1 Add Record Statement.- 4.5.2 Add Link Statement.- 4.5.3 Delete Record (Link) Statement.- 4.5.4 Remove Record (Link) Statement.- 4.5.5 Replace Record Statement.- 4.5.6 Reconnect Link Statement.- 5. Implementation of GDL.- 5.1 Overview.- 5.2 Some Design Issues.- 5.3 DDL Processor.- 5.3.1 Functions of DDL Processor.- 5.3.2 Schema Definition.- 5.3.3 Record Definition.- 5.3.4 Attribute Definition.- 5.3.5 Link Definition.- 5.3.6 Constraints, Views, and Evolution of Schemas.- 5.4 Run-time System.- 5.4.1 Overview of Query Evaluation.- 5.4.2 Run-time Data Structures.- 5.4.3 Run-time Procedures.- 5.5 DML Precompiler.- 5.6 Access Paths and Other Environment-Dependent Factors.- 5.7 Query Processor.- 6. A Comparison of Access Path Strategies.- 6.1 Introduction.- 6.2 An Extension of Yao's Cost Model for Query Evaluation Algorithms.- 6.3 Costs of Query Evaluation Algorithms.- 6.3.1 One-Variable Queries.- 6.3.2 Two-Variable Queries.- 6.3.2.1 Case 1.- 6.3.2.2 Case 2.- 6.3.2.3 Case 3.- 6.3.2.4 Case 4.- 6.3.2.5 Case 5.- 6.3.3 Semi-joins.- 6.3.4 Three-Variable Queries.- 6.4 Conclusion.- 7. Conclusions.- 7.1 Contribution.- 7.2 Future Research.- Appendix A: BNF Grammar of GDL.- Appendix B: Specification of Run-time System.- B.1 File Structures.- B.2 Parameters and Variables.- B.3 IRST Procedure.- B.4 XRST Procedure.- B.5 EXT Procedure.- B.6 NEGEXT Procedure.- B.7 NUM Procedure.- B.8 TRN Procedure.- B.9 LNKCRT Procedure.- B.10 PROJ Procedure.- B.11 FETCH Procedure.- B.12 UNI, INTS, DIF Procedures.- B.13 RADD Procedure.- B.14 RDEL Procedure.- B.15 LADD Procedure.- B.16 LDEL Procedure.- B.17 PUSH Procedure.- B.18 POP Procedure.- B.19 RLPROJ Procedure.- B.20 GETREC Procedure.- B.21 GETIDX Procedure.- B.22 GETLNK Procedure.- B.23 GROUP Procedure.- B.24 SORT Procedure.- B.25 ASGNRL Procedure.- B.26 DELRL Procedure.- B.27 ASGNREC Procedure.- B.28 ADDREC Procedure.- B.29 DELREC Procedure.- B.30 ADDIDX Procedure.- B.31 DELIDX Procedure.- B.32 ADDLNK Procedure.- B.33 DELLNK Procedure.- B.34 SRCHTRE Function.- B.35 ADDTRE Procedure.- B.36 DELTRE Procedure.- Symbols and Abbreviations.
- 巻冊次
-
: ja ISBN 9784431700586
内容説明
Complex databases can be understood well with visual representation. A graph is a very intuitive and rational structure to visually represent such databases. Graph Data Model (GDM) proposed by the author formalizes data representation and operations on the data in terms of the graph concept. The GDM is an extension of the relational model toward structural representation. In this model, a database is defined by a schema graph where nodes represent record types and arcs represent link types that are relationships between two record types. The capabilities of the GDM include direct representation of many-to-many relationships and of the relationships within a single record type. The characteristic operators are those associated with links: existential, universal, numerical and transitive link operators. Graph Data Language (GDL) is a data language based on this GDM. The essence of the GDL is path expressions used for formulation of queries. The concepts of GDM and GDL have actually been implemented by Ricoh Co., Ltd. and a system based on these concepts is commercially available for many UNIX machines.
目次
1. Introduction.- 1.1 Motivation.- 1.2 Overview.- 1.3 Related Work.- 2. Graph Data Model.- 2.1 Overview.- 2.2 Schema.- 2.3 Elementary Data Operations.- 2.3.1 Record List.- 2.3.2 Restriction.- 2.3.3 Record List Projection.- 2.3.4 Projection.- 2.3.5 Link Creation.- 2.3.6 Link Operators.- 2.3.6.1 Grouping.- 2.3.6.2 Existential link operators.- 2.3.6.3 Numerical link operators.- 2.3.6.4 Transitive link operators.- 2.3.6.5 Formation of resultant record list type.- 2.3.7 Storage Operations.- 3. Data Definition Language.- 3.1 Overview.- 3.2 Schema Definition.- 3.2.1 Record Type Definition.- 3.2.2 Link Type Definition.- 3.2.3 Constraint Definition.- 3.3 Views.- 3.4 Schema Evolution.- 4. Data Manipulation Language.- 4.1 Overview.- 4.2 Volatile Object Definition.- 4.3 Record Selection and Creation.- 4.3.1 Variables.- 4.3.2 Record Selection.- 4.3.3 Path Expressions.- 4.3.4 Inter-Record Restrictions.- 4.3.5 Nested Path Expressions.- 4.3.6 Set Operators.- 4.3.7 Select Record Statement.- 4.3.8 Translation of DML Statements.- 4.3.9 Graph-Driven Interactive Query Interface.- 4.4 Link Selection and Creation.- 4.4.1 Select Link Statement.- 4.4.2 Connect Link Statement.- 4.5 Storage Operations.- 4.5.1 Add Record Statement.- 4.5.2 Add Link Statement.- 4.5.3 Delete Record (Link) Statement.- 4.5.4 Remove Record (Link) Statement.- 4.5.5 Replace Record Statement.- 4.5.6 Reconnect Link Statement.- 5. Implementation of GDL.- 5.1 Overview.- 5.2 Some Design Issues.- 5.3 DDL Processor.- 5.3.1 Functions of DDL Processor.- 5.3.2 Schema Definition.- 5.3.3 Record Definition.- 5.3.4 Attribute Definition.- 5.3.5 Link Definition.- 5.3.6 Constraints, Views, and Evolution of Schemas.- 5.4 Run-time System.- 5.4.1 Overview of Query Evaluation.- 5.4.2 Run-time Data Structures.- 5.4.3 Run-time Procedures.- 5.5 DML Precompiler.- 5.6 Access Paths and Other Environment-Dependent Factors.- 5.7 Query Processor.- 6. A Comparison of Access Path Strategies.- 6.1 Introduction.- 6.2 An Extension of Yao's Cost Model for Query Evaluation Algorithms.- 6.3 Costs of Query Evaluation Algorithms.- 6.3.1 One-Variable Queries.- 6.3.2 Two-Variable Queries.- 6.3.2.1 Case 1.- 6.3.2.2 Case 2.- 6.3.2.3 Case 3.- 6.3.2.4 Case 4.- 6.3.2.5 Case 5.- 6.3.3 Semi-joins.- 6.3.4 Three-Variable Queries.- 6.4 Conclusion.- 7. Conclusions.- 7.1 Contribution.- 7.2 Future Research.- Appendix A: BNF Grammar of GDL.- Appendix B: Specification of Run-time System.- B.1 File Structures.- B.2 Parameters and Variables.- B.3 IRST Procedure.- B.4 XRST Procedure.- B.5 EXT Procedure.- B.6 NEGEXT Procedure.- B.7 NUM Procedure.- B.8 TRN Procedure.- B.9 LNKCRT Procedure.- B.10 PROJ Procedure.- B.11 FETCH Procedure.- B.12 UNI, INTS, DIF Procedures.- B.13 RADD Procedure.- B.14 RDEL Procedure.- B.15 LADD Procedure.- B.16 LDEL Procedure.- B.17 PUSH Procedure.- B.18 POP Procedure.- B.19 RLPROJ Procedure.- B.20 GETREC Procedure.- B.21 GETIDX Procedure.- B.22 GETLNK Procedure.- B.23 GROUP Procedure.- B.24 SORT Procedure.- B.25 ASGNRL Procedure.- B.26 DELRL Procedure.- B.27 ASGNREC Procedure.- B.28 ADDREC Procedure.- B.29 DELREC Procedure.- B.30 ADDIDX Procedure.- B.31 DELIDX Procedure.- B.32 ADDLNK Procedure.- B.33 DELLNK Procedure.- B.34 SRCHTRE Function.- B.35 ADDTRE Procedure.- B.36 DELTRE Procedure.- Symbols and Abbreviations.
「Nielsen BookData」 より
