Top k Dominating Queries on Incomplete Data


YEAR : 2023


Categories: , , , , Tags: ,


The top-k dominating (TKD) query returns the k objects that dominate the maximum number of objects in a given dataset. It combines the advantages of skyline and top-k queries, and plays an important role in many decision support applications. Incomplete data exists in a wide spectrum of real datasets, due to device failure, privacy preservation, data loss, and so on. In this paper, for the first time, we carry out a systematic study of TKD queries on incomplete data, which involves the data having some missing dimensional value(s). We formalize this problem, and propose a suite of efficient algorithms for answering TKD queries over incomplete data. Our methods employ some novel techniques, such as upper bound score pruning, bitmap pruning, and partial score pruning, to boost query efficiency. Extensive experimental evaluation using both real and synthetic datasets demonstrates the effectiveness of our developed pruning heuristics and the performance of our presented algorithms.



  • System : Dual core.
  • Hard Disk         : 40 GB.
  • Floppy Drive : 1.44 Mb.
  • Monitor : 15 VGA Colour.
  • Mouse : Logitech.
  • Ram : 4 GB.


  • Operating system : Windows XP/7/10/11.
  • Coding Language :  JAVA
  • Data Base :  MYSQL


There are no reviews yet.

Be the first to review “Top k Dominating Queries on Incomplete Data”

Your email address will not be published. Required fields are marked *

Product Enquiry