home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.databases.oracle
- Path: sparky!uunet!stanford.edu!ames!pasteur!olympus.CS.Berkeley.EDU!devine
- From: devine@olympus.CS.Berkeley.EDU (bob devine)
- Subject: Re: Oracle TPC Benchmarks and "discrete transactions"
- Message-ID: <1992Sep2.203212.22856@pasteur.Berkeley.EDU>
- Sender: nntp@pasteur.Berkeley.EDU (NNTP Poster)
- Nntp-Posting-Host: olympus.berkeley.edu
- Organization: University of California, at Berkeley
- X-Newsreader: Tin 1.1 PL3
- References: <wwknp=p.tcox@netcom.com>
- Date: Wed, 2 Sep 1992 20:32:12 GMT
- Lines: 22
-
- tcox@netcom.com (Thomas Cox) writes:
- : If dt's are useful in a TPC environment, then they will be useful in
- : those real world applications that resemble the TPC environment. If
- : there are no such applications, then the TPC is useless. Which position
- : are you taking?
-
- The discrete transactions that are in Oracle 7 are so constrained that
- they only seem good for TPC style uses. As to whether the TPC benchmark
- that Jim Gray developed is close to reality depends on your reality.
- For an OLTP system, maybe the constrained discrete transactions can
- be used (hard to say for the general case) but for complex queries
- it seems doubtful (full-blown transactions are needed there).
-
- The question of whether it is possible to invent a faster mechanism
- for special cases is a simple "of course it is possible!" But the
- question is still open about if the constrained mechanism is useful
- for more than a handful of cases. The IMS approach fastpath was
- useful, and in my first method I was agreeing that something similar
- could be usefully added to relational systems (though the more
- religious may brand that as heresy).
-
- Bob Devine
-