Entry Chan:1994:TSC from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Chan:1994:TSC,
  author =       "Edward P. F. Chan",
  title =        "Testing satisfiability of a class of object-oriented
                 conjunctive queries",
  journal =      j-THEOR-COMP-SCI,
  volume =       "134",
  number =       "2",
  pages =        "287--309",
  day =          "21",
  month =        nov,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:34 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=2&aid=1656",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4250 (Database
                 theory); C6160J (Object-oriented databases)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; conjunctive queries;
                 database theory; decidability; exponential-time
                 algorithm; high-level declarative query languages;
                 inheritance; inheritance hierarchy; intractability;
                 non-unique attribute types; NP-complete problem;
                 object-oriented conjunctive queries; object-oriented
                 database; object-oriented databases; polynomial time;
                 query execution plan; query languages; query
                 processing; satisfiability; satisfiability problem;
                 single-inheritance database schemas; typing
                 constraints; unique-typed conjunctive queries",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries