Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering

Dissertations and Theses Collection (Open Access)

Top-k query

Articles 1 - 1 of 1

Full-Text Articles in Databases and Information Systems

Finding Top-M Leading Records In Temporal Data, Yiyi Wang Jul 2022

Finding Top-M Leading Records In Temporal Data, Yiyi Wang

Dissertations and Theses Collection (Open Access)

A traditional top-k query retrieves the records that stand out at a certain point in time. On the other hand, a durable top-k query considers how long the records retain their supremacy, i.e., it reports those records that are consistently among the top-k in a given time interval. In this thesis, we introduce a new query to the family of durable top-k formulations. It finds the top-m leading records, i.e., those that rank among the top-k for the longest duration within the query interval. Practically, this query assesses the records based on how long …