Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative

@inproceedings{Asudeh2017EfficientCO,
  title={Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative},
  author={Abolfazl Asudeh and Azade Nazi and Nan Zhang and Gautam Das},
  booktitle={SIGMOD Conference},
  year={2017}
}
Finding the maxima of a database based on a user preference, especially when the ranking function is a linear combination of the attributes, has been the subject of recent research. A critical observation is that the em convex hull is the subset of tuples that can be used to find the maxima of any linear function. However, in real world applications the convex hull can be a significant portion of the database, and thus its performance is greatly reduced. Thus, computing a subset limited to $r… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Approximation algorithms for convex hulls

  • J. L. Bentley, F. P. Preparata, M. G. Faust
  • Communications of the ACM, 25(1):64–68
  • 1982
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…