Proposed Framework for TOP-K Dominating Queries Over Incomplete Multidimensional Database
AbstractTop-K processing is not quite the same as nor-mal databases as Top-K likewise chips away at indeterminate databases which are extremely hard to deal with. Instability is the one property of database and those sort of databases are extremely confused for calculation in regard to scores. The main column is enrollment vulnerability, where each tuple has a place with the database with a likelihood, in the future called confidence. The methods aremoreover examined, for example, upper bound score pruning,bitmap pruning,and partial score pruning and so forth. The primary concentration is to support up the proficiency. Incomplete data exists in a wide range of genuine datasets, because of gadget disappointment, protection conservation, data misfortune, etcetera.Index Terms—TOP-K,Queries,Incomplete,Positions
How to Cite
BNALE, Mahruda. Proposed Framework for TOP-K Dominating Queries Over Incomplete Multidimensional Database. International Journal Of Emerging Technology and Computer Science, [S.l.], v. 2, n. 2, may 2017. ISSN 2455-9954. Available at: <https://aspirepublishers.com/index.php/ijetcs/article/view/103>. Date accessed: 31 may 2020.