Question Answer We cannot update the schema after the creation of a database. A relational schema describes the data that is contained in a relational instance. The relational algebra operates on a single tuple. Every Join operation can be expressed as a combination of cross products and other basic operations. The SQL allows NULL on any attributes. The “group by" operation is used to generate ordered data. In the same database, two attributes cannot have the same name. We should set as much default constraints as possible to ensure the correctness of a table. A table can have, at most, two foreign keys. By default, the results of a SQL query are the unique values without duplicates.

Question Answer We cannot update the schema after the creation of a database. A relational schema describes the data that is contained in a relational instance. The relational algebra operates on a single tuple. Every Join operation can be expressed as a combination of cross products and other basic operations. The SQL allows NULL on any attributes. The “group by" operation is used to generate ordered data. In the same database, two attributes cannot have the same name. We should set as much default constraints as possible to ensure the correctness of a table. A table can have, at most, two foreign keys. By default, the results of a SQL query are the unique values without duplicates.

Database Systems: Design, Implementation, & Management

11th Edition

ISBN:9781285196145

Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Chapter10: Transaction Management And Concurrency Control

Section: Chapter Questions

Problem 1P

See similar textbooks

Similar questions

This question is related to the Database:- Suppose you are creating a database for a library management system. Explain how you would make a table for the "books" entity and insert some sample data, and then alter the table to add a new column for the "authorID" attribute and update "authorID" with some data. Finally, make a SQL query to retrieve all the books that were published after the year 2000. Note that this book schema has several columns, including "book_id" as the primary key, "title", "authorN", "publisher", "publication_year", "isbn", "language", and "num_pages". It also includes "available" column that is set to "true" by default and can be used to track the availability of the book. Please don't use handwriting...
Consider the following database in Prolog:birthday(tom).birthday(fred).birthday(helen),birthday(jack).happy(mary).happy(jane).happy(helen).happy(albert).attendparty(jane).attendparty(helen).hold_party(X): - birthday(X), happy(X) What would be the answer to the following query??- hold party(Who) a. Who = jane.b. Who = mary.c. Who = helen.d. All of the above.e. Who cannot be unified / instantiated.
The following SQL for a Point of Sale database for a grocery store is not properly constructed. As result, when student attempts to populate the tables, it gives a foreign key constraint fail error. Modify the SQL so that it models the depicted schema and follows the following constraints: They is a one-to-many relationship between the salesdetails.SalesNumber andsales.SalesNumber fields.  There is a one-to-many relationship between the products.prodid and salesdetails.prodid fields. There is to be a delete constraint on the product.prodid field a record in the product table should not be allowed to be deleted if they exist a matching prodid in the salesdetails table. Primary and foreign keys should be implemented in the appropriate tables. Referential Integrity should be enforce at the database level, where appropriate for example, if a sales record is deleted all associated records in the saledetails table should be deleted as well, etc. CREATE TABLE `products` ( `number`…
Consider a database that consists of the following relations.SUPpLIER(Sno. Sname)PART(Pno, Pname)PROJECT(Jno, Jname)SUPPLY(Sno, Pno, Jno)The database records information about suppliers, parts, and projectsandincludes a ternary relationship between suppliers, parts, and projects.Thisrelationship is a many-many-many relationships. Specify and execute thefollowingqueries using the relational algebraRetrieve the part numbers that are supplied to exactly two projects.b. Retrieve the names of suppliers who supply more than two parts toproject J11c. Retrieve the part numbers that are supplied by every supplier.d. Retrieve the project names that are supplied by supplier S1' only.e. Retrieve the names of suppliers who supply at least two different partseach to at least two different projects.
Write SQL queries for the designed database which will return: - All people on the same flight - All planes on the same destination - If the sum of all cargo weight on the plane is under a threshold.
Given the database schema R(A, B, C), and a relation r on the schema R, write an SQL query to test whether the functional dependency B → C holds on relation r. Also write an SQL assertion that enforces the functional dependency. Assume that no null values are present. (Although part of the SQL standard, such assertions are not supported by any database implementation currently.)
TRUE OR FALSE In the Relational Data Model, Referential Integrity Constraint is a special kind/case of Foreign Key Constraint. Multiple Inheritance happens when a class has more than one sub-class. This problem can be observed in Programming Languages as well. Given two relations named A and B, if we q-JOIN A and B, the maximum number of attributes in the result relation could be (the number of attributes of A) times(*) the number of attributes of B). * in an SQL SELECT statement means “all the tuples”. In relational algebra, Cartesian Product (X) can be implemented using the q-JOIN operator. Cartesian Product ISA q-JOIN where q-condition always evaluates to true. SQL is based on Predicate Calculus. A query in SQL always specifies what should be included in the query result.
Consider the bank database of Figure 5.21. Write an SQL trigger to carry outthe following action: On delete of an account, for each customer-owner of theaccount, check if the owner has any remaining accounts, and if she does not,delete her from the depositor relation
Q1:At this point, you have created a variety of database objects in your schema. Use an Oracle tool to identify all the direct and indirect dependencies on the BB_BASKET table, and produce dependency lists in two different formats. Identify each object as a direct or an indirect dependency, and describe the path of dependency for each indirectly dependent object.
For each of the following pairs of expressions, give instances of relations thatshow the expressions are not equivalent. σθ(E1 ⟕E2) and E1 ⟕σθ(E2), where θ uses only attributes from E2.
So SQL does not suppor functional depency constraints. However, if the database system supports constraints on materialized views and materialized views are maintained immediately, is it possible to enforce the functional dependency constraints in SQL? If it is possible, for a relation r(A,B,C), how can the constraints on materialized views be used to enforce a functional dependency, like B->A?
In terms of Big O notation, how long does it take for a database to execute a given query? I can handle just one more thing at this point. Can you tell me the total number of deletions that occur in a single operation? Anything, even if it were to be used for only one advertising. In response to a single online query?

SEE MORE QUESTIONS

Recommended textbooks for you

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning