2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016, p.1530-1531
2016
Details
- Autor(en) / Beteiligte
- Titel
- Maximizing a record's standing in a relation
- Ist Teil von
- 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016, p.1530-1531
- Ort / Verlag
- IEEE
- Erscheinungsjahr
- 2016
- Link zum Volltext
- Quelle
- IEEE/IET Electronic Library (IEL)
- Beschreibungen/Notizen
- Given a database table with records that can be ranked, an interesting problem is to identify selection conditions, which are qualified by an input record and render its ranking as high as possible among the qualifying tuples. In this paper, we study this standing maximization problem, which finds application in object promotion and characterization. We propose greedy methods, which are experimentally shown to achieve high accuracy compared to exhaustive enumeration, while scaling very well to the problem size. Our contributions include a lineartime algorithm for determining the optimal selection range for an attribute and techniques for choosing and prioritizing the most promising selection predicates to apply. Experiments on real datasets confirm the effectiveness and efficiency of our techniques.