Home
|
Previous Page
|
Next Page
Contents
Introduction
In This Introduction
About This Manual
Types of Users
Software Dependencies
Assumptions About Your Locale
Demonstration Database
Documentation Conventions
Typographical Conventions
Feature, Product, and Platform
Syntax Diagrams
Example Code Conventions
Additional Documentation
Installation Guides
Online Notes
Informix Error Messages
Manuals
Online Help
Accessibility
IBM Informix Dynamic Server Version 10.0 and CSDK Version 2.90 Documentation Set
Compliance with Industry Standards
IBM Welcomes Your Comments
R-Tree Secondary Access Method Concepts
In This Chapter
About Access Methods
The R-Tree Secondary Access Method
R-Tree Index Structure
Searching with an R-Tree Index
Nearest-Neighbor Searching
Inserting into an R-Tree Index
R-Link Trees and Concurrency
About Operator Classes
R-Tree Functionality That IBM Provides
IBM Informix Dynamic Server
R-Tree Secondary Access Method DataBlade Module
IBM Informix DataBlade Modules That Use the R-Tree Access Method
Using the R-Tree Secondary Access Method
In This Chapter
Before You Begin
Creating R-Tree Indexes
Syntax
R-Tree Index Parameters
Bottom-Up Building of R-Tree Indexes
Using the NO_SORT Index Parameter
R-Tree Index Options
Examples of Creating R-Tree Indexes
When Does the Query Optimizer Use an R-Tree Index?
Complex Qualifications
R-Tree Indexes and Null Values
How an R-Tree Index Internally Handles Null Values
How Strategy Functions Handle Null Values
Performing Nearest-Neighbor Searches
Limitations
Example
Database Isolation Levels and R-Tree Indexes
Functional R-Tree Indexes
Developing DataBlade Modules That Use the R-Tree Secondary Access Method
In This Chapter
Overview of DataBlade Module Development
Deciding Whether to Use the R-Tree Access Method
Designing a User-Defined Data Type
Data Objects and Bounding Boxes
Data Type Hierarchies
Maximum Size of the User-Defined Data Type
Loose Bounding Box Calculations
Other User-Defined Data Type Design Considerations
Creating a New Operator Class
Support Functions
Strategy Functions
Selectivity and Cost Functions
Syntax for Creating a New Operator Class
Setting Up Nearest-Neighbor Searching
Setting Up a Strategy Function for Nearest-Neighbor Searching
Creating Registration Scripts for Dependent DataBlade Modules
Importing the ifxrltree Interface Object
Managing Databases That Use the R-Tree Secondary Access Method
In This Chapter
Performance Tips
Updating Statistics
Deletions
Effectiveness of Bounding Box Representation
Clustering Spatial Data on the Disk
Returning the Coordinates of the Root Bounding Box
Syntax
Example
Estimating the Size of an R-Tree Index
Calculating Index Size Based on Number of Rows
Using the oncheck Utility to Calculate Index Size
R-Tree Index and Logging
Description of the R-Tree-Specific Logical-Log Records
Using the onlog Utility to View R-Tree Logical-Log Records
System Catalogs
sysams
sysopclasses
sysindices
Checking R-Tree Indexes with the oncheck Utility
Checking Pages with the -ci and -cI Options
Checking Pages with the -pT Option
Checking Pages with the -pk and -pK Options
Checking Pages with the -pl and -pL Options
Other Options with -u
Appendix A. Shapes3 Sample DataBlade Module
Description of the Sample DataBlade Module
Data Types
Operators
Operator Class
Sample C Code
shape.h Header File
Overlap Strategy Function
Equal Strategy Function
Contains Strategy Function
Within Strategy Function
Union Support Function
Size Support Function
Inter Support Function
SFCbits Support Function
ObjectLength Support Function
SFCValue Support Function
SetUnion Support Function
Appendix B. Accessibility
Dotted Decimal Syntax Diagrams
Glossary
Notices
Trademarks
Index
Home
| [
Top of Page
|
Previous Page
|
Next Page
|
Contents
|
Index
]