We propose a new data structure for ordered unidimensional indices. This structure is very compact, segmented, flexible and suitable both for memory databases and parallel processing. Results are compared with the ones for compact 0-complete trees.