Durable queries over non-synchronized temporal data

Y Xie, W Weng, J Li - World Wide Web, 2023 - Springer
Temporal data are ubiquitous nowadays and efficient management of temporal data is of
key importance. A temporal data typically describes the evolution of an object over time. One …

Durable queries over historical time series

H Wang, Y Cai, Y Yang, S Zhang… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
This paper studies the problem of finding objects with durable quality over time in historical
time series databases. For example, a sociologist may be interested in the top 10 web …

Durable top-k queries on temporal data

J Gao, PK Agarwal, J Yang - Proceedings of the VLDB Endowment, 2018 - dl.acm.org
Many datasets have a temporal dimension and contain a wealth of historical information.
When using such data to make decisions, we often want to examine not only the current …

Durability Queries on Temporal Data

J Gao - 2020 - search.proquest.com
Temporal data is ubiquitous in our everyday life, but tends to be noisy and often exhibits
transient patterns. To make better decisions with data, we must avoid jumping to conclusions …

Durable top-k instant-stamped temporal records with user-specified scoring functions

J Gao, S Sintos, PK Agarwal… - 2021 IEEE 37th …, 2021 - ieeexplore.ieee.org
A way of finding interesting or exceptional records from instant-stamped temporal data is to
consider their" durability," or, intuitively speaking, how well they compare with other records …

Efficient indexing structure to handle durable queries through web crawling

RS Devi, D Manjula, V Sugumaran - Cluster Computing, 2016 - Springer
This paper studies efficient processing of durable top-k queries on historical time series
databases. Durable top-k queries, obtained as an extension of snapshot top-k queries …

Consistent top-k queries over time

ML Lee, W Hsu, L Li, WH Tok - … 2009, Brisbane, Australia, April 21-23 …, 2009 - Springer
Top-k queries have been well-studied in snapshot databases and data streams. We observe
that decision-makers are often interested in a set of objects that exhibit a certain degree of …

Distributed evaluation of top-k temporal joins

J Pilourdault, V Leroy, S Amer-Yahia - Proceedings of the 2016 …, 2016 - dl.acm.org
We study a particular kind of join, coined Ranked Temporal Join (RTJ), featuring predicates
that compare time intervals and a scoring function associated with each predicate to quantify …

AdpDM: Adaptive Data Model for Efficient Dynamic Management of Large-Scale High-Cardinality Time-Series Databases

Z Xu, S Huang, D Fei, L Yi, C Zhou, G Wang… - … on Database Systems …, 2024 - Springer
With advancements in Internet of Things (IoT) and performance monitoring, time-series
database have garnered significant attention. Time-series consists of two components …

Efficient Dictionary and Grid-Based Framework for Answering Durable k-Nearest Neighbor Queries on Time Series Data

BJ Santoso, DP Armunanta, BA Pratomo… - 2023 Asia Pacific …, 2023 - ieeexplore.ieee.org
With the massive amount of data generated, a data engineering method is needed to
process the data to obtain new information, which can later be used for further …