Presentation is loading. Please wait.

Presentation is loading. Please wait.

Create, Insert, Delete, Update. Create Create database Create table Create index – Primary – Secondary.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Create, Insert, Delete, Update. Create Create database Create table Create index – Primary – Secondary."— Presentation transcript:

1 Create, Insert, Delete, Update

2 Create Create database Create table Create index – Primary – Secondary

3 Insert insert into Guest (GuestNr, Name, StreetNr, City) values (107, “Smith”, “12 Maple”, “Providence”) insert into Guest values (107, “Smith” “12 Maple”, “Providence”) insert into RoomNameGuestNameSame select Room.Name from Room, Guest where Room.Name = Guest.Name assuming we have create table RoomNameGuestNameSame (Name char(20));

4 Delete delete from Guest where GuestNr = 107 delete from Reservation where ArrivalDate = “10 May”

5 Update update Room set Cost = Cost + Cost*0.1 where NrBeds = 2

Download ppt "Create, Insert, Delete, Update. Create Create database Create table Create index – Primary – Secondary."

Similar presentations

Chapter 4 Hotel (hotelno, hotelname, city)

Chapter 4 Hotel (hotelno, hotelname, city)
Updating Databases With Open SQL

Updating Databases With Open SQL
Chapter 3 - 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from disk cache or under a.

Chapter Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from disk cache or under a.
Table 6 8765 1 2 34 Table 7 8765 1 2 34 Table 8 8765 1 2 34 Table 9 8765 1 2 34 Table 10 8765 1 2 34 Table 5 8765 1 2 34 Table 4 8765 1 2 34 Table 3 8765.

Table Table Table Table Table Table Table Table
NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these.

NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these.
Chapter 10 - 1 Design Objectives Obtain the theoretically “best” design (normalize) –Remove redundancy and update anomalies –Remove nulls –Minimize the.

Chapter Design Objectives Obtain the theoretically “best” design (normalize) –Remove redundancy and update anomalies –Remove nulls –Minimize the.
1. What problems we would have during:  Insertion  Deletion  Update 2.

1. What problems we would have during:  Insertion  Deletion  Update 2.
XNF: 1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.

XNF: 1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.
Chapter 2 - 1 Abstraction Concrete: directly executable/storable Abstract: not directly executable/storable –automatic translation (as good as executable/storable)

Chapter Abstraction Concrete: directly executable/storable Abstract: not directly executable/storable –automatic translation (as good as executable/storable)
RECORD MODIFICATION AKSHAY SHENOY CLASS ID :108 Topic 13.8 Proffesor : T.Y Lin.

RECORD MODIFICATION AKSHAY SHENOY CLASS ID :108 Topic 13.8 Proffesor : T.Y Lin.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: 845-4259 Notes #6.

CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #6.
FileOrg: 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from under a read head –milliseconds:

FileOrg: 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from under a read head –milliseconds:
Chapter 10 - 1 Nested Schemes Flat schemes often have replicated data values. Nested schemes allow us to collapse some of these replicated data values.

Chapter Nested Schemes Flat schemes often have replicated data values. Nested schemes allow us to collapse some of these replicated data values.
Chapter 8 - 1 Specification Detailed and precise proposal for a system Provides the technical basis for a contract Typically increases understanding and.

Chapter Specification Detailed and precise proposal for a system Provides the technical basis for a contract Typically increases understanding and.
XNF-1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.

XNF-1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.
CostEst: 1 Cost Estimation Based on: –operations –file and record sizes –file structures –block layout on disk –caching scheme (in our simplified world,

CostEst: 1 Cost Estimation Based on: –operations –file and record sizes –file structures –block layout on disk –caching scheme (in our simplified world,
View Processing & Update. View Processing create view PresSuite as select * from Room where NrBeds = 2 select * from PresSuite p natural join Reservation.

View Processing & Update. View Processing create view PresSuite as select * from Room where NrBeds = 2 select * from PresSuite p natural join Reservation.
SQL Keys and Constraints Justin Maksim. Key Declaration Key constraint defined within the CREATE TABLE command Key can be declared using either the PRIMARY.

SQL Keys and Constraints Justin Maksim. Key Declaration Key constraint defined within the CREATE TABLE command Key can be declared using either the PRIMARY.
CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected.

CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected.
QueryRewriting: 1 Query Rewriting (for Query “Optimization”) Main Strategy: Make intermediate results small by applying selection and projection early.

QueryRewriting: 1 Query Rewriting (for Query “Optimization”) Main Strategy: Make intermediate results small by applying selection and projection early.

Similar presentations

Ads by Google