… of finding objects with durable quality over time in historical time series databases. For …
during a time interval. We first study the durable top-k (DTop-k) query that operates on a historical …

… query, we can ask for its “durability,” or intuitively, how long (or how often) it was valid in the
past… Time series for objects from different groups are parameterized with different c values: …

… all time series data inserted in the past 26 hours fit into 1.3TB of RAM evenly distributed across
20 … If all in-memory copies of data are lost, our engineers can still query the more durable …

… to decompose a durable query into a set of simple top-k queries and one durable query with
… interval [tb, te) (which is contained in the history), the problem is to find the time-series that …

… While many time series databases support aggregate queries, … Providing historic data queries
in this way ensures that all … The storage provider component wraps an underlying durable …

… We consider a class of queries called durability prediction queries … given predictive model to
answer questions about possible futures to … Durable queries over historical time series. IEEE …

… and we show how to handle … or ‘jind cases in the past that resemble … Next, we show how
to reduce the volume of the query region and subsequently, the number of false alarms. Without …

… pattern-matching algorithm as part of physical query … the Durable Graph Pattern Query
Language (DGPQL), a query language that facilitates concise and flexible queries for durable …

… processing of durable top-k queries over temporal data with … to process durable top-k queries
over non-synchronized temporal … [13] studied DTop-k queries over times series data. They …

… -Index (Pruned Historical Core-Index) to answer historical 𝑘core queries. PHC-Index is …
query time window. We answer the historical 𝑘-core query by performing the containment query …