Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,289,924 papers from all fields of science
Search
Sign In
Create Free Account
Superkey
Known as:
Super-key
, Superkey (Template)
A superkey is defined in the relational model of database organization as a set of attributes of a relation variable for which it holds that in all…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Boyce–Codd normal form
Candidate key
Cardinality (data modeling)
Compound key
Expand
Broader (1)
Data modeling
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Minimum Cost Routing Based on Network Coding in Wireless Mesh Networks
X. Shen
,
Zhigang Chen
,
Ying Guo
,
Hui Ye
International Conference on Multimedia Technology
2010
Corpus ID: 60678962
Wireless mesh networks can significantly improve the transmission performance of multi-hop links by using network coding. Thus, a…
Expand
2010
2010
Efficient date-constraint access control and key management scheme for mobile agents.
Y. Chung
,
T. Chen
,
陳澤雄
2010
Corpus ID: 18883447
A mobile agent has become a competent software nowadays because of its significant abilities. It can roam freely in different…
Expand
2009
2009
Efficient migration access control for mobile agents
Y. Chung
,
Tzer-Shyong Chen
,
Ming-Wei Lai
Comput. Stand. Interfaces
2009
Corpus ID: 20949632
2007
2007
Foreign Superkeys and Constant References
J. Heggland
International Database Engineering and…
2007
Corpus ID: 2615711
A foreign superkey in relational database theory is a set of attributes referring to a superkey of some relation variable. In…
Expand
2005
2005
Cryptography Based on Chaotic Synchronization: round Iii
P. Vaidya
,
S. Anand
IACR Cryptology ePrint Archive
2005
Corpus ID: 12198337
This paper discusses cryptography based on the property of chaotic synchronization. Specifically, it is about Round III of such a…
Expand
2004
2004
Incremental Maintenance of Data Warehouses Based on Past Temporal Logic Operators
S. D. Amo
,
Mirian Halfeld-Ferrari
Journal of universal computer science (Online)
2004
Corpus ID: 1526319
We see a temporal data warehouse as a set of temporal views defined in the past frag- ment of the temporal relational algebra…
Expand
2003
2003
Optimal Tuple Merge is NP-Complete
Edward L. Robertson
,
C. M. Wyss
2003
Corpus ID: 14687599
The Optimal Tuple Merge (OTM) problem arises within the context of relational query language extensions to query and manipulate…
Expand
1992
1992
Conditions of efficient updates on network structures
S. Konomi
,
T. Furukawa
,
Y. Kambayashi
Systems and Computers in Japan
1992
Corpus ID: 6858684
Redundant network structures allow efficient retrievals. Procedures to design network structures that allow efficient retrievals…
Expand
1991
1991
Updating duplicate values in distributed multidatabase systems
S. Konomi
,
T. Furukawa
[] Proceedings. First International Workshop on…
1991
Corpus ID: 834232
Redundant data for fast retrieval increase costs of updates in distributed multidatabase systems. In this paper, costs of updates…
Expand
1990
1990
Using CAT ME with SuperKey
Joan W. Hayes
1990
Corpus ID: 62137702
Describes the use of Cataloguing Micro Enhancer (CAT ME) software in combination with a program called SuperKey in order to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required