r/coding • • Jan 27 '20

Why databases use ordered indexes but programming uses hash tables

https://www.evanjones.ca/ordered-vs-unordered-indexes.html
108 Upvotes

44 comments sorted by

View all comments

Show parent comments

1

u/[deleted] Jan 28 '20

[removed] — view removed comment

1

u/stou Jan 28 '20

Of course you don't have to do any "math" or theoretical analysis. Also your example is meaningless because we have no idea what EF 6 is doing internally. There could be infinite number of reasons why two products or versions of a product perform in different ways.

1

u/[deleted] Jan 28 '20

[removed] — view removed comment

1

u/stou Jan 28 '20

Again, this does not support your argument no matter how many times you repeat it.

1

u/[deleted] Jan 28 '20 edited Jan 28 '20

[removed] — view removed comment

1

u/stou Jan 28 '20

should have

What? You went around in a circle. You point out two versions of some product without having any clue what internal changes were made and use that as evidence that the developers analyzed the algorithm performance on a napkin? Are you trolling or ... ?

1

u/[deleted] Jan 28 '20

[removed] — view removed comment

1

u/stou Jan 28 '20

Ohhh ok, that makes more sense but I still disagree =)