Publication Type
Master Thesis
Version
publishedVersion
Publication Date
7-2022
Abstract
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 they stay ahead of competition. We perform a case study with real NBA data to demonstrate the value of the query. In addition, we present a meaningful problem variant for the special scenario where the data are sparse. We propose a first-cut algorithm for solving the problem, which we later enhance with an early termination condition. We compare the two versions of the algorithm and demonstrate their practicality using synthetic and real datasets.
Keywords
durable query, top-k query, multi-dimensional time series, temporal data
Degree Awarded
MSc in Applied Finance (SUFE)
Discipline
Databases and Information Systems | Data Storage Systems
Supervisor(s)
MOURATIDIS, Kyriakos
Publisher
Singapore Management University
City or Country
Singapore
Citation
WANG, Yiyi.
Finding top-m leading records in temporal data. (2022).
Available at: https://ink.library.smu.edu.sg/etd_coll/422
Copyright Owner and License
Author
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.