This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
glossary:b [2009/12/04 05:46] tdo |
glossary:b [2012/10/26 14:46] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | {{page>:top_add&nofooter&noeditbtn}} | ||
| + | |||
| + | ====== Glossary ====== | ||
| ===== B ===== | ===== B ===== | ||
| - | |||
| {{page>:glossary_bar&nofooter&noeditbtn}} | {{page>:glossary_bar&nofooter&noeditbtn}} | ||
| - | == back out feature == | + | ==== Back out feature ==== |
| + | * The ability to undo a QUAFLIFY keyword search and to restore the previous internal ID list. | ||
| - | The ability to undo a QUAFLIFY keyword search and to restore the previous internal ID list. | + | ==== Bitmap index ==== |
| + | * An indexing option which stores index pointer as a bitmap, providing efficient indexing for "low cardinality" data. See also: Cardinality. Omnidex uses bitmap indexes as an option for low cardinality data. Bitmap Indexes are used on read only data stores as they cannot be indexed online and can only be synchronized with data during a batch index operation. | ||
| - | == bitmap index == | + | ==== Bitmap join ==== |
| + | * Bitmap joins are characterized by having the "from" table and the "to" table as the same child, the purpose being to change which owner is current for the table. This step may be taken when joining between a parent and a child that are not already pre-joined. | ||
| - | An indexing option which stores index pointer as a bitmap, providing efficient indexing for "low cardinality" data. See also: Cardinality. Omnidex uses bitmap indexes as an option for low cardinality data. | + | ==== Boolean operators ==== |
| + | * AND (,), OR (+), and NOT (,-) operators used to combine keywords during an Omnidex retrieval. | ||
| - | == bitmap join == | + | ==== B-tree ==== |
| + | * A type of index optimized for sorted and partial key retrievals by on column or concatenation of columns, requiring left justification of data and case-sensitive matching. | ||
| + | * The fundamental type of indexing on which relational databases are founded. Omnidex uses B-Trees internal for some of its indexes. | ||
| - | Bitmap joins are characterized by having the "from" table and the "to" table as the same child, the purpose being to change which owner is current for the table. This step may be taken when joining between a parent and a child that are not already pre-joined. | + | {{page>:bottom_add&nofooter&noeditbtn}} |
| - | + | ||
| - | + | ||
| - | == Boolean operators == | + | |
| - | + | ||
| - | AND (,), OR (+), and NOT (,-) operators used to combine keywords during an Omnidex retrieval. | + | |
| - | + | ||
| - | == B-tree == | + | |
| - | + | ||
| - | A type of index optimized for sorted and partial key retrievals by on column or concatenation of columns, requiring left justification of data and case-sensitive matching. | + | |
| - | The fundamental type of indexing on which relational databases are founded. Omnidex uses B-Trees internal for some of its indexes. | + | |
| - | |||