Trixel Indexer using B-Trees based on a random access file

Abstract

Indexers are software tools to help complete words, phrases, or obtain text or multimedia files such as pictures, audio, videos, etc. in a quick way. The goal of indexing is to reduce the cost of file recovery, by reducing the number of I/O operations to the hard disk. In this paper a different common indexing approach is proposed to this end using references to geospatial positions, i.e. points located on the surface of the earth sphere. With that relationship between the Hierarchical Triangular Mesh algorithm is establish, and the system of latitude-longitude coordinates for indexing the geospatial parameters used by indexers today. The indexer implemented uses a B-Tree as search engine, where each node has internally another index to generate the reference to files that are stored on the server side, which database used is a random access file. Finally, some examples are shown, how the set of trixels is obtained from a file indexing is also expanding the random access file is displayed when it approaches its limit defined in bytes.