Affiliation:
1. Department of Computer Science, Stanford University
Abstract
Many papers have examined how to efficiently export a materialized view but to our knowledge none have studied how to efficiently import one. To import a view, i.e., to install a stream of updates, a real-time database system must process new updates in a timely fashion to keep the database "fresh," but at the same time must process transactions and ensure they meet their time constraints. In this paper, we discuss the various properties of updates and views (including staleness) that affect this tradeoff. We also examine, through simulation, four algorithms for scheduling transactions
and
installing updates in a soft real-time database.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Age-minimal CPU Scheduling;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20
2. Caching in Forschung und Industrie;Schnelles und skalierbares Cloud-Datenmanagement;2024
3. Trading Throughput for Freshness: Freshness-aware Traffic Engineering and In-Network Freshness Control;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2023-03-07
4. α–β AoI Penalty in Wireless-Powered Status Update Networks;IEEE Internet of Things Journal;2022-01-01
5. Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks;IEEE Transactions on Information Theory;2021-06