In a distributed system,the data storage structure directly affects the storage efficiency andprocessing performance of big data.In the row store structure,the data is loaded locally and thespeed is fast,but it also loads additional columns,and it’s hard to compress.The column storestructure has high compression efficiency,but it has additional network transferring overhead.To overcometheir storages and improve the data storage structure,this paper presents a new data storagestructure combining row and column.The experiment result shows that it’s inferior a little in dataloading to the row store structure,and it has high compression efficiency comparing with the row storestructure and column store structure.It not only avoids additional disk I/O,but also cuts down theunnecessary network transfer time in column store.So,the row-column store can greatly improve bigdata storage and processing performance in distributed system.