Grover’s Algorithm for Data Lake Optimization Queries

Now-a-days, the use of No-SQL databases is one of the potential options for storing and processing big data lakes. However, searching for large data in No-SQL databases is a complex and time-consuming task. Further, information retrieval from big data management suffers in terms of execution time. To reduce the execution time during the search process, we propose a fast and suitable approach based on the quantum Grover algorithm, which represents one of the best-known approaches for searching in an unstructured database and resolves the unsorted search query in O (√n) time complexity. To assess our proposal, a comparative study with linear and binary search algorithms was conducted to prove the effectiveness of Grover's algorithms. Then, we perform extensive experiment evaluations based on ibm_qasm_simulator for searching one item out of eight using Grover’s search algorithm based on three qubits. The experiments outcomes revealed encouraging results, with an accuracy of 0.948, well in accordance with the theoretical result. Moreover, a discussion of the sensitivity of Grover's algorithm through different iterations was carried out. Then, exceeding the optimal number of iterations round (π/4 √N), induces low accuracy of the marked state. Furthermore, the incorrect selection of this parameter can outline the solution.

@article{CHERRADI2022,
  title     = {Grover’s Algorithm for Data Lake Optimization Queries},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {8},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Mohamed CHERRADI and Anass EL HADDADI},
  doi       = {10.14569/IJACSA.2022.0130866},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130866}
}