![]() | |
![]() |
| | Thread Tools | Display Modes |
#1
| |||
| |||
|
|
a few years ago I was playing with B-tree index cardinality of MEMORY storage engine and come up with a patch (attached) implementing on-line cardinality calculation. According to my benchmarks, in certain cases MEMORY table scan may be up to 45% faster than index scan. But since MEMORY engine doesn't provide cardinality for B-tree indexes, index scan is always preferred over table scan. The idea of the patch is to provide accurate cardinality for B-tree indexes at any time. Max overhead should be 5-10% slowdown of DELETE/UPDATE queries. |
#2
| |||
| |||
|
|
Hi Maxim, On 11/07/10 23:47, Maxim Deviatov wrote: a few years ago I was playing with B-tree index cardinality of MEMORY storage engine and come up with a patch (attached) implementing on-line cardinality calculation. According to my benchmarks, in certain cases MEMORY table scan may be up to 45% faster than index scan. But since MEMORY engine doesn't provide cardinality for B-tree indexes, index scan is always preferred over table scan. The idea of the patch is to provide accurate cardinality for B-tree indexes at any time. Max overhead should be 5-10% slowdown of DELETE/UPDATE queries. Very cool, thanks for the contribution! I have asked our developers to get in touch with you and to review and comment on your patch. Before we can incorporate your patch into the code base, I have to ask you for one favour: can you please fill out and sign our Contributor Agreement? The instructions on how to do this are outlined on these Wiki pages: http://forge.mysql.com/wiki/Contributing_Code http://forge.mysql.com/wiki/Oracle_C...utor_Agreement Once I've received your agreement, I will review and approve it ASAP. Then the administrative side is out of the way and we can focus on the technical part. Thank you! Lenz -- Lenz Grimmer | MySQL Community Relations Specialist EMEA Phone: +49 40 41267308 | Mobile: +49 172 7106443 ORACLE Deutschland B.V. & Co. KG - http://oracle.com Hauptverwaltung: Riesstr. 25, D-80992 München Registergericht: Amtsgericht München, HRA 95603 Komplementärin: ORACLE Deutschland Verwaltung B.V. Rijnzathe 6, 3454PV De Meern, Niederlande Handelsregister der Handelskammer Midden-Niederlande, Nr. 30143697 Geschaftsführer: Jürgen Kunz, Marcel van de Molen, Alexander van der Ven Oracle is committed to developing practices and products that help protect the environment - http://www.oracle.com/commitment |
#3
| |||
| |||
|
|
Hi there, a few years ago I was playing with B-tree index cardinality of MEMORY storage engine and come up with a patch (attached) implementing on-line cardinality calculation. According to my benchmarks, in certain cases MEMORY table scan may be up to 45% faster than index scan. But since MEMORY engine doesn't provide cardinality for B-tree indexes, index scan is always preferred over table scan. The idea of the patch is to provide accurate cardinality for B-tree indexes at any time. Max overhead should be 5-10% slowdown of DELETE/UPDATE queries. Have fun, ===================== Maxim N. Deviatov |
|
-- MySQL Internals Mailing List For list archives: http://lists.mysql.com/internals To unsubscribe: http://lists.mysql.com/internals?uns... sun (DOT) com |
![]() |
| Thread Tools | |
| Display Modes | |
| |