Let k=2 in the k-Anonymity model. Suppose we have the following database table,RaceBlackBlackBlackProblemshort breathchest painbypertensionhypertensionobesitychest painchest painobesityshort breathchest painBirth1965GenderZIP0214*0214*0213*196519651965Black0213*BlackBlackWhiteWhite196402131964196419641964T967f0213*0213*m0213*White0213*White0213Choose the correct answer below,We can build a 2-Anonymity model based on the table.We cannot build a k-Anonymity model, when k>=2, based on the table.We cannot build any k-Anonymity model based on the table.None of the above.

Definition of K-anonymity : " Let R(A1,...,An) is a table and QIR is the quasi-identifier of the…

Let k=2 in the k-Anonymity model. Suppose we have the following database table, Race Black Black Black Black Black Black White White Problem Birth 1965 1965 1965 1965 1964 1964 Gender ZIP 0214 short breath 0214* 0213 bypertension 0213* 0213 |chest pain hypertension obesity chest pain chest pain 0213* 1964 0213 0213 obesity 0213 im 1964 m short breath chest pain White 1964 White 1967 0213 Choose the correct answer below, O We can build a 2-Anonymity model based on the table. We cannot build a k-Anonymity model, when k>=2, based on the table. We cannot build any k-Anonymity model based on the table. None of the above.

Let k=2 in the k-Anonymity model. Suppose we have the following database table, Race Black Black Black Black Black Black White White Problem Birth 1965 1965 1965 1965 1964 1964 Gender ZIP 0214 short breath 0214* 0213 bypertension 0213* 0213 |chest pain hypertension obesity chest pain chest pain 0213* 1964 0213 0213 obesity 0213 im 1964 m short breath chest pain White 1964 White 1967 0213 Choose the correct answer below, O We can build a 2-Anonymity model based on the table. We cannot build a k-Anonymity model, when k>=2, based on the table. We cannot build any k-Anonymity model based on the table. None of the above.

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

The consistency of a set of formulas can be defined as: Select one or more: a. There is at least one model for the set. b. There is at least one interpretation on which all the formulas are true. c. There is an interpretation yielding a truth value for all of the formulas in the set. d. There is an interpretation on which some of the formulas are true. e. All of the formulas can be false at the same time.
One of the solutions to the deadlock in the dining-philosophers problem is by allowing at most three philosophers to be sitting simultaneously at the table TRUE FALSE
4. Jack and Jim are described by 5 symmetric binary attributes A1, A2, A3, A4, and A5 that can take yes and no values. Jack's values are No, No, Yes, No, No, whereas Jim's values are No, No, Yes, Yes, No. Their distance is: Group of answer choices 0 0.2 0.5 1
Consider a database with objects X and Y and assume that there are two transactions T1 and T2. Transaction T1 reads objects X and Y and then writes object X. Transaction T2 reads objects X and Y and then writes objects X and Y. 1. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a write-read conflict. 2. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a read-write conflict. 3. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a write-write conflict.
A transaction database contains ten transactions shown below and minimum_support = 30%. Using A-priori, find all frequent itemsets that contain item i. How many frequent itemsets that contain i do we have? TID Items bought { s, u, s, a, n} { s, a, r, a} { s, a, m} 1 2 3 {r, i, c, h, a, r, d} {e,r, i, c} {n, i, c, k} {p, a, t, r, i, c, k} {e, m, i, 1, y} {c,h, a, r, l, e, s} 6. 7 8 9. 10 [lidal
Styles Consider the following database instance. Table name: Students Primary key: sid Sid udej6 sname Ricky Ellen 2. 6. 4 MaryLou Ellen Table name: Courses Primary key: cid cid C1 cname ICS Finance 2. Table name: Register Primary key: sid.cid Foreign key: sid references Students(sid) Foreign key: cid references Courses(cid) sid cid 2 2. 1 1 5.1) For each of the following statements, show whether the statement is correctly executed or not (assume that the statements are executed in order, which means that if a statement is correctly executed, its effect is reflected in the following statement). If you say the statement is not executed, explain why. INSERT INTO Students VALUES (3, Ellen'); b. INSERT INTO Students VALUES (6, Ellen'); DFocL 727
Consider an airport management system. Each airport has a unique id (e.g. Montreal:YUL). Let us introduce the types AIRPORT and CITY . We also introduce variable airports that contains associations between airport id’s and their corresponding host cities. A possible state of the system is shown below:airports ={YUL → Montreal,LCY → London_UKLHR → London_UK,MIL → Milan,SFO → San_Francisco,SDQ → Santo_Domingo}1. (PROGRAMMING) Define global variable airports in Common LISP and populate it with the above data. Demonstrate that the variable indeed contains the ordered pairs as shown above.2. Provide a declaration of variable monitored that holds all airport id’s.3. What kind of variable is airports? Provide a formal definition together with any and all applicable properties.4. Describe what data structure you would deploy to model variable airports. Note that you may not use a Dictionary. Should this be an ordered or an unordered structure? Discuss.5. Provide a formal specification of the…
The default cutoff value in the two-class classifier (i.e., C1/C2) is 0.5. Thus, if the probability of a record being a class C1 member is greater than 0.5, that record is classified as C1. It is possible to use a cutoff that is greater or lower than 0.5. In general, lowering the cutoff value will result in a decrease (no change) in the classification error rate for records that are truly C1. Note that is not an overall error rate. True False
1. Given the following hash function for storing records on courses:f(title) = ASCII value of first character in the title - 64Example: f(Biology I) = 66 – 65 = 1 (ASCII value of B is 66) a. Explain why this is or is not a good hash function.b. What improvement(s) could be made? 2. Assume that the hash function is: f(key) = key % Ba. What is the problem if B is too small?b. What is the problem if B is too large?c. What is the big-0 run-time if there are n records?d. What does the run-time for a find, insert, and delete each approach as B gets verylarge?
2. For a transaction database such as follows, there exists a hierarchy on categories of items: TID Items apple, lamb, rice apple, sugar, rice beef, rice, apple apple, pear, sugar rice 100 200 Fruit Food 300 аpple рear meat rice sugar 400 500 lamb beef apple, pear beef, rice 600 700 (a) Find all frequent itemsets using the basic algorithm given in the lecture (minimum support = 3 transactions). (b) Generate all generalised association rules (minimum confidence = 90%)
People connect with each other in a social network. A connection between Person and Person is represented as . When two persons belonging to different communities connect, the net effect is the merge the communities which and belong to. At the beginning, there are people representing communities. Suppose person and connected and later and connected, then ,, and will belong to the same community. There are two types of queries: communities containing persons and are merged if they belong to different communities. print the size of the community to which person belongs. Input Format The first line of input contains 2 space-separated integers and , the number of people and the number of queries.The next lines will contain the queries. Constraints Output Format The output of the queries. Sample Input STDIN Function ----- -------- 3 6 n = 3, q = 6 Q 1 print the size of the community containing person 1 M 1 2 merge the communities containing…
Schnorr's Zero Knowledge ID. Prime modulus of 9257 and Generator of 17, Alice claims the ID 5117 is hers. She provides a commitment (t) of 7799. We send a challenge (c) of 679 to Alice. She sends a response (s) of 7787. Is she the owner of the ID? What left and right values did we calculate? Question 14 options: 3424 and 3232 1238 and 1230 54354 and 7787 4833 and 4833