An (n, k, d; r)q -locally repairable code (LRC) is called a Singleton-optimal LRC if it achieves the Singleton-type bound. Analogous to the classical MDS conjecture, the maximal length problem of Singleton-optimal LRCs has attracted a lot of attention in recent years. In this paper, we give an improved upper bound for the length of q -ary Singleton-optimal LRCs with disjoint repair groups such that ( r + 1) | n based on the parity-check matrix approach. In particular, for any Singleton-optimal (n, k, d; r)q -LRCs, we show that: i) n ≤ q+d -4, when r =2 and d =3 e +8 with e ≥ 0; ii) n ≤( r +1)⌊2( q 2 + q +1)/ r ( r +1)+ e +1⌋, when d ≥ 8 and max {3, d-e -6/ e +1} ≤ r ≤ d-e -3/ e +1 for any 0 ≤ e ≤⌊ d -6/4⌋. Furthermore, we establish equivalent connections between the existence of Singleton-optimal (n, k, d; r)q -LRCs for d =6, r =3 and d =7, r =2 with disjoint repair groups and some subsets of lines in finite projective space with certain properties. Consequently, we prove that the length of q-ary Singletonoptimal LRCs with minimum distance d=6 and locality r =3 is upper bounded by O ( q 1.5 ). We construct Singleton-optimal (8 ≤ n ≤ q +1, k , d =6, r =3) q -LRC with disjoint repair groups such that 4 | n and determine the exact value of the maximum code length for some specific q . We also prove the existence of (n, k, d=7; r=2)q -Singleton-optimal LRCs for n ≈ √2 q .