Searching for "On the Number of Candidate Keys." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

A Generic Load/Extract Utility for Data Transfer Between XML Documents and Relational Databases
by Bourret Bornhovd Buchmann — 2000
…Class KeyInParentTable=“Candidate”> <CandidateKey Generate=“No”> Number…
Add To MetaCart

Observed Idiosyncracies of Relational Database Designs
by Michael Blaha, William J. Premerlani — 1995 — In Second Working Conference on Reverse Engineering (WCRE-95
… {Candidate key of Bank is: bank name.} {Candidate key of Account is: bank ID + account number.} {Candidate…
Cited by 15 (0 self) – Add To MetaCart

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval
by Gleb Skobeltsyn, Toan Luu, Ivana Podnar ˇ Zarko, Martin Rajman, Karl Aberer — 2007 — In Infoscale
… on the subsumption property of the DKs to further reduce the number of candidate keys. If a key k1 contains a…
Cited by 4 (2 self) – Add To MetaCart

A New Approach for Mining Frequent K-itemset
by H. Ravi Sankar, M. M. Naidu
… itemsets to generate candidate keys for the next iteration. It is expensive to generate a huge number…
Add To MetaCart

An expertise recommender using web mining
by Anupam Joshi, Purnima Ch, Michelle Shu Yang, Ramya Ramakrishnan — 2001 — In Proceedings of AAAI 14th Annual International Florida Artificial Intelligence Research Symposium. American Association for Artificial Intelligence
…. This further reduces the number of candidate key words. TFIDF then determines the occurrence of the words…
Cited by 2 (0 self) – Add To MetaCart

The candidate key protocol for generating secret shared keys from similar sensor data streams
by Rene Mayrhofer — 2007 — In: Proc. ESAS 2007, Springer-Verlag
… numbers �ML a of round �ra from LHa to MCa,b round �r b from LHb to MCb,a II.1.Generate candidate key…
Cited by 1 (1 self) – Add To MetaCart

Gordian: efficient and scalable discovery of composite keys
by Yannis Sismanis, Paul Brown, Peter J. Haas, Berthold Reinwald — 2006 — In Proc. International Conference on Very Large Data Bases (VLDB
… that the number of candidate keys is 250 − 1. Even if we argue that most interesting keys are composed of at most…
Cited by 3 (0 self) – Add To MetaCart

Lessons from the Norwegian ATM System User Authentication
by unknown authors
… the number of candidate keys they must try to 2 55 on average. Step 2—Determining a PIN Following step 1…
Add To MetaCart

Video Summarization Using Mpeg-7 Motion Activity And Audio Descriptors
by Ziyou Xiong, Ajay Divakaran, Ajay Divakaran, Kadir A. Peker, Kadir A. Peker, Regunathan Radhakrishnan, Regunathan Radhakrishnan, Romain Cabasson, Romain Cabasson — 2003 — ISO/IEC 21000-7 FDIS, "Information Technology - Multimedia Framework - Part 7: Digital Item Adaptation
… both contain the same number of key frames, then our hypothesis is that if the intensity of motion…
Cited by 1 (0 self) – Add To MetaCart

Ca-ram: A high-performance memory substrate for search-intensive applications
by Sangyeun Cho, Joel R. Martin, Ruibin Xu, Mohammad H. Hammoud, Rami Melhem — 2007 — IEEE ISPASS
…-RAM will be close to that of the memory array used. At the same time, by performing a number of candidate key…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB