Hi, > As I can see hash indexes can be used only for unique keys. > What about non-unique implementation? I mean holding > for each hash collection of rows. Will it give performance gains > for some scenarios?
An in-memory hash index for non-unique keys is possible. In theory it should be a bit faster than the current AVL tree for larger in-memory tables. While I don't plan to implement such an index myself, you are welcome to implement it if you want. Regards, Thomas --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "H2 Database" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/h2-database?hl=en -~----------~----~----~----~------~----~------~--~---
