Entry Saiedian:1996:EAC from compj.bib

Last update: Sun Nov 30 02:31:30 MST 2003                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Saiedian:1996:EAC,
  author =       "Hossein Saiedian and Thomas Spencer",
  title =        "An efficient algorithm to compute the candidate keys
                 of a relational database schema",
  journal =      j-COMP-J,
  volume =       "39",
  number =       "2",
  pages =        "124--132",
  month =        "????",
  year =         "1996",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620",
  bibdate =      "Wed Jul 21 09:54:45 MDT 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/Volume_39/Issue_02/Vol39_02.index.html",
  URL =          "http://www.oup.co.uk/jnls/list/comjnl/hdb/Volume_39/Issue_02/390124.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/Volume_39/Issue_02/Vol39_02.body.html#AbstractSaiedian",
  acknowledgement = ack-nhfb,
  classcodes =   "C6160D (Relational databases); C4250 (Database
                 theory); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Nebraska Univ., Omaha, NE,
                 USA",
  email-1 =      "hossein@cs.unomaha.edu",
  keywords =     "attribute graphs; attributes; candidate key
                 computation; database schema; database theory;
                 efficient algorithm; functional dependencies;
                 generalized algorithm; graph theory; relational;
                 relational databases",
  treatment =    "T Theoretical or Mathematical",
}

Related entries