[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference ulysse::rdb_vms_competition

Title:DEC Rdb against the World
Moderator:HERON::GODFRIND
Created:Fri Jun 12 1987
Last Modified:Thu Feb 23 1995
Last Successful Update:Fri Jun 06 1997
Number of topics:1348
Total number of notes:5438

503.0. "Oracle can be hierarchical?" by MLN08::SCAGLIONI (JF from SWAS Milan not a Ferrari owner) Wed Nov 22 1989 17:39

	Hi, everybody

	I gathered from unofficial sources that ORACLE can be structured

	as a hierarchical DBMS to speed up the relational engine: is

	this true ?

	We are in competition with ORACLE at a customer site to solve

	a BOM application.

	I think that if what I heard is true this could be used againist

	us in this type of application.


	Am I correct ?

				Thanks in advance 

					Gianfrancesco.
 
T.RTitleUserPersonal
Name
DateLines
503.1We Should Win EasilyMAIL::DUNCANGGerry Duncan @KCOWed Nov 22 1989 18:3024
>>	I gathered from unofficial sources that ORACLE can be structured
>>	as a hierarchical DBMS to speed up the relational engine: is
>>	this true ?

    They can do record clustering which could be construed to be
    hierarchical.  This very similar to Rdb's mixed page support which
    allows the same, but better functionality due to the availability
    of hash keys in Rdb.

        
>>	We are in competition with ORACLE at a customer site to solve
>>	a BOM application.
>>	I think that if what I heard is true this could be used againist
>>	us in this type of application.

    Actually, we should win because we can do the same functionality.
    We have an advantage because we have has indexes, horizontal table
    partioning, triggers, and the ability to tweek the physical design.
    We also win because we have a cost based optimizer and Oracle does
    not.


    -- gerry 
    
503.2Triggers ?MLN02::SCAGLIONIJF from SWAS Milan not a Ferrari ownerThu Nov 23 1989 10:4814
	Thanks for your quick reply Gerry,
 
    	I think that triggers are available ( cascading deletions ) in V3.1

	but is not officially shipped so far.


	This feature could help us in this competition.

			Thanks again

				Gianfrancesco.

503.3ORACLE and BOMVNASWS::EDERGottfried Eder, ACT ViennaThu Nov 23 1989 11:1313
I can hardly be described as a promoter of Oracle, but Oracle does have a very
nice feature allowing the traversal of the transitive closure of a relation,
which is what you need to do for BOMs. To do the same requires very clumsy
programming in standard SQL, say. I'm not sure recursive programs work
with our SQL precompilers or module language. I do know they didn't with the
RDBPRE precompilers.

So from a syntactical point of view, Oracle is superior. I think the right 
strategy against them is to question performance (as previous notes have), 
showing what hashing can do for us, and explain that theirs is a completely
proprietary SQL extension.

	Gottfried
503.4CONNECT BYHSOMAI::STOUTMon Nov 27 1989 22:275
    The extension to ORACLE's SQL*PLUS is the CONNECT BY clause.  It does
    reduce the amount of work required to program applications such as BOM,
    but the performance is indeed very bad.
    
    Dale
503.5I'd appreciate if you took the time...WIBBIN::NOYCEBill Noyce, FORTRAN/PARALLELTue Nov 28 1989 15:383
    Could someone post an example program to print a BOM explosion using
    ORACLE's CONNECT BY clause?  I'd just like to understand what it
    does, and how.