Top-k Queries on Temporal Data

Provided by: Florida State University
Topic: Big Data
Format: PDF
The database community has devoted extensive amount of efforts to indexing and querying temporal data in the past decades. However, insufficient amount of attention has been paid to temporal ranking queries. More precisely, given any time instance t, the query asks for the top-k objects at time t with respect to some score attribute. Some generic indexing structures based on R-trees do support ranking queries on temporal data, but as they are not tailored for such queries, the performance is far from satisfactory. The authors present the SEB-tree, a simple indexing scheme that supports temporal ranking queries much more efficiently.

Find By Topic