期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：7
页码：14855
DOI：10.15680/IJIRSET.2017.0607336
出版社：S&S Publications
摘要：In this paper we take a look at nearest keyword set Queries on textual content high multidimensionaldataset. Although existing techniques using tree-based indexes advise viable solutions to NKS queries onmultidimensional datasets, the overall performance of those algorithms deteriorates sharply with the growth of lengthor dimensionality in datasets. In this paper, we suggest ProMiSH to permit fast processing for NKS queries. Inparticular, we expand an authentic ProMiSH (known as ProMiSH-E) that usually retrieves the best top-k consequences,and an approximate ProMiSH (called ProMiSH-A) that is more efficient in terms of time and area, and is able toacquire close to-ideal outcomes in exercise.
