Timeline for How is it possible for Hash Index not to be faster than Btree for equality lookups?
Current License: CC BY-SA 4.0
16 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 22, 2020 at 20:01 | comment | added | Sampson Crowley | @qris stop necrobumping. I've already covered this with you. This is about the THEORY not whether it's improved now | |
Dec 20, 2020 at 12:14 | comment | added | qris |
The versions discussed here are ancient, and it's not true that hash indexes are slower than btree in more recent versions (e.g. Postgres 11).
|
|
Dec 16, 2020 at 10:28 | answer | added | qris | timeline score: 14 | |
Jul 19, 2018 at 21:03 | history | tweeted | twitter.com/StackDBAs/status/1020051554949361670 | ||
Jul 19, 2018 at 19:51 | vote | accept | Sampson Crowley | ||
Jul 19, 2018 at 19:39 | answer | added | jjanes | timeline score: 17 | |
Jul 19, 2018 at 19:21 | vote | accept | Sampson Crowley | ||
Jul 19, 2018 at 19:51 | |||||
Jul 19, 2018 at 19:20 | answer | added | mustaccio | timeline score: 10 | |
Jul 19, 2018 at 18:51 | history | edited | Sampson Crowley | CC BY-SA 4.0 |
add another link
|
Jul 19, 2018 at 18:37 | history | edited | Sampson Crowley | CC BY-SA 4.0 |
grammar and missed a highlight
|
Jul 19, 2018 at 18:36 | history | edited | ypercubeᵀᴹ | CC BY-SA 4.0 |
added 1413 characters in body; edited title
|
Jul 19, 2018 at 18:33 | comment | added | ypercubeᵀᴹ | Discussion has moved to chat. | |
Jul 19, 2018 at 18:30 | history | edited | ypercubeᵀᴹ | CC BY-SA 4.0 |
added 1413 characters in body; edited title
|
Jul 19, 2018 at 18:08 | history | edited | Sampson Crowley | CC BY-SA 4.0 |
clarify versions
|
Jul 19, 2018 at 17:47 | review | First posts | |||
Jul 19, 2018 at 18:07 | |||||
Jul 19, 2018 at 17:42 | history | asked | Sampson Crowley | CC BY-SA 4.0 |