In　relational　databases　and　their　applications,　it　is　one　of　important　issues　to　evaluate　multiple　range　Queries　concurrently.　For　this　issue,　the　authors　propose　a　new　method,　which　is　called　Region　Clustering　Method.　The　basic　idea　of　this　method　is　region　clustering　that　groups　the　search　regions　of　individual　range　Queries　into　larger　regions　and　retrieves　the　tuples　from　larger　regions.　This　method　avoids　having　the　same　region　accessed　multiple　times　and　reduces　the　number　of　random　I/O　accesses　to　the　underlying　databases.　Meanwhile,　it　does　not　suffer　much　feared　＇dimensionality　curse＇　as　this　method　remains　effective　for　high-dimensional　data.　Extensive　experiments　are　carried　out　to　measure　the　performance　of　this　new　strategy　and　the　results　indicate　that　it　is　significantly　better　than　the　nave　method　of　evaluating　these　Queries　one　by　one　for　both　low-dimensional　and　high-dimensional　data.