Extended Boolean Retrieval Model using P-Norm and Term Independent Bound Methods

This paper provides a comparison report of two processes of retrieving a keyword or information's from a given database or from a multiple databases. The process1 referred to as Extended Boolean Retrieval (EBR) model, it gives us an outcome in the database. Since EBR model implementation factors lead to a higher cost, we consider a p - norm method of the EBR execution. P - Norm approach plays a role in the EBR model to preserve strictness of the conjunctions and disjunctions to establish them with their own identification on the node. As Adaptive Boolean Retrieval Process (ABRP the process2 known). Within this paradigm of text categorization aspect, first it assigns a value to a specified key word or info then starts its hunting procedure with an index. This value includes the factors such as a position and appearances of phrase. In existing, they use these concepts in Bag-of-word approach. In this paper EBR model gives an edge of reformulation facet, which gives a hundreds or tens of thousands of answers for the given query. To finish, we assess together with the reported results of these models on query to demonstrate an better retrieving process according to their efficiency and correctness with the max score ranking algorithm.