Details of the effects of various locking patterns in databases?

I am testing various locking schemes for a large table, more than 4 million rows and is expected to grow to 10 million.

My experience with SyBase:
ALLPAGES, very slow BCP (in) and updating with a field belonging to the first key.
DATAROWS, fast BCP, quick update for fields in the PC, quick selection.
DATAPAGES, the fastest BCP and update, and choose faster than ALLPAGES, but not as fast as DATAROWS.

I am not an expert, but it seems to me that DATAROWS blocks more than DATAPAGES, and I did not see any flaws with DATAPAGES.

The only point in favor of DATAROWS that I could find was a slightly higher performance when choosing using a primary key, but DATAPAGES is much faster when upgrading.

Any experience in practice?
How do these blocking schemes compare?
Pros / cons of each?

I tried to read about this theory, but it is not very clear to me.

+5
source share
1 answer

- concurrency. . , , , , BCP.

, ,

, datarows,

(, ), serializable read

datarows datapages - .

0

All Articles