Analysis of query processing in distributed database systems with fully replicated files: A hierarchical approach

DOI10.1016/0166-5316(88)90005-3zbMath0645.68055OpenAlexW2047010675MaRDI QIDQ3789073

Olivia R. Liu Sheng, Ushio Sumita

Publication date: 1988

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(88)90005-3

zbMATH Keywords

queueing theorypreemptive prioritydistributed database systemhierarchical approachnetwork processingergodic response timesfully replicated filelocal processing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)

Related Items (3)

A preemptive repeat priority queue with resampling: performance analysis ⋮ The discrete-time preemptive repeat identical priority queue ⋮ From exhaustive vacation queues to preemptive priority queues with general interarrival times

This page was built for publication: Analysis of query processing in distributed database systems with fully replicated files: A hierarchical approach