Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
![]() |
![]() |
Home -> Community -> Usenet -> c.d.o.misc -> Re: Tables Partitioned by Range and Updating Data
In article <68sbjp$b9q_at_mtinsc05.worldnet.att.net>, sameerm_at_worldnet.att.net said...
> I am not really sure that ur talking here about Oracle 8 Table
> partitioning.
>
> In case ur on Oracle 7.3 then u can make use of Partitioned Views.
I am still in Oracle 7.3 right now, but I am evaluating this as a reason to switch over to Oracle 8.
> Partitioned views allow u to spread the data from a single table across
> multiple tables. The tables can be queried in a single qurey by using the
> union operator.
Yes, but if you create a view by unioning two tables you will have no indices. I am dealing with potentially millions of rows here so that is not an option.
> In case ur on Oracle 7.3.x then user the check contraint definition on the
> partition tables to determine which tables might participate in the query.
> The 7.3 optiomizer is smart enought to realized which partition table to
> look into base on the constraint. Note: To enable partition elimination,
> set the PARTITION_VIEW_ENABLED parameter to TRUE in ur database's init.ora
> file.
>
> In case ur talking about 8. I think it could be an over kill since in 8 u
> can split a single table itself into multiple partition based on
> contraints. Each partition can reside in a different tablespace (if my
> understanding is correct, pl. verify) itself. So if u would do an update
> internal it would result in a insert to the destination and delete from the
> origination partition. As u have correctly stated.
Are you sure about this? If that is the case will it be slow if I update the row such that it has to be moved from one partition to the other?
> Partitioning view I guess should keep every one happy in case ur on 7.3 or
> higher. Plus I guess all ur schema's are in the same instance (ur not using
> and dblinks).
It won't keep me happy if it is slow as molasses.
![]() |
![]() |