#1
  1. Me likey breadsticks...
    Devshed Beginner (1000 - 1499 posts)

    Join Date
    Jan 2003
    Location
    Los Angeles
    Posts
    1,189
    Rep Power
    18

    R-Tree Indexing.


    Hi all,
    I've been using postgres for a little while, but don't have a formal background in database theory (I'm trying to remedy that by reading up starting off with CJ Date's Introduction to Database Systems -it's is in the mail ) so I was wondering when R-tree indexes were useful as opposed to the default B-tree indexes. Also, when would hash indexes be useful?

    Any help would be appreciated.
    TIA
    -b
    PostgreSQL, it's what's for dinner...
  2. #2
  3. No Profile Picture
    Contributing User
    Devshed Regular (2000 - 2499 posts)

    Join Date
    Jan 2003
    Location
    No es importante
    Posts
    2,065
    Rep Power
    14
    This quick definition may be helpful.
    http://postgis.refractions.net/docs/x504.html
    ...
    Hash indexes can be used to increase the speed off searching tables. I hate to cross product post but this is a good explanation.
    http://www.mysql.com/doc/en/InnoDB_Adaptive_hash.html
    ...
    El éxito consiste en una serie de pequeñas victorias día a día

    MySQL, MS SQL, MS ACCESS, Oracle Database Manager - http://victorpendleton.net/products/psdviewer.html

IMN logo majestic logo threadwatch logo seochat tools logo