Академический Документы
Профессиональный Документы
Культура Документы
Definition :
•A network model is a database model that is designed as a flexible approach to representing objects and their
relationships.
History :
•Charles Bachman was the original inventor of the network model.
•In 1969, the Conference on Data Systems Languages (CODASYL) Consortium developed the network model into a
standard specification.
•A second publication was introduced in 1971, which later turned into the basis for virtually all implementations.
Concepts :
•Simple Concept: Similar to the hierarchical model, this model is simple and the implementation is effortless.
•Ability to Manage More Relationship Types: The network model has the ability to manage one-to-one (1:1) as well as
many-to-many (N: N) relationships.
•Easy Access to Data: Accessing the data is simpler when compared to the hierarchical model.
•System Complexity: Each and every record has to be maintained with the help of pointers, which makes the database
structure more complex.
•Functional Flaws: Because a great number of pointers is essential, insertion, updates, and deletion become more
complex.
•Lack of Structural Independence: A change in structure demands a change in the application as well, which leads to lack
of structural independence.
Data Representation
•Binary Notation •Decimal Notation •Boolean
•Octal Notation •Hexadecimal Notation
Binary Notation
•Binary number -Only one of two possible values (0 or 1) per digit
•Reliably transported among computer system components
•Can be processed by two–state electrical devices (relatively easy to design
and fabricate)
•Correspond directly with values in Boolean logic
Decimal Notation
A representation of a fraction or other real number using the base ten and
consisting of any of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, and a decimal point.
Octal Notation
•Uses base 8 numbering system •Has a range of digits from 0 to 7
•Expresses large numeric values in:
One-third the length of corresponding binary notation
Double the length of corresponding hexadecimal notation
Hexadecimal Notation
•Uses 16 as its base or radix (hex = 6, and decimal = 10)
•Compact; advantage over binary notation
•Often used to designate memory addresses
Boolean
•Boolean –true/false •Correspond directly with values in Binary logic
Integers
•A whole number—a value that does not have a fractional part
•Data formats can be signed or unsigned
Determines largest and smallest values that can be represented
•Excess notation •Two’s complement notation (most common) •Range and overflow
Real Numbers
•Contain both whole and fractional components
•Require separation of components to be represented within computer circuitry
•Fixed radix point (simple) •Floating point notation (complex)
Character Data
•Represented indirectly by defining a table that assigns numeric values to individual characters
•Characteristics of coding methods
All users must share same coding/decoding method
Coded values must be capable of being stored or transmitted
Specific method represents a tradeoff among compactness, ease of manipulation, accuracy, range, and
standardization
Boolean Data
•Has only two data values—true and false
•Potentially most concise coding format; only a single bit is required
Memory Addresses
•Identifying numbers of memory bytes in primary storage
•Simple or complex numeric values depending on memory model used by CPU
Flat memory addresses (single integer) Segmented memory addresses (multiple integers)
•Require definition of specific coding format
Data Structures
•Related groups of primitive data elements organized for a type of common processing
•Defined and manipulated within software
•Commonly used data structures: arrays, linked lists, records, tables, files, indices, and objects
•Many use pointers to link primitive data components
Pointers and Addresses
•Pointer: Data element that contains the address of another data element
•Address: Location of a data element within a storage device
Arrays and Lists
•List: A set of related data values
•Array: An ordered list in which each element can be referenced by an index to its position
Linked Lists
•Data structures that use pointers so list elements can be scattered among no sequential storage locations
•Singly linked lists •Doubly linked lists
•Easier to expand or shrink than an array