Abstract: The BigArM? is an access method for storing and accessing Big Data. It is under development. In this survey we present its mathematical and informational foundations as well as its requirements to realization characteristics. Firstly, we outline the needed basic mathematical concepts, the Names Sets, and hierarchies of named sets aimed to create a specialized model for organization of information bases called “Multi-Domain Information Model” (MDIM). The “Information Spaces” defined in the model are kind of strong hierarchies of enumerations (named sets). Further we remember the main features of hashing and types of hash tables as well as the idea of “Dynamic perfect hashing” and “Trie”, especially – the “Burst trie”. Hash tables and tries give very good starting point. The main problem is that they are designed as structures in the main memory which has limited size, especially in small desktop and laptop computers. To solve this problem, dynamic perfect hashing and burst tries will be realized as external memory structures in BigArM?.

Keywords: BigArM?, Big Data, Cloud computing.

ACM Keywords: D.4.3 File Systems Management, Access methods.

Link:

A SURVEY OF MATHEMATICAL AND INFORMATIONAL FOUNDATIONS OF THE BIGARM ACCESS METHOD

Krassimira Ivanova

http://www.foibg.com/ijitk/ijitk-vol09/ijitk09-03-p07.pdf