Sell Your Projects | My Account | Careers | This email address is being protected from spambots. You need JavaScript enabled to view it. | Call: +91 9573777164

Efficient Top-k Dominating Computation on Massive Data - 2017

1 1 1 1 1 Rating 4.50 (2 Votes)


Efficient Top-k Dominating Computation on Massive Data - 2017


In many applications, prime-k dominating query is a crucial operation to come back k tuples with the highest domination scores in a doubtless huge information area. It is analyzed that the present algorithms have their performance issues when performed on large information. This paper proposes a completely unique table-scan-primarily based TDTS algorithm to efficiently compute high-k dominating results. TDTS first presorts the table for early termination. The early termination checking is proposed in this paper, along with the theoretical analysis of scan depth. The pruning operation for tuples is devised in this paper. The theoretical pruning effect shows that the amount of tuples maintained in TDTS will be reduced substantially. The intensive experimental results, conducted on artificial and real-life knowledge sets, show that TDTS outperforms the existing algorithms considerably.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

Efficient Top-k Dominating Computation on Massive Data - 2017 - 4.5 out of 5 based on 2 votes

Project EnquiryLatest Ready Available Academic Live Projects in affordable prices

Included complete project review wise documentation with project explanation videos and Much More...