Efficient Aggregation of Ranked Inputs

@article{Mamoulis2006EfficientAO,
  title={Efficient Aggregation of Ranked Inputs},
  author={Nikos Mamoulis and Kit Hung Cheng and Man Lung Yiu and David Wai-Lok Cheung},
  journal={22nd International Conference on Data Engineering (ICDE'06)},
  year={2006},
  pages={72-72}
}
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to light some key observations, which impose two phases that any top-k algorithm, based on sorted accesses, should go through. Based on them, we propose a new algorithm, which is designed to minimize the number of object accesses, the computational cost, and the memory requirements of top-k search. Adaptations of our… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

Monitoring the Top-m Rank Aggregation of Spatial Objects in Streaming Queries

2017 IEEE 33rd International Conference on Data Engineering (ICDE) • 2017
View 5 Excerpts
Highly Influenced

Authenticated Top-K Aggregation in Distributed and Outsourced Databases

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing • 2012
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Similar Papers

Loading similar papers…