Fujitsu UDS/SQL V2.5 Benutzerhandbuch
SSL
Linkage methods
U929-J-Z125-9-76
155
D
ok
us
c
h
abl
on
en
1
9x
24 V
e
rs
ion
7
.3
us
f
ü
r F
ram
eM
ak
er
V
7
.x
v
o
m
1
4.
02
.2
00
7
©
c
o
gni
tas
Gm
b
H
20
01-
20
07
24
. Ok
tobe
r 20
07
S
ta
nd
0
8:
58
.5
5
P
fa
d:
G
:\
v
og
t\
fs
c
\ud
s
\M
anu
al
e
\e
n\
ud
s
e
nt
_e\
u
ds
ent
.k
0
5
Chain
●
Sequential access
When records are processed in their logical order, a maximum of one disk access for
each member record is required. The number of accesses can be considerably reduced
by optimizing the placement of the records (see
each member record is required. The number of accesses can be considerably reduced
by optimizing the placement of the records (see
). If the logical order is not
adhered to, UDS/SQL will normally have to search large parts of the set occurrence
which may involve a large number of disk accesses. It should be noted that for reading
a preceding record UDS/SQL must search the set occurrence from the beginning
unless backward chaining has been specified.
which may involve a large number of disk accesses. It should be noted that for reading
a preceding record UDS/SQL must search the set occurrence from the beginning
unless backward chaining has been specified.
If the physical placement of the records changes frequently (e.g. if member records for
a different set are stored as a list), it is advisable to perform occasional reorganization
runs in order to keep the PPPs current (see the "
a different set are stored as a list), it is advisable to perform occasional reorganization
runs in order to keep the PPPs current (see the "
" manual, BREORG).
●
Direct access
–
ORDER IS SORTED INDEXED:
Analogous to direct access in pointer array.
Analogous to direct access in pointer array.
–
ORDER IS LAST/FIRST/NEXT/PRIOR/SORTED:
On average, UDS/SQL must search half a set occurrence to find a record. A
maximum of one disk access per record is required.
On average, UDS/SQL must search half a set occurrence to find a record. A
maximum of one disk access per record is required.
●
Insertion
When a record is inserted, it is linked to the preceding and to the subsequent record by
means of pointers.
For this reason, UDS/SQL updates the records preceding and, in the case of backward
chaining, following the record inserted.
means of pointers.
For this reason, UDS/SQL updates the records preceding and, in the case of backward
chaining, following the record inserted.
–
ORDER IS SORTED [INDEXED]:
UDS/SQL finds the place where the record is inserted by direct access.
UDS/SQL finds the place where the record is inserted by direct access.
–
ORDER IS LAST/FIRST/NEXT:
A pointer points from the owner record to the preceding record, or the owner record
is the preceding record, or the preceding record is immediately obtainable by
means of the currency information. Insertion of the record requires a maximum of
two disk accesses.
A pointer points from the owner record to the preceding record, or the owner record
is the preceding record, or the preceding record is immediately obtainable by
means of the currency information. Insertion of the record requires a maximum of
two disk accesses.
–
ORDER IS PRIOR:
UDS/SQL must search the set occurrence from the beginning unless backward
chaining has been specified. If backward chaining has been specified, insertion of
a record requires a maximum of three disk accesses.
UDS/SQL must search the set occurrence from the beginning unless backward
chaining has been specified. If backward chaining has been specified, insertion of
a record requires a maximum of three disk accesses.