Efficiency of the relational database tuple access

Relational databases form the core part of the data management in current information systems. The number of data is still rising and the structure is more and more complicated and evolving. If the data are bordered by the time spectrum, problem is even deeper. This paper deals with the relational database system architecture and proposes own techniques for optimizing data location and access to the tuples to get relevant data effectively in a proper time. Own proposed solution is based on limiting the impact of the whole table scanning necessity. Thanks to that, the performance is significantly shifted and improved, whereas, in our solution, index approach can be always used, since each data row is delimited by the primary key definition.