Boundary query solution using convex hull algorithm

An important issue in database (DB) systems is responding to different users' queries in an acceptable time. To do this, we should define different queries based on users' real needs and we should consider suitable solutions. In this article, we express a new query called 'boundary query' which is used for achieving an overall view of a subject in the DB. This query does not return all query answers but it returns boundary values that cover all answers for the related query. In this article, we map a DB environment to a vector space based on necessary attributes. Then we implement the proposed method, and based on the results, we observe that the proposed method's run time is acceptable for huge DBs.