Skip to search formSkip to main contentSkip to account menu

Compound key

Known as: Combination Primary Key, Composite key 
In database design, a compound key is a set of superkeys that is not minimal. A composite key is a set that contains a compound key and at least one… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Associative entityCandidate keyForeign keyRelational database

Broader (1)

Data modeling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
SHC: Distributed Query Processing for Non-Relational Data Store
We introduce a simple data model to process non-relational data for relational operations, and SHC (Apache Spark - Apache HBase… 
2015
2015
Test case selection for regression testing of applications using web services based on WSDL specification changes
There is much enthusiasm around web services in today's world. Web Services take the advantage of internet to communicate between… 
2015
2015
Designing Securely and Reliably Connected Wireless Sensor Networks
In wireless sensor networks, the $q$-composite key predistribution scheme is a widely recognized way to secure communications… 
2014
2014
Topological Properties of Wireless Sensor Networks Under the Q-Composite Key Predistribution Scheme With Unreliable Links (CMU-CyLab-14-002)
The seminal q-composite key predistribution scheme [3] (IEEE S&P 2003) is used prevalently for secure communications in large… 
2013
2013
Active key management scheme to avoid clone attack in wireless sensor network
In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such… 
2011
2011
A secure dominating set based routing and key management scheme in mobile ad hoc network
In Mobile Ad hoc Network (MANET) nodes communicate with each other using shared wireless medium. Due to their distributed nature… 
2010
2010
Perl Status Reporter (SRr) on Spatio-temporal Data Mining
Perl Status Reporter (SRr) [1] is a data mining tool and in this research work we illustrate the use of SRr on spatio-temporal… 
Highly Cited
2004
Highly Cited
2004
Composite key management for ad hoc networks
We present composite key management, a novel paradigm for key management in ad hoc networks. While most existing approaches try… 
1996
1996
Dynamic optimization of index scans restricted by Booleans
  • G. Antoshenkov
  • Proceedings of the Twelfth International…
  • 1996
  • Corpus ID: 8308420
When index retrieval is restricted to a range or singleton, an index scan is not done in its entirety because key portions before… 
1980
1980
Efficient Access of Compressed Data
In this paper a compression technique is presented which allows a high degree of compression but requires only logarithmic access… 
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)