Most computer applications require efficient management of data and fast execution of basic tile operations over large data volumes . Specifically, In real-time environment applications are faced with severe constraints for total execution time of basic operations. This paper introduce method for physical organization of large database tiles, based on order preserving hashing scheme. Hushing scheme combines two functions: an order preserving and an ordinary hushing function . An original set of algorithms take advantage of implemented physical organization to achieve efficient basic file operations. Proposed method guarantee retrieval of any record in a single disk access, and minimum number of disk accesses for range search and key sequential operations for large dynamic files.