Open AccessAn Efficient Security Measure Extended Boolean Retrieval
Author(s) -
S R Ramesh,
V. Venkatesawara Rao
Publication year - 2022
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2022.40362
Subject(s) - computer science , information retrieval , representation (politics) , standard boolean model , norm (philosophy) , process (computing) , measure (data warehouse) , data mining , boolean expression , boolean function , algorithm , and inverter graph , politics , political science , law , operating system
Abstract: The impact of Extended Boolean retrieval (EBR) has drastic changes over the decades and despite their significant advantages compared to either ranked keyword or pure Boolean retrieval. In particular, EBR models produce meaningful rankings; their query model allows the representation of complex concepts in an and-or format; and they are scriptable, in that the score assigned to a document depends solely on the content of that document, unaffected by any collection statistics or other external factors. Security is the major concern to make the queries retrieval and the entire data mining process. However, EBR is much more computationally expensive than the alternatives. We consider the implementation of the p-norm approach to EBR, and demonstrate that ideas used in the max-score and wand exact optimization techniques for ranked keyword retrieval can be adapted to allow selective by pass of documents via a low-cost screening process for this and similar retrieval models. We also propose term independent bounds that are able to further reduce the number of score calculations for short, simple queries under the extended Boolean retrieval model. Overall saving from 50 to 80 percent of the evaluation cost on test queries drawn from biomedical search. (Stefan Pohl, VOL. 24, NO. 6, JUNE 2012) Keywords: extended, boolen, model, EBR