Name
Abstract | ||
|---|---|---|
Codd’s rule of entity integrity stipulates the existence of a primary key over every database table. That is, uniqueness and absence of null markers are enforced on the columns of the primary key. Key sets stipulate a generalized entity integrity rule that can be achieved on data sets where primary keys do not exist. Indeed, a key set means that different pairs of rows can be distinguished by unique non-null values on potentially different elements of the key set. While primary keys are a core feature of SQL databases, key sets have not been researched much at all. Our goal is to motivate the actual use of key sets in database systems. The use of key sets depends at least on the ability to identify those key sets that are meaningful in a given application domain, and to efficiently validate such key sets during the lifetime of the database. For this purpose, we analyze for the first time the performance of validating key sets in SQL experimentally, and also conduct experiments that provide insight on the time and size required to generate Armstrong relations for the implication of unary key sets by arbitrary key sets. Armstrong relations provide computational support for identifying key sets that are meaningful for a given application domain. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-12079-5_3 | australasian database conference |
Field | DocType | Citations |
Row,SQL,Uniqueness,Data mining,Data set,Unary operation,Computer science,Entity integrity,Theoretical computer science,Application domain,Table (database) | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhuoxing Zhang | 1 | 0 | 0.34 |
| Hong Zhang | 2 | 1 | 0.74 |
| Sebastian Link | 3 | 185 | 12.50 |