Domain constraints define the valid values and structure of an attribute. By specifying that an attribute must hold a single, atomic value, domain constraints effectively prohibit composite and multivalued attributes in a standard relational model.
In Relational Model, which type of constraint does not allow composite and multivalued attributes?
Asked in Programmer Exam 2024 · Topic: Basics of Computers and Information Technology (Database Management Systems (DBMS) Basics: Concepts, Types of Databases)
Show answer
Answer: B. Domain constraints
Read the notes: Basics of Computers and Information Technology →
More Information and Communication Technology questions
- Consider following two instances of relations X and Y – X Code Item 100 A 200 B 300 B 400 C Y Item Quantity A 5 B 6 C 3 How many total tuples a Cartesian product between the two relations X and Y will produce?
- Consider the following instance of a relation District - District Name Population JA 10 AJ 50 MM 5 Which of the District name will be returned by the following relational algebra expression? ($ \pi_{\text{Name}} (\sigma_{\text{Name}="Aj"} (\text{District}))) - [(\pi_{\text{Name}} (\sigma_{\text{Population}>5}(\text{District}))) \cap (\pi_{\text{Name}} (\sigma_{\text{Name} ="Aj"}(\text{District}))) ]$
- Consider a schema R (A, B, C, D) and functional dependencies A → B, C → D. Then, the decomposition of R into R1 and R2 where R1 (AB) and R2 (CD), is -
- Dependency Preservation A decomposition is dependency preserving if all original functional dependencies can be enforced on the decomposed relations. In this case, $A \rightarrow B$ is preserved in $R_1(AB)$, and $C \rightarrow D$ is preserved in $R_2(CD)$. 2. Lossless Join A decomposition is lossless if the original relation R can be perfectly reconstructed by joining the decomposed relations. A common condition for lossless join decomposition of R into $R_1$ and $R_2$ is that $R_1 \cap R_2$ must contain a superkey for $R_1$ or $R_2$. However, in cases where the dependencies are disjoint and correspond directly to the decomposed relations (as here), the decomposition is typically lossless even if the intersection is empty. The original relation R is effectively the Cartesian product of its projections onto the disjoint attribute sets, which is what $R_1 \bowtie R_2$ would represent in this case. 197. Consider following two instances of relation Student and Faculty with operation on these instances – Student Faculty (a) Student - Faculty (b) (Student ∩ Faculty) U (Faculty ∩ Student) (c) (Student U Faculty) - (Student ∩ Faculty) (d) Student ∩ Faculty Identify the correct option that produces equivalent output -
- ‘View’ in a database is -
- Consider Relations R1 and R2 as given below - R1 (P, Q, R) P Q R p q r k i j m q r d e f R2 (Q, R, S) Q R S q r n i c o q r a q r b e f g The number of tuples in output of R1 ⋈ R2 will be - - Question not attempted
- Consider below statements – (I) Each non- leaf node in B+ tree has between [n/2] and n Children, where n is fixed for a particular tree. (II) The search key of a clustering index is always primary key. (III) Secondary indices must be dense. (IV) In a dense index, an index entry appears for only some of the search-key values. Which of the above statements are true?
- Any relation that is not a part of the Logical Model, but is made visible to a user as a virtual relation is called a - - Question not attempted
All 1,360 Information and Communication Technology questions →