In distributed database management systems, fragmenting base connections increases concurrency and hence system throughput for query processing. User queries use hybrid fragmentation methods focused on vector bindings, and deductive database implementations lack query-access-rule dependence. As a result, for hierarchical deductive information implementations, a hybrid fragmentation solution is used. The method considers the horizontal partition of base relations based on the bindings placed on user requests, then produces vertical fragments of the horizontally partitioned relations, and finally clusters rules based on attribute affinity and query and rule access frequency. The suggested fragmentation approach makes distributed deductive database structures easier to develop.