This example creates a table with three hash partitions:
create table mysalesdetail (store_id char(4) not null, ord_num varchar(20) not null, title_id tid not null, qty smallint not null, discount float not null) partition by hash (ord_num) (p1 on seg1, p2 on seg2, p3 on seg3)
Hash-partitioned tables are easy to create and maintain. Adaptive Server chooses the hash function and attempts to distribute the rows equally among the partitions.
With hash partitioning, all rows are guaranteed to belong to some partition. There is no possibility that inserts and updates will fail to find a partition, which is not the case for range- or list-partitioned tables.
| Copyright © 2005. Sybase Inc. All rights reserved. |
|
|
