Problem: ======== - When an R-tree root page becomes full and requires splitting, InnoDB follows a specific root-raising procedure to maintain tree integrity. The process involves allocating a new page (Page X) to hold the current root's content, preserving the original root page number as the tree's entry point, and migrating all existing records to Page X. The root page is then cleared and reconstructed as an internal node containing a single node pointer with an MBR that encompasses all spatial objects on Page X. Subsequently, InnoDB should split the records on Page X into two spatially optimized groups using the pick_seeds() and pick_next() algorithms, creating a second page (Page Y) for Group B records while retaining Group A records on Page X. After records are redistributed between Page X and Page Y, the recalculated MBR for Page X must remain within or be smaller than the original MBR stored in the root page's node pointer. Bug scenario: ============ - When root page 4 becomes full, it triggers a split operation where the content is copied to page 7 and root page 4 is cleared to become an internal node. - During the first split attempt on page 7, Group 1 overflows and remaining entries are reassigned to Group 2. - A new page 8 is created and the remaining entry record is inserted, but the combined size of the remaining entry record and new record exceeds the page size limit. - This triggers a second split operation on page 7, where Group 2 overflows again and entries are moved back to Group 1. - When the new record is finally inserted into page 7, it causes the MBR (Minimum Bounding Rectangle) for page 7 to expand beyond its original boundaries. - Subsequently, when InnoDB attempts to update the parent page 4 with the new MBR information, it fails to locate the corresponding internal node, leading to spatial index corruption and the reported failure. Problem: ======== - Second split operation should happen on page 8, not on page 7. - split_rtree_node() considers key_size to estimate record sizes during the splitting algorithm, which fails to account for variable-length fields in spatial records. - In rtr_page_split_and_insert(), when reorganization succeeds, InnoDB doesn't attempt the insert the entry Solution: ======== rtr_page_split_and_insert(): InnoDB should do insert the tuple when btr_page_reorganize() is successful. rtr_page_split_and_insert(): Use the overflow page for consecutive split operation. split_rtree_node(): Store the record length for each record in r-tree node. This should give proper estimation while determining the group entries and also helpful in overflow validation |
||
|---|---|---|
| .github | ||
| BUILD | ||
| client | ||
| cmake | ||
| dbug | ||
| debian | ||
| Docs | ||
| extra | ||
| include | ||
| libmariadb@9e2b0370de | ||
| libmysqld | ||
| libservices | ||
| man | ||
| mysql-test | ||
| mysys | ||
| mysys_ssl | ||
| plugin | ||
| randgen/conf | ||
| scripts | ||
| sql | ||
| sql-bench | ||
| sql-common | ||
| storage | ||
| strings | ||
| support-files | ||
| tests | ||
| tpool | ||
| unittest | ||
| vio | ||
| win | ||
| wsrep-lib@14ce8cab76 | ||
| zlib | ||
| .clang-format | ||
| .gitattributes | ||
| .gitignore | ||
| .gitlab-ci.yml | ||
| .gitmodules | ||
| appveyor.yml | ||
| BUILD-CMAKE | ||
| CMakeLists.txt | ||
| config.h.cmake | ||
| configure.cmake | ||
| CONTRIBUTING.md | ||
| COPYING | ||
| CREDITS | ||
| INSTALL-SOURCE | ||
| INSTALL-WIN-SOURCE | ||
| KNOWN_BUGS.txt | ||
| README.md | ||
| THIRDPARTY | ||
| VERSION | ||
Code status:
MariaDB: The innovative open source database
MariaDB was designed as a drop-in replacement of MySQL(R) with more features, new storage engines, fewer bugs, and better performance.
MariaDB is brought to you by the MariaDB Foundation and the MariaDB Corporation. Please read the CREDITS file for details about the MariaDB Foundation, and who is developing MariaDB.
MariaDB is developed by many of the original developers of MySQL who now work for the MariaDB Corporation, the MariaDB Foundation and by many people in the community.
MySQL, which is the base of MariaDB, is a product and trademark of Oracle Corporation, Inc. For a list of developers and other contributors, see the Credits appendix. You can also run 'SHOW authors' to get a list of active contributors.
A description of the MariaDB project and a manual can be found at:
https://mariadb.com/kb/en/mariadb-vs-mysql-features/
https://mariadb.com/kb/en/mariadb-versus-mysql-compatibility/
https://mariadb.com/kb/en/new-and-old-releases/
Getting the code, building it and testing it
Refer to the following guide: https://mariadb.org/get-involved/getting-started-for-developers/get-code-build-test/ which outlines how to build the source code correctly and run the MariaDB testing framework, as well as which branch to target for your contributions.
Help
More help is available from the Maria Discuss mailing list https://lists.mariadb.org/postorius/lists/discuss.lists.mariadb.org/ and MariaDB's Zulip instance, https://mariadb.zulipchat.com/
Licensing
MariaDB is specifically available only under version 2 of the GNU General Public License (GPLv2). (I.e. Without the "any later version" clause.) This is inherited from MySQL. Please see the README file in the MySQL distribution for more information.
License information can be found in the COPYING file. Third party license information can be found in the THIRDPARTY file.
Bug Reports
Bug and/or error reports regarding MariaDB should be submitted at: https://jira.mariadb.org
For reporting security vulnerabilities see: https://mariadb.org/about/security-policy/
The code for MariaDB, including all revision history, can be found at: https://github.com/MariaDB/server