Restore corrupted innodb from .frm and .ibd files

Sql comes in many different,  for some flavours, if the db crashes, updated or anything is changed within it.
You can simply move the files in the directory of your new sql db and it should read it instantly.
With innodb ,
it does read them but when you try to SELECT from the tables,
it returns TABLE does not exist.
First install mysqlfrm which we will use to read the tables form.
sudo apt-get install mysql-utilities
Next do mysqlfrm --user=mysql --server=root:maria@localhost --port=3308 sql_table.frm
You can change the variables with the ones specific to your server of course.
The output of this will be a command that you can use to create a table of the same form.
Create a new db of a name that you desire, 
then copy the output of mysqlfrm and execute it to create a table inside our newly created db.
Now that a table of the same form is created,
Execute those commands
ALTER TABLE 'sql_table' ROW_FORMAT=DYNAMIC;
ALTER TABLE sql_table DISCARD TABLESPACE;
Next copy your own .frm and .ibd files inside the mysql database, for my case it was in /var/lib/mysql/dbname
then execute ALTER TABLE sql_table IMPORT TABLESPACE;
And everything should be well!.

Comments

Post a Comment

Popular posts from this blog

Create a route optimization algorithm with zero costs using google's OR-tools and OSRM Part 3

This is a continuation to the route optimization series . First we define the function that will be used by the optimizer to get the distances between points.   def distance_callback(from_index, to_index):                 from_node = manager.IndexToNode(from_index)                  to_node      = manager.IndexToNode(to_index)                          if from_node == to_node:                                return 0                          return data['distance_matrix'][from_node][to_node] IndexToNode is used to correlate between a location as a node index inside the being tested/optimized route by the solver and the index of the loc...
Read more

Learn python programming through algorithms - Binpacking part 2

Image
Bin packing algorithm for regular and irregular shapes Part 2: Constructing the Binary tree (linked list) s is the size, it is a tuple containing the length and the width. c is the coordinate, it is a tuple that will contain its origin point and the origin point won't be the center. Origin point for an inserted shape in red The pointers right and left are used to construct the tree that we will discuss later. occupants is used to hold some complex shapes such that the sorting function takes care of splitting the Node while sorting, thats one method to defeat stuttering as we defer some of the splitting overhead in the inserting stage to the sorting stage. class Node:            def __init__(self, a=[0,0], b=[0,0]):                    self.s = a                    self.c = b                ...
Read more

Create a route optimization algorithm with zero costs using google's OR-tools and OSRM Part 1

Image
This is a tutorial for an algorithm that has riped over the years of experience in doing algorithms and websites  for carpooling, Uber like service, Freight routing, and many other applications. I will be stating the current algorithm and i will discuss my decisions on certain code implementations as well as some of the previous decisions that i took and proved to be wrong, slow or error prone. This algorithm is capable of optimizing for thousands of locations, and made to be highly customizable. Features of the algorithm are: Reading data from and exporting data to an excel sheet or a Database. Multiple time windows per location. Multiple vehicle types, capacities, buffers, depots. Custom optimization parameters like distance, time, fuel consumption, etc. Pickup and dropoff. Custom loading and unloading time per stop. Custom service time at certain locations. Custom max idle time waiting for the next stop's time window. Custom distributed workload amongst ...
Read more