How do I narrow my search results?
After you submit your search query:
- On the Refine Search results page, select one or more categories of products or services from the left sidebar.
- Then for a category with search results, click Select to choose your product and release filters, and then click OK.
For search queries that contain multiple words, surround the query with quotes, and then resubmit your query. Example: "database cloud service"
How do I find the documentation for my product or service?
From the home page, click the technology categories for your products or services. If you do not know which category to pick, try the following features:
- Click the Find a product tab and search for your product or service.
- Click Browse All Products & Services at the bottom of the home page to view an alphabetical listing of products and services.
- Apple Safari: Version 6
- Google Chrome: Version 29 and later
- Mozilla Firefox: Version 24 and later
- Microsoft Internet Explorer: Version 9 and later
CREATE INDEX → Purpose Use the CREATE INDEX statement to create an index on: One or more columns of a table, a … partitioned table, an index-organized table, or a cluster One or more scalar typed object attributes of … a table or a cluster A nested table storage table for indexing a nested table column An index is a … index:
ALTER INDEX → Purpose Use the ALTER INDEX statement to change or rebuild an existing index. See Also: CREATE … INDEX for information on creating an index Prerequisites The index must be in your own schema or you … must have the ALTER ANY INDEX system privilege. To rebuild an online index
DROP INDEX → Purpose Use the DROP INDEX statement to remove an index or domain index from the database. When you … drop a global partitioned index, a range-partitioned index, or a hash-partitioned index, all the … index partitions are also dropped. If you drop a composite-partitioned
INDEX Hint → \", tablespec::=, indexspec::= ) The INDEX hint instructs the optimizer to use an index scan for the … specified table. You can use the INDEX hint for function-based, domain, B-tree, bitmap, and bitmap join … indexes. The behavior of the hint depends on the indexspec specification: If the INDEX hint … specifies
Index Characteristics → with which they are associated. Thus, an index can be dropped or created without physically … affecting the table for the index. Note: If you drop an index, then applications still work. However … , access of previously indexed data can be slower. The absence or presence of an index does not require a … change
Index Storage → Oracle Database stores index data in an index segment. Space available for index data in a data … value indexed. The tablespace of an index segment is either the default tablespace of the owner or a … tablespace specifically named in the CREATE INDEX statement. For ease of administration you can
3 Indexes and Index-Organized Tables → index-organized tables, which are tables stored in an index structure. This chapter contains the … following sections: Overview of Indexes Overview of Index-Organized Tables
Table 3-2 Sample Bitmap → Value Row 1 Row 2 Row 3 Row 4 Row 5 Row 6 Row 7 M 1 0 1 1 1 0 0 F 0 1 0 0 0 1 1 A mapping function converts each bit in the bitmap to a rowid of the customers table. Each bit value depends on the values of the corresponding row in the table. For example, the bitmap for the M value contains a 1 as its first bit because the gender is M in the first row of the customers table. The bitmap cust_gender='M'
Index-Organized Table Characteristics → The database system performs all operations on index-organized tables by manipulating the B-tree … index structure. Table 3-4 summarizes the differences between index-organized tables and heap … -organized tables. Table 3-4 Comparison of Heap-Organized Tables with Index-Organized Tables
Secondary Indexes on Index-Organized Tables → A secondary index is an index on an index-organized table. In a sense, it is an index on an index … . The secondary index is an independent schema object and is stored separately from the index … rowids for index-organized tables. A logical rowid is
B-Tree Indexes → B-trees, short for balanced trees, are the most common type of database index. A B-tree index is an … range searches. Figure 3-1 illustrates the structure of a B-tree index. The example shows an index on
Function-Based Indexes → Figure 3-2 Bitmap Join Index Description of \"Figure 3-2 Bitmap Join Index\" Conceptually … , employees_bm_idx is an index of the jobs.title column in the SQL query shown in Example 3-5 (sample output … included). The job_title key in the index points to rows in the employees table. A query of the … number of
Application Domain Indexes → An application domain index is a customized index specific to an application. Oracle Database … specialized indexing techniques You can encapsulate application-specific index management routines as … an indextype schema object and define a domain index on table columns or attributes of an object type … software,
Index-Organized Tables with Row Overflow Area → Figure 3-3 Index-Organized Table Description of \"Figure 3-3 Index-Organized Table\" An index … Figure 3-3, leaf block 1 in an index-organized table might contain entries as follows, ordered by … primary key: 20,Marketing,201,1800 30,Purchasing,114,1700 Leaf block 2 in an index-organized table
Overview of Index-Organized Tables → An index-organized table is a table stored in a variation of a B-tree index structure. In a heap … -organized table, rows are inserted where they fit. In an index-organized table, rows are stored in an … index defined on the primary key for the table. Each index entry in the B-tree also stores the non
Bitmap Indexes → In a bitmap index, the database stores a bitmap for each index key. In a conventional B-tree index … , one index entry points to a single row. In a bitmap index, each index key stores pointers to … reference many columns in an ad hoc fashion. Situations that may call for a bitmap index
Heap-Organized Table Index-Organized Table → index scan or fast full index scan returns all rows in some order. Can be stored in a table cluster with … the structure of an index-organized departments table. The leaf blocks contain the rows of the table
Overview of Indexes → An index is an optional structure, associated with a table or table cluster, that can sometimes … speed data access. By creating an index on one or more columns of a table, you gain the ability in some … a full table scan to find a value. For example, without an index, a query of location 2700 in the … speed access, the manager
Table 3-1 Contents of Two Data Blocks in the Employees Table → Figure 3-1 Internal Structure of a B-tree Index Description of \"Figure 3-1 Internal Structure of a … B-tree Index\" Branch Blocks and Leaf Blocks A B-tree index has two types of blocks: branch blocks … for searching and leaf blocks that store values. The upper-level branch blocks of a B-tree index … contain index
Table 3-3 Sample Bitmap → time, often dramatically. Bitmap Join Indexes A bitmap join index is a bitmap index for the join of … two or more tables. For each value in a table column, the index stores the rowid of the … corresponding row in the indexed table. In contrast, a standard bitmap index is created on a single table. A … bitmap join