DATABASE SYSTEM CONCEPTS
2009-11-10 15:06
288 查看
E-R Model , abstract , independent of database implementation
Requirement -> E-R Model -> Database Implementation
Mapping the meaning of interations of real-world enterprises onto a conceptual schema
Mapping the real-world information and their relationship into E-R Model
Entity : An entity has attributes (a record)
attribute type : simple and single value
composite(eg. an attribute composed by family_name + last_name)
multivalued(eg. an phone attribute for on person, phone1, phone2)
Derived(to be calculated from other attribute)
Entity Set : A set of entityes have the same type (a table)
A relationship is an association among several entities.
{ (e1, e2, e3) | e1∈E1, e2∈E2, e3∈E3 }, (e1, e2, e3) is a relationship
A super-key is a set of one or more attributes that, taken collectively, allow us to identify an entity in the entity set.
A candidate-key is the minmal super-key, there may be many.
Aggregation In ER-Model : treat the relationship of several entities as a new entity, and connect it with another entity, That's the resuse of relationship.
tuple = entity = record
Storage and File Structure
The unit of disk operation is a block, about 512 Bytes
* Fixed-Length Records
When delete an record : mark blank by free link list method , Or, move the bottom record to take the room
* Variable-Length Records
A block contains many records
| p1 p2 p3 .................free room .........e3, e2, e2 | the pointer in the front points to the real entity, when an entity is deleted, the entites at the behine in the same block is moved up.
Database Index
Primary Index : If any, only one. The record in the disk should be stored sequentially according to the index key.
Secondary Index : Can be multiple, independent with the record alignment in the disk. It's the index in normal sense.
Tree
B Tree :
B- Tree :
B+ Tree :
B* Tree :
Hash
Static Hash : Normal hash, hash the key to the bucket(disk block)
Dynamic Hash : The size of the hash table can be changed, when chang happen, all the data in bucket has to be reorganized to adapt the hash table of new size.
Bitmap
The value of a field is limited to several choices, it's used to facilitate the composition query.
Requirement -> E-R Model -> Database Implementation
Mapping the meaning of interations of real-world enterprises onto a conceptual schema
Mapping the real-world information and their relationship into E-R Model
Entity : An entity has attributes (a record)
attribute type : simple and single value
composite(eg. an attribute composed by family_name + last_name)
multivalued(eg. an phone attribute for on person, phone1, phone2)
Derived(to be calculated from other attribute)
Entity Set : A set of entityes have the same type (a table)
A relationship is an association among several entities.
{ (e1, e2, e3) | e1∈E1, e2∈E2, e3∈E3 }, (e1, e2, e3) is a relationship
A super-key is a set of one or more attributes that, taken collectively, allow us to identify an entity in the entity set.
A candidate-key is the minmal super-key, there may be many.
Aggregation In ER-Model : treat the relationship of several entities as a new entity, and connect it with another entity, That's the resuse of relationship.
tuple = entity = record
Storage and File Structure
The unit of disk operation is a block, about 512 Bytes
* Fixed-Length Records
When delete an record : mark blank by free link list method , Or, move the bottom record to take the room
* Variable-Length Records
A block contains many records
| p1 p2 p3 .................free room .........e3, e2, e2 | the pointer in the front points to the real entity, when an entity is deleted, the entites at the behine in the same block is moved up.
Database Index
Primary Index : If any, only one. The record in the disk should be stored sequentially according to the index key.
Secondary Index : Can be multiple, independent with the record alignment in the disk. It's the index in normal sense.
Tree
B Tree :
B- Tree :
B+ Tree :
B* Tree :
Hash
Static Hash : Normal hash, hash the key to the bucket(disk block)
Dynamic Hash : The size of the hash table can be changed, when chang happen, all the data in bucket has to be reorganized to adapt the hash table of new size.
Bitmap
The value of a field is limited to several choices, it's used to facilitate the composition query.
相关文章推荐
- Database System Concepts (1) -- Data Models
- Database system concept笔记(1)
- Database System Concepts (2) -- SQL
- Database System Concepts
- DATABASE SYSTEM CONCEPTS
- Database system concept笔记(3)
- Database system concept笔记(4)
- [Database System Concepts] My First Virtual Website~
- Database System Concepts (1) -- Data Storage and Querying
- Database System Concepts
- Database System Concepts (4) -- Indexing and Hashing
- DATABASE SYSTEM CONCEPTS4.8
- Smartphone Operating System Concepts with Symbian OS: A Tutorial Guide
- Pro Visual Studio Team System with Team Edition for Database Professionals, Second Edition
- 林子雨老师团队《Architecture of a Database System》 中文版
- Java persistence with hibernate concept 4 -- Database primary keys
- Database Management System 基础01:管理自己的任何事
- How to rebuild RPM database on a Red Hat Enterprise Linux system?
- SD MEMORY CARD SYSTEM CONCEPT
- 《Oracle Database Concepts 11g Release 2》读书笔记(1)-schema