Example:
libgist> anlinfo a1
gist::check()
).
Example:
libgist> check t
gist::close()
).
Example:
libgist> close t
Example:
libgist> closeanl a1
Example:
libgist> create t rstar_point_ext point-data 0.8
which creates a point R*-tree named "t" and bulk-loads it with the data contained
in file "point-data". The pages are filled up 80%.
Data files contain one item per line in the following format:
"key" "data"
Example:
libgist> create t rstar_point_ext
Example:
libgist> createanl a1 t query-script 10 0.8
gist::remove()
).
Example:
libgist> remove t "< p 50 50"
cout
. If no page number is specified,
dump contents of entire index. Calls gist_ext_t::printPred()
.
Example:
libgist> dump t 2
Example:
libgist> insert t "25.003 24" "51234"
which inserts a new item into a tree that stores 2-dimensional point data as
keys and integers as data.
gist::open()
)).
Example:
libgist> open t
Example:
libgist> openanl a1
opt
is specified, the statistics will be computed
for the tree derived from the optimal clustering, not the actual tree.
Example:
libgist> penaltystats a1
gistcmdline
.
Example:
libgist> select t 20 "~ p 50 50"
,
which runs a nearest-neighbor query on index t
and stops returning
items after the first 20 matches.
Example:
libgist> set echo 0
opt
is specified, the statistics will be computed
for the tree derived from the optimal clustering, not the actual tree.
Example:
libgist> splitstats a1
createanl
, a script is supplied that contains the workload queries).
Example:
libgist> wkldstats a1
Example:
libgist> write loadfile t t-loadfile
Extension | Type | Operators | Keys |
---|---|---|---|
rt_point_ext | R-tree | spatial | points |
rt_rect_ext | R-tree | spatial | rectangles |
rstar_point_ext | R*-tree | spatial | points |
rstar_rect_ext | R*-tree | spatial | rectangles |
ss_point_ext | SS-tree | spatial | points |
sr_point_ext | SR-tree | spatial | points |
sp_point_ext | Sphere-tree | spatial | points |
bt_int_ext | B-tree | B-tree | integers |
bt_str_ext | B-tree | B-tree | strings |
insert
command).
Operators | Description | Example |
---|---|---|
= [p|r] key | equality with point (p) or rectangle (r) | "= p 5.5 6.5" |
& [p|r] key | overlap | "& r 0 10 0 10" |
< [p|r] key | containment (key contains index data item) | "< r 0 10 0 10" |
> [p|r] key | containment (index data item contains key) | "> p 5.5 6.5" |
~ p key | nearest-neighbor query | "~ p 5.5 6.5" |
Point keys are specified as "x y ...", rectangle keys as "xmin xmax ymin ymax ...".
The implementation details of the various tree structures are described in their respective publications:
Operators | Description | Example |
---|---|---|
= key | equality | "= 'hello'" |
< key | less | "< 5" |
<= key | less or equal | "<= 'hello'" |
> key | greater | "> 5" |
>= key | greater or equal | ">= 5" |
between key1 key2 | SQL BETWEEN | "between 5 10" |
Comments, questions and suggestions may be directed to gist@postgres.berkeley.edu
Last modified: $Date: 2001/03/21 22:01:41 $ by $Author: mct $.