diff options
| author | Bruce Momjian | 2000-10-07 14:16:02 +0000 |
|---|---|---|
| committer | Bruce Momjian | 2000-10-07 14:16:02 +0000 |
| commit | a759460178c22ece2cc95cfc0d18e2e9631c2499 (patch) | |
| tree | 0e6773a72d15f544b9c063b29612b884b1c61c9a /doc/src/FAQ | |
| parent | 949529481ed490959f701725dddbfbc721c0fb51 (diff) | |
New beos files. FAQ cleanup.
Diffstat (limited to 'doc/src/FAQ')
| -rw-r--r-- | doc/src/FAQ/FAQ.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/FAQ/FAQ.html b/doc/src/FAQ/FAQ.html index 0c161946e5c..4c816e7e184 100644 --- a/doc/src/FAQ/FAQ.html +++ b/doc/src/FAQ/FAQ.html @@ -950,7 +950,7 @@ Guttman, A. "R-trees: A Dynamic Index Structure for Spatial Searching." Proc of the 1984 ACM SIGMOD Int'l Conf on Mgmt of Data, 45-57.<P> You can also find this paper in Stonebraker's "Readings in Database -Systems"<P> +Systems".<P> Built-in R-trees can handle polygons and boxes. In theory, R-trees can be extended to handle higher number of dimensions. In practice, |