International Journal of Advanced Research in Computer Engineering & Technology
Top-k pairs monitor the general functionality restricts the work space of sub domains processing the result which influence some query. There are many top-k queries which significantly query over k-closest pairs which answers wide variety of top-k pairs. When dataset defines every row which retrieves highest scoring query that has efficient evaluation will be active research topic with different instants. Efficient query for contents such as buffer will have clear idea for efficient maintenance of constant of top-k queries.