![]() | |
![]() |
| | Thread Tools | Display Modes |
#1
| |||
| |||
|
#2
| |||
| |||
|
|
Hi MySQL-developers, I am trying to find information on how to implement a new index structure in MySQL, e.g. a bitmap index instead of a B-Tree. Is it possible? If so, how to proceed? Thanks a lot for the answers! Greets, Yves |
#3
| |||
| |||
|
|
Hi MySQL-developers, I am trying to find information on how to implement a new index structure in MySQL, e.g. a bitmap index instead of a B-Tree. Is it possible? If so, how to proceed? Thanks a lot for the answers! Greets, Yves |
#4
| |||
| |||
|
|
You may be interested in this WL entry to implement bitmap indexes: http://forge.mysql.com/worklog/task.php?id=1524 - Andrew -----Original Message----- From: Peter Volk [mailto eter (AT) ddengine (DOT) org]Sent: Wednesday, 2 February 2011 7:37 AM To: internals (AT) lists (DOT) mysql.com; weissig (AT) rbg (DOT) informatik.tu-darmstadt.de Subject: Re: New index structure? Hi Yves, indexes are implemented on storage engine level. So the first thing is to find out what storage engine you want to modify. Most simplest is probably myisam. You can find the code in /storage/myisam/ For me it was the most simplest to look at the functions that handle key lookups from the SE handler. The files in the myisam directory are very well named and easy to hack. Good luck! Cheers, Peter Am 01.02.2011 10:16, schrieb Yves Weißig: Hi MySQL-developers, I am trying to find information on how to implement a new index structure in MySQL, e.g. a bitmap index instead of a B-Tree. Is it possible? If so, how to proceed? Thanks a lot for the answers! Greets, Yves |
![]() |
| Thread Tools | |
| Display Modes | |
| |