A read cache management method based on a solid state drive, wherein the solid state drive, SSD, comprises a first queue and a second queue, and the method comprises: receiving a read request, and determining whether the read request hits the first queue and the second queue; if both the first queue and the second queue are missed, selecting and deleting an eliminated data block from the first queue according to a cache replacement algorithm; if the eliminated data block is in a stored state, wherein a stored state indicates that data stored in the data block in the first queue is a copy of data stored in the data block in the lower-level storage medium, and the data stored in the data block in the lower-level storage medium is actually stored in the SSD, inserting the eliminated data block into the second queue; and determining a target data block corresponding to the read request in a lower-level storage medium, and inserting the target data block into the first queue, wherein the target data block is in a non-stored state, wherein a non-stored state indicates that the data stored in the data block in the first queue is metadata of the data stored in the data block in the lower-level storage medium, and the data in the data block in the lower-level storage medium is not actually stored in the SSD, the method further comprising: if the read request misses the first queue, but hits the second queue, deleting, from the second queue, a hit data block corresponding to the read request; and inserting the hit data block into the first queue; wherein the inserting the eliminated data block into the second queue comprises: obtaining identity information of the eliminated data block; and if the identity information of the eliminated data block is not in a third queue, inserting the eliminated data block into the second queue; or if the identity information of the eliminated data block is in the third queue, determining whether elimination duration of the eliminated data block is greater than a preset time threshold, and if the elimination duration of the eliminated data block is greater than the preset time threshold, inserting the eliminated data block into the second queue. receiving a read request, and determining whether the read request hits the first queue and the second queue; if both the first queue and the second queue are missed, selecting and deleting an eliminated data block from the first queue according to a cache replacement algorithm; if the eliminated data block is in a stored state, wherein a stored state indicates that data stored in the data block in the first queue is a copy of data stored in the data block in the lower-level storage medium, and the data stored in the data block in the lower-level storage medium is actually stored in the SSD, inserting the eliminated data block into the second queue; and determining a target data block corresponding to the read request in a lower-level storage medium, and inserting the target data block into the first queue, wherein the target data block is in a non-stored state, wherein a non-stored state indicates that the data stored in the data block in the first queue is metadata of the data stored in the data block in the lower-level storage medium, and the data in the data block in the lower-level storage medium is not actually stored in the SSD, the method further comprising: if the read request misses the first queue, but hits the second queue, deleting, from the second queue, a hit data block corresponding to the read request; and inserting the hit data block into the first queue; wherein the inserting the eliminated data block into the second queue comprises: obtaining identity information of the eliminated data block; and if the identity information of the eliminated data block is not in a third queue, inserting the eliminated data block into the second queue; or if the identity information of the eliminated data block is in the third queue, determining whether elimination duration of the eliminated data block is greater than a preset time threshold, and if the elimination duration of the eliminated data block is greater than the preset time threshold, inserting the eliminated data block into the second queue. if the read request misses the first queue, but hits the second queue, deleting, from the second queue, a hit data block corresponding to the read request; and inserting the hit data block into the first queue; wherein the inserting the eliminated data block into the second queue comprises: obtaining identity information of the eliminated data block; and if the identity information of the eliminated data block is not in a third queue, inserting the eliminated data block into the second queue; or if the identity information of the eliminated data block is in the third queue, determining whether elimination duration of the eliminated data block is greater than a preset time threshold, and if the elimination duration of the eliminated data block is greater than the preset time threshold, inserting the eliminated data block into the second queue. obtaining identity information of the eliminated data block; and if the identity information of the eliminated data block is not in a third queue, inserting the eliminated data block into the second queue; or if the identity information of the eliminated data block is in the third queue, determining whether elimination duration of the eliminated data block is greater than a preset time threshold, and if the elimination duration of the eliminated data block is greater than the preset time threshold, inserting the eliminated data block into the second queue.