Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Building and Maintaining Halls of Fame Over a Database


Michel,  Sebastian
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Any fulltext), 641KB

Supplementary Material (public)
There is no public supplementary material available

Alvanaki, F., Michel, S., & Stupar, A.(2012). Building and Maintaining Halls of Fame Over a Database (MPI-I-2012-5-004). Saarbrücken: Max-Plankc-Institute für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-03E9-D
Halls of Fame are fascinating constructs. They represent the elite of an often very large amount of entities|persons, companies, products, countries etc. Beyond their practical use as static rankings, changes to them are particularly interesting|for decision making processes, as input to common media or novel narrative science applications, or simply consumed by users. In this work, we aim at detecting events that can be characterized by changes to a Hall of Fame ranking in an automated way. We describe how the schema and data of a database can be used to generate Halls of Fame. In this database scenario, by Hall of Fame we refer to distinguished tuples; entities, whose characteristics set them apart from the majority. We dene every Hall of Fame as one specic instance of an SQL query, such that a change in its result is considered a noteworthy event. Identied changes (i.e., events) are ranked using lexicographic tradeos over event and query properties and presented to users or fed in higher-level applications. We have implemented a full-edged prototype system that uses either database triggers or a Java based middleware for event identication. We report on an experimental evaluation using a real-world dataset of basketball statistics.