Discover published sets by community

A B+ Tree is a balanced tree data structure that maintains sorted data in a way that allows for efficient insertion, deletion, and lookup operations. Commonly used in databases and filesystems for indexing.

An indexing technique where a hash function is used to compute the index of each item. Used for equality searches; not suitable for range queries.

An indexing technique that uses a bitmap for each distinct value of a column, enabling efficient querying on multiple columns. Common in data warehousing for OLAP operations.

A type of index where the order of the rows in the database corresponds to the order of the index. Good for range queries and accessing data in a table.

An index structure separate from the data in a table. Provides a logical ordering of rows and includes pointers to the actual data. Allows for more indices than clustered indexes.

An index on two or more columns of a table. It enables efficient querying that involves conditions on the indexed columns.

An index that stores all the text in a document or set of documents, enabling complex text search queries. Used in search engines and text retrieval systems.

A mapping from content, such as words or numbers, to its locations in a database. Used in document retrieval systems to enable quick full text searches.

An index used for spatial data types such as geometries or geographic data. Supports efficient querying of spatial objects, such as finding points within a region.

An index that includes all the columns needed for a query. Avoids the need to go to the main table data, thus speeding up query performance.

An index built on only a subset of a table's rows, satisfying a particular WHERE clause. This reduces the size of the index and can improve performance.