|
|
1.1 root 1: .th ORDERED QUEL 12/31/84
2:
3: .sh NAME
4: ordered \- storage structure type
5:
6: .sh DESCRIPTION
7: .it Ordered
8: relations are a special type of storage structure in INGRES.
9: They are created by using the modify relation to orderedn command
10: where n indicates the ordering dimension. Ordering does not
11: destroy existing storage structures on a relation. The resulting
12: relation is the old relation with n 4-byte integer LID fields
13: "attached" to the the end of the relation. These fields are
14: different from conventional attribute fields because they can
15: be dynamically adjusted by the system during updates to maintain
16: a consistent ordering of tuples in a relation. Thus a LID
17: attribute value may be updated even though a query does not
18: explicitly affect a lid attribute in that tuple.
19: .s3
20: .i0
21: Updates are fully supported in ordered relations with the following
22: side effects.
23: .s3
24: .i0
25: Appends - If the user specifies a lid value, the tuple is inserted
26: in front of the tuple with that lid value. Thus all lid values
27: following that tuple are incremented by one. If a lid is not
28: specified and it corresponds to the lowest lid level (ie lid3 in
29: a 3-dimensional ordered relation), the tuple will be inserted
30: at the end of the lid subtree that it corresponds to. Otherwise
31: the lid value is assumed to be "0" which indicates to the system
32: that a new lid subtree will be created at level n where the lid
33: value was specified.
34: .s3
35: .i0
36: Deletes - The user can delete tuples by specifying lid values.
37: The side effect is that lid values will be collapsed due to
38: the removed tuples.
39: .s3
40: .i0
41: Replaces - Like appends, new tuples will be inserted in front
42: of the tuple with the old lid value that the user is trying to
43: replace. If no new lid values are specified, they're assumed to
44: be the old ones. To create a new lid subtree using replace,
45: a lid value is "0" is to be specified.
46: .s3
47: .i0
48: .sh "SEE ALSO"
49: modify(quel)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.