Suppose relation R(A,B,C,D) exists with no functional dependency. So what should be considered as its candidate key? Clearly any individual attribute or proper subset of all attributes cannot be a candidate key because by no means they can identify non prime attributes. So can ABCD be considered as candidate key? Or this relation will not have any candidate key?
Can trivial superkey be considered as candidate key?
823 Views Asked by Mohit Jain At
1
There are 1 best solutions below
Related Questions in DATABASE
- When dealing with databases, does adding a different table when we can use a simple hash a good thing?
- How to not load all database records in my TListbox in Firemonkey Delphi XE8
- microsoft odbc driver manager data source name not found and no default driver specified
- Cloud Connection with Java Window application
- Automatic background scan if user edit column?
- Jmeter JDBC Connection Configuration Parametrization of Database URL for accessing SQL Database
- How to grant privileges to current user
- MySQL: Insert a new row at a specific primary key, or alternately, bump all subsequent rows down?
- Inserting and returning autoidentity in SQLite3
- Architecture: Multiple Mongo databases+connections vs multiple collections with Express
- SQL - Adding a flag based on results within a query - best practice?
- Android database query not returning any results
- Developing a search and tag heavy website
- Oracle stored procedure wrapping compile error with inline comments
- Problems communicating with mysql in php
Related Questions in DATABASE-DESIGN
- Big data with spatial queries/indexing
- Unique hash/index for time interval
- Best practices for creating a huge SQL table
- Database Design: How should I store user's news preferences in MySQL database?
- Is it recommended to use Node.js for an online room booking web application?
- Storing multiple item settings in database
- Which column type for storing the year field in a table with rows of yearly data
- Best way to setup a i8n in a database
- Database normalization for electricity monitoring system
- Database Design: Unique Billing Assocation
- Is it always a bad practice to have circular relationships in your database design
- One column maps to mutiple columns from different table
- Replicating tables within the database
- mysql one translates table vs multiple translate table
- Nosql database design for complex querying
Related Questions in KEY
- Android Signature key differences between Old and New PC
- Java HashMap, hashCode() equals() - how to be consistent with multiple keys?
- Kaltura account settings error
- fetch json value with no key using jquery
- C++ Custom std::map<> key class causing memory violation
- How do I use php file() to access an array and echo specific keys?
- constructing key by bit shifting 3 integers in C
- How to get keystrokes with java outside of frames
- Keys in Perl hash disappeared
- Master Array compare csv
- Covering index and getting rid of Key Lookup
- How to add key pairs to object literals using loop--WITHOUT overriding existing entries?
- PHP Convert Array Including Key Rename
- Python: How to append to existing key of a dictionary?
- Python key error - for key in dictionary: dictionary[key]
Related Questions in CANDIDATE-KEY
- How can I find candidate key using FD.S?
- Functional Dependencies and Candidate key
- Confused about third normal form: a table having more than one candidate key
- How to implement priorities in SQL (postgres)
- Table with unique identifier in Third normal form?
- 2nd Normal Form understanding candidate key
- Normal forms - 2nd vs 3rd - is the difference just composite keys? non trivial dependency?
- Candidate Key Identification with Functional Dependencies
- Is normalisation done on the primary key or on the candidate keys?
- Maximum number of candidate keys may have
- Finding all possible candidate keys from a set of superkeys?
- Finding candidate keys for given relation
- Can trivial superkey be considered as candidate key?
- Definition for relation to be in 3NF using canonical cover
- What is the best way to choose primary key in candidate key?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Yes, the key1 is comprised from all attributes together.
This is quite rare in practice, though. It mostly happens with junction/link tables that implement many-to-many (or many-to-many-to-many etc.) relationship.
A relation must have at least one key, otherwise it's not a relation2.
Relation is a set, and any given object either belongs to a set or doesn't - it cannot belong multiple times (unlike for multiset). Without at least one key, the same tuple would be able to belong multiple times.
1 Just saying "key" is synonymous with "candidate key".
2 At the very least, all attributes, taken together, can be considered a key (as in your case).