In recent years, the research community has introduced various methods for processing spatio-temporal queries in road networks. In this paper, we present a novel type of spatio-temporal queries, named the continuous min-max distance bounded query (or CM
2DBQ for short). Given a moving query object q, a minimal distance d
m
, and a maximal distance d
M
, a CM
2DBQ retrieves the bounded objects
... [Show full abstract] whose road distances to q are within the range [d
m
, d
M
] at each time instant. The CM
2DBQ is indeed an important query with many real applications. We address the problem of processing the CM
2DBQ and propose two algorithms, named the Continuous Within Query-based (CWQ-based) algorithm and the CM
2DBQ algorithm, to efficiently determine the bounded objects at each time instant. Extensive experiments using real road network dataset demonstrate the efficiency of the proposed algorithms.