COMPUTER SCIENCE QUESTION Consider the transaction database represented by the matrixD:I1I2I3I4I6T1111T211T3111T411T51111Determine the confidence of the association rule A = B, whereA = {I¡} and B = {I2}Write your answer as a percentage value, i.e. a number in [0, 100]. Round your answer to thenearest integer.

Introduction:- Union(U):-Let where 'S' is the set of sets and A,B,C are sets.…

Answered: Consider the transaction database…

Engineering

Computer Science

Consider the transaction database represented by the matrix

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Now lets consider designing a database for the a car lot. Consider the following statements -> Our car lot sells many cars every month (we have a big inventory) Our car lot has many customers (everyone loves us!) Our car lot has many sales persons (we are ready to help our customers) Each car sale persons sells many cars a week (our prices are great) Our car lot provides many mechanical services (all our mechanics are experts) Our Service department has many mechanics (any mechanic would love to work here) Our mechanics provide service to our customers (our repeat business is awesome) Examine the above information and determine the Entities. With each entity - determine some attributes for each entity. As a note - is there any information in the above statements that is not helpful for our database design? Now lets consider our Car Lot database design and determine the relationship of our Entities Using LucidChart or similar tool (Visio) to construct an ERD…
To access a database, we need to open a connection to it first and close it once our job is done. Connecting to a database depends on the type of the target database and the database management system (DBMS). For example, connecting to a SQL Server database is different from connecting to an Oracle database. But both these connections have a few things in common: •They have a connection string •They can be opened•They can be closed•They may have a timeout attribute (so if the connection could not be opened within the timeout, an exception will be thrown).Your job is to represent these commonalities in a base class called DbConnection. This class should have two properties: ConnectionString : stringTimeout : TimeSpanA DbConnection will not be in a valid state if it doesn’t have a connection string. So you need to pass a connection string in the constructor of this class. Also, take into account the scenarios where null or an empty string is sent as the connection string. Make sure to…
Problem 8-10 use the same database. Let a database application have the following entities Sales = (Customers, Salesperson, Retail Order, Items), which contains the information that a salesperson sells multiple items (tables, computers,...) to customers. There are many customers. There are many salesmen. There are many items. For example, John sells to Joe, Smith sells to Jane, The "Salesperson" will sale many times. The "Customer" can come back and buy items many times The "Retail Order" specifies which Salesperson sell to which customer. In each "Retail_Order", many items (tables, computers,...) can be sold Hint: This is very similar to one of your homework What is the relationship between Retail_Order and Items? One-to-many relationship None of the above One-to-one relationship Many-to-many relationship
Consider an employee database with two relationsemployee (employee_name, street, city)works (employee_name, company_name, salary) where the primary keys are underlined. Write a function avg_salary that takes a company name as an argument and finds the average salary of employees at thatcompany. Then, write an SQL statement, using that function, to find companieswhose employees earn a higher salary, on average, than the average salary at“First Bank”.
Let D be a database of the patients with only two columns. The dataset has been encrypted as follows: 1. Column 1 contains patient ids are unique in the entire column. 2. Column 2 contains the disease name. A disease name can appear in multiple rows. In other words, two or more patients can have the same disease. The above database is secured using the technique of accumulating automata (i.e., the technique for searching over secret shared datasets) We are allowed to execute only some fixed (say 10) queries over this table and all such queries are for fetch operation. In other words, we are allowed to execute only 10 selection queries on this table. This question has two parts, as follows: a. Does the above-mentioned scheme is IND-CKA1 secure. b. Justify your answer. a. If you think that the scheme is IND-CKA1 secure, prove this. OR b. If you think that the scheme is not IND-CKA1 secure, prove this.
This problem is concerned with modeling of a database that contains information about employees of academic institutions. A employee can either be a professor or a lecturer. _ For each employee, his/her id, name and year of birth. _ For each institution, its name, country, and inauguration year. _ For each institution, the names of its schools (e.g. School of Business, School of Computer Science,. . .). A school belongs to exactly one institution. _ Information about authorships, i.e., which employee have authored a research paper. The titles, ids of research papers should also be stored. _ For each employee, information on his/her highest degree (BSc, MSc or PhD), including who was the main supervisor (must be a professor), and at what school. _ For each lecturer, information on the total number of courses he/she has taught. _ For each professor, information on his/her title and research projects (title, start date, end date and the amount of grant money) in which…
Imagine a database of students where the StudentID is the main key, and there are other indexes on Major, Age, Marital Status, and HomeZipCode (all secondary keys). Let's assume the institution wanted a list of MIS or computer science majors who were over 25 and married and were from the 45462 postcode code OR computer engineering majors who were single and were from the 45462 zip code. In any case, they wanted the list to come from the 45462 zip code. How can indexes be used to guarantee that individuals will only have access to the info that fulfills this prerequisite?
For the relational algebra queries, you can cut and paste the following as needed into your answer: p subscript (A) σ subscript (A) A ⋈ subscript B ρ (A(1→stuff), B) A ∩ B A U B symbol subscript1 ≤ subscript2 ˄ subscript3 ≥ subscript4 ˅ subscript5 < > subscript6 Consider the following database schema: Flights(flno, from, to, distance) Aircraft(aid, aname, cruisingrange) Certified(eid, aid) Employees(eid, ename, salary) In the above schema, Employees describes all employees, while Certified represents the fact that a given employee is certified to fly a given aircraft. Thus, all employees who are pilots will be listed in Certified (and no other employees will). An aircraft is able to fly a given flight if the aircraft’s cruisingrange is at least as great as the flight’s distance. a) Express the following query in both (i) Relational Algebra and (ii) SQL: Find the departure airport (from) and arrival airport (to) of flights that are able…
A database has four transactions. Let min_sup 60% and min_conf = 80%. TID Date Items Bought {K, A, B, D} 10/15/2018 (D, A, C, E, B} {С, А, В, E) (В, А, D} 100 10/15/2018 200 300 10/19/2018 400 10/22/2018 Find all frequent items using Apriori and FP-growth respectively. Compare the efficiency of the (i) two meaning process.
This is done with xampp mysql. Database: theatre(theatre_name[pk], City, Phone, Owner_SSN[pk, fk]) movie(movie_name[pk], Genre, Country) viewer(SSN[pk], Name, Birthyear, Fav_movie[fk], Gender) likes(SSN[pk, fk], movie[pk, fk]) shows(theatre[fk], movies[fk]) owner(SSN[pk], Name, City, Address, Phone) List the name and phone number of all owners who do not show "Forrest Gump" in their theatres.
This is done with xampp mysql. Database: theatre(theatre_name[pk], City, Phone, Owner_SSN[pk, fk]) movie(movie_name[pk], Genre, Country) viewer(SSN[pk], Name, Birthyear, Fav_movie[fk], Gender) likes(SSN[pk, fk], movie[pk, fk]) shows(theatre[fk], movies[fk]) owner(SSN[pk], Name, City, Address, Phone) List the movie names showed by at least one theatre and liked by at least one viewer.
Suppose you are asked to design a club database system based on the following information. Each student has a unique student id, a name, and an email; each club has a unique club id, a name, a contact telephone number, and has exactly one student as its president. Each student can serve as a president in at most one of the clubs, although he/she can be the members of several clubs. Clubs organize activities and students can participate in any of them. Each activity is described by a unique activity id, a place, a date, a time and those clubs that organize it. If an activity is organized by more than one club, different clubs might contribute different activity fees.QuestionDraw an E-R diagram for the system according to the above description.