Lines Matching refs:Tree

51 # EVIDENCE-OF: R-15060-13876 A 1-dimensional R*Tree thus has 3 columns.
55 # EVIDENCE-OF: R-19353-19546 A 2-dimensional R*Tree has 5 columns.
59 # EVIDENCE-OF: R-13615-19528 A 3-dimensional R*Tree has 7 columns.
65 # EVIDENCE-OF: R-53479-41922 A 4-dimensional R*Tree has 9 columns.
71 # EVIDENCE-OF: R-13981-28768 And a 5-dimensional R*Tree has 11 columns.
80 # EVIDENCE-OF: R-61533-25862 The SQLite R*Tree implementation does not
96 # EVIDENCE-OF: R-16717-50504 Each R*Tree index is a virtual table with
113 # EVIDENCE-OF: R-17874-21123 The first column of an SQLite R*Tree is
231 # store data in a variety of datatypes and formats, the R*Tree rigidly
283 # EVIDENCE-OF: R-15142-18077 A new R*Tree index is created as follows:
290 # application chooses for the R*Tree index and <column-names> is a
310 # two-dimensional R*Tree index for use in spatial queries: CREATE
350 # DROP the shadow tables, though doing so will corrupt your R*Tree
447 # commands work on an R*Tree index just like on regular tables.
530 # EVIDENCE-OF: R-45880-07724 Any valid query will work against an R*Tree
546 # EVIDENCE-OF: R-60814-18273 The R*Tree implementation just makes some
557 # EVIDENCE-OF: R-35847-18866 The big reason for using an R*Tree is so
570 # even if the R*Tree contains many entries.
612 # coordinates in an R*Tree index to be constrained in order for the
637 # R*Tree using 32-bit floating point values.
701 # EVIDENCE-OF: R-55979-39402 It is the nature of the Guttman R-Tree
731 # possible to modify the R-Tree in the middle of a query of the R-Tree.
754 # runs one query against an R-Tree like this: SELECT id FROM demo_index
818 # EVIDENCE-OF: R-06177-00576 And R-Tree can appear to read and write at
923 # use of the R*Tree index using the following simpler query: SELECT
941 # EVIDENCE-OF: R-24212-52761 The use of the R*Tree in the penultimate
947 # EVIDENCE-OF: R-39057-63901 The R*Tree index did not find the exact
1318   # EVIDENCE-OF: R-33789-46762 The content of an R*Tree index is actually
1320   # name of the R*Tree.
1328   # replaced by the name of the R*Tree virtual table. So, if the name of
1329   # the R*Tree table is "xyz" then the three shadow tables would be
1344 # each R*Tree node.
1468 # EVIDENCE-OF: R-45759-33459 Example: To verify that an R*Tree named