Database Paper Browser

Back to papers

Throughput-Competitive Admission Control for Continuous Media Databases

Summary: Competitive analysis of online admission control for continuous-media DBs: tight upper bound on work-conserving policy (in A,p) and Ω((log A)/(1−p)) lower bound, exposing an exponential gap. Design near-optimal bandwidth prepartitioning (≈log A) and a popularity-aware partitioning policy with experiments; applicable to CM data placement and load balancing. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1133
Venue
PODS
Year
1998
Pagerank
4.1945683e-05
Overall Rank
12,726 | 11.47%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4,313 An Online Video Placement Policy based on Bandwidth to Space Ratio (BSR) 1995 SIGMOD 6.2885419e-05
12,777 Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases 1997 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers