New Data Structure for Many-to-Many Relations to Reduce Data Size, Recording Time, and Search Time

This paper proposes a new data structure that reduces data sizes for data in which two item types have many-to-many relations, with the aim of reducing data recording and search times. The proposed data structure newly introduces container variables related to many values of both items, and these container variables record many-to-many relations between them. The proposed data structure maintains data normalization and integrity and is independent of the indexing method conventionally used for the relational database, so both can be used simultaneously. Simulation results shows that data size, recording time search time using the proposed data are smaller than those using the conventional data structure. Especially, search time is extremely shortened when searching in main memory, which is often used for data search on NoSQL, such as Key-Value systems.