SettingsDatabase index techniques
B-tree
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
Bitmap index
A bitmap index is a special kind of database index that uses bitmaps.
A bitmap index is a special kind of database index that uses bitmaps.
Database index
A database index is a data structure that improves the speed of data retrieval operations on a database table at the cost of slower writes and increased storage space.
A database index is a data structure that improves the speed of data retrieval operations on a database table at the cost of slower writes and increased storage space.
Incremental encoding
Incremental encoding, also known as front compression, back compression, or front coding, is a type of delta encoding compression algorithm whereby common prefixes or suffixes ...
Incremental encoding, also known as front compression, back compression, or front coding, is a type of delta encoding compression algorithm whereby common prefixes or suffixes ...
Index (database)
Index architectures can be classified as clustered or non-clustered.
Index architectures can be classified as clustered or non-clustered.
Indexed file
An indexed file is a computer file with an index that allows easy random access to any record given its file key.
An indexed file is a computer file with an index that allows easy random access to any record given its file key.
Inverted index
In computer science, an inverted index is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of docu...
In computer science, an inverted index is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of docu...
k-d tree
In computer science, a k-d tree is a space-partitioning data structure for organizing points in a k-dimensional space.
In computer science, a k-d tree is a space-partitioning data structure for organizing points in a k-dimensional space.
kd-tree
In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space.
In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space.
Priority R-tree
The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree.
The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree.
R+ tree
An R+ tree is a method for looking up data using a location, often (x, y) coordinates, and often for locations on the surface of the earth.
An R+ tree is a method for looking up data using a location, often (x, y) coordinates, and often for locations on the surface of the earth.
R-tree
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons.
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons.
Reverse index
In database management systems, a reverse key index strategy reverses the key value before entering it in the index.
In database management systems, a reverse key index strategy reverses the key value before entering it in the index.
Spatial index
Spatial indexes are used by spatial databases (databases which store information related to objects in space) to optimize spatial queries.
Spatial indexes are used by spatial databases (databases which store information related to objects in space) to optimize spatial queries.
UB-tree
The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data.
The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data.
X-tree
In computer science, an X-tree is an index tree structure based on the R-tree used for storing data in many dimensions.
In computer science, an X-tree is an index tree structure based on the R-tree used for storing data in many dimensions.
Z-order curve
In mathematical analysis and computer science, Z-order, Morton order, or Morton code is a function which maps multidimensional data to one dimension while preserving locality of the ...
In mathematical analysis and computer science, Z-order, Morton order, or Morton code is a function which maps multidimensional data to one dimension while preserving locality of the ...