The Dijkstra algorithm is a common method used when solving shortest path problems. It graph-based that compares node distances, selects the subsequent node, and generates an ideal path. However, it seen struggles with memory utilization, particularly working substantial amounts of data or graphs. purpose this research work to improve tackle current problem. enhancement accomplished by providin...

Nowadays, sampling-based Approximate Query Processing (AQP) is widely regarded as a promising way to achieve interactivity in big data analytics. To build such an AQP system, finding the minimal sample size for query regarding given error constraints general, called Sample Size Optimization (SSO), essential yet unsolved problem. Ideally, goal of solving SSO problem statistical accuracy, computa...