Finding top-m leading records in temporal data

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...

Full description

Saved in:
Bibliographic Details
Main Author: WANG, Yiyi
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/etd_coll/422
https://ink.library.smu.edu.sg/context/etd_coll/article/1420/viewcontent/GPIS_AY2019_MbR_Wang_Yiyi.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.etd_coll-1420
record_format dspace
spelling sg-smu-ink.etd_coll-14202022-09-22T09:36:27Z Finding top-m leading records in temporal data WANG, Yiyi 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. 2022-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/etd_coll/422 https://ink.library.smu.edu.sg/context/etd_coll/article/1420/viewcontent/GPIS_AY2019_MbR_Wang_Yiyi.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Dissertations and Theses Collection (Open Access) eng Institutional Knowledge at Singapore Management University durable query top-k query multi-dimensional time series temporal data Databases and Information Systems Data Storage Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic durable query
top-k query
multi-dimensional time series
temporal data
Databases and Information Systems
Data Storage Systems
spellingShingle durable query
top-k query
multi-dimensional time series
temporal data
Databases and Information Systems
Data Storage Systems
WANG, Yiyi
Finding top-m leading records in temporal data
description 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.
format text
author WANG, Yiyi
author_facet WANG, Yiyi
author_sort WANG, Yiyi
title Finding top-m leading records in temporal data
title_short Finding top-m leading records in temporal data
title_full Finding top-m leading records in temporal data
title_fullStr Finding top-m leading records in temporal data
title_full_unstemmed Finding top-m leading records in temporal data
title_sort finding top-m leading records in temporal data
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/etd_coll/422
https://ink.library.smu.edu.sg/context/etd_coll/article/1420/viewcontent/GPIS_AY2019_MbR_Wang_Yiyi.pdf
_version_ 1770567780575215616