{"id":82621,"date":"2024-10-18T03:07:10","date_gmt":"2024-10-18T03:07:10","guid":{"rendered":"https:\/\/pdfstandards.shop\/product\/uncategorized\/ieee-610-5-1990\/"},"modified":"2024-10-24T19:50:49","modified_gmt":"2024-10-24T19:50:49","slug":"ieee-610-5-1990","status":"publish","type":"product","link":"https:\/\/pdfstandards.shop\/product\/publishers\/ieee\/ieee-610-5-1990\/","title":{"rendered":"IEEE 610.5 1990"},"content":{"rendered":"
New IEEE Standard – Inactive – Withdrawn. Withdrawn Standard. Withdrawn Date: Mar 06, 2000. No longer endorsed by the IEEE. Identifies terms in use in the field of data management. Standard definitions for those terms are established.<\/p>\n
PDF Pages<\/th>\n | PDF Title<\/th>\n<\/tr>\n | ||||||
---|---|---|---|---|---|---|---|
9<\/td>\n | 1 Scope Dictionary Structure 3 References <\/td>\n<\/tr>\n | ||||||
10<\/td>\n | Definitions for Data Management Terms <\/td>\n<\/tr>\n | ||||||
12<\/td>\n | Fig 1 Anomaly <\/td>\n<\/tr>\n | ||||||
13<\/td>\n | B-Tree of Order Fig 3 B’-Tree of Order B*-Tree of Order <\/td>\n<\/tr>\n | ||||||
18<\/td>\n | E Is a Child Node of Node D <\/td>\n<\/tr>\n | ||||||
20<\/td>\n | Fig 6 Complete Binary Tree Concatenated Kay <\/td>\n<\/tr>\n | ||||||
27<\/td>\n | Descendant Node <\/td>\n<\/tr>\n | ||||||
28<\/td>\n | Fig 9 Difference <\/td>\n<\/tr>\n | ||||||
29<\/td>\n | Directed Graph <\/td>\n<\/tr>\n | ||||||
31<\/td>\n | Entity\/Attribute Matrix <\/td>\n<\/tr>\n | ||||||
34<\/td>\n | First Normal Form <\/td>\n<\/tr>\n | ||||||
37<\/td>\n | Fig13 Graph <\/td>\n<\/tr>\n | ||||||
38<\/td>\n | Fig14 Heap <\/td>\n<\/tr>\n | ||||||
39<\/td>\n | Fig 15 Hierarchy <\/td>\n<\/tr>\n | ||||||
42<\/td>\n | Fig 16 Intersection <\/td>\n<\/tr>\n | ||||||
43<\/td>\n | Fig 17 Join <\/td>\n<\/tr>\n | ||||||
48<\/td>\n | Fig 18 Multilist <\/td>\n<\/tr>\n | ||||||
49<\/td>\n | Fig 19 Network <\/td>\n<\/tr>\n | ||||||
52<\/td>\n | Parent Node <\/td>\n<\/tr>\n | ||||||
54<\/td>\n | Fig 21 Product <\/td>\n<\/tr>\n | ||||||
55<\/td>\n | Fig22 Projection <\/td>\n<\/tr>\n | ||||||
56<\/td>\n | Qualified Name <\/td>\n<\/tr>\n | ||||||
59<\/td>\n | Repeating Field <\/td>\n<\/tr>\n | ||||||
60<\/td>\n | Root Node <\/td>\n<\/tr>\n | ||||||
62<\/td>\n | Second Normal Form <\/td>\n<\/tr>\n | ||||||
63<\/td>\n | Fig 27 Selection <\/td>\n<\/tr>\n | ||||||
64<\/td>\n | Sibling Nodes <\/td>\n<\/tr>\n | ||||||
67<\/td>\n | Fig 29 Graph and Subgraph Fig 30 Table <\/td>\n<\/tr>\n | ||||||
68<\/td>\n | Third Normal Form <\/td>\n<\/tr>\n | ||||||
69<\/td>\n | Fig32 Tree <\/td>\n<\/tr>\n | ||||||
70<\/td>\n | Fig 33 Trie Fig34 Union <\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":" IEEE Standard Glossary of Data Management Terminology<\/b><\/p>\n |