Question : For every version of Postgres that supported hash indexing, there is a warning or note that hash indexes […]
Tag: btree
About the Index in MYSQL [closed]
Question : Closed. This question is off-topic. It is not currently accepting answers. Too localized – this could be because […]
How does MySQL skip ranges (nodes) in a loose index scan?
Question : I’ve read the MySQL loose index scan, and it makes sense as optimization, however, when using an example […]
Multi-column btree index & INLJ
Question : I have three tables: FILM(ID,TITLE) ACTOR(ID,NAME,GENDER) CAST(ACTOR_ID,FILM_ID,ROLE) Foreign keys: ACTOR_ID, FILM_ID And I have created a btree on […]
PostgreSQL, integer arrays, index for equality
Question : I have a huge list of integer arrays (300,000,000 records) stored in Postgres 9.2 DB. I want to […]
Sequential scans instead of index with a PostgreSQL conditional index
Question : I have the following PostgreSQL table, in it I store millions of rows. I’m effectively trying to use […]
Choosing index fillfactor for large, highly inserted table
Question : We have a table that will hold records on the 108 order. ╔══════════╦═════╦══════╦══════════════════════════╗ ║ id ║ a ║ […]
How do B+ Tree text (username, email) indexes work
Question : From my understanding, MongoDB uses a B+ Tree for indexes, including for unique fields such as emails and […]
Walking a BTREE index as far as possible in MySQL
Question : Suppose one has a column of words on which one builds a BTREE index: CREATE TABLE myTable ( […]
PostgreSQL covering index on large table as alternative to CLUSTER command
Question : I’m looking for an alternative to executing the CLUSTER command on large tables to keep data efficiently organized […]