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

  • Tsuneo Kuwabara Kanagawa University
Keywords: Data Structure, Reducing Data Size, Reducing Search Time, Reducing Recording Time

Abstract

With the aim of reducing data recording and search times, this paper proposes a new data structure that reduces data sizes for data in which two item types have many-to-many relations. 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 indexing methods conventionally used for relational databases, allowing simultaneous use of both. Simulation results show that data sizes and recording times using the proposed data structure are smaller than those using conventional structures. Search times in the proposed method are much shorter than those under conventional methods when searching data in main memory, such as in the key–value systems often used for data searches in NoSQL, whereas search times under both methods are equivalent when searching data in a relational database. The reduced data size by the proposed data structure might show good performance in other data processing tasks, such as data transmission to other nodes or making copies.

References

Rajesh, N. ,”Database Management Systems (Second Edition)”. pp 51-67, PHI Learning Private Limited, New Delhi,(2012)

Joy L. Starks, Philip J. Pratt, Mary Z. Last,” Concepts of Database Management (Ninth edition)” , pp 138-141, Cengage, Boston (2018)

ISLAM A. K. M. Tauhidul, PRAMANIK Sakti, ZHU Qiang,”The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data Spaces”, IEICE Transactions on Information and Systems, E102.D(4), 745-758, (2019)

Motohashi,S., Kawano,T.,Tsurumi,T., ”BasicKnowledge of NOSQL”, pp154-158, pp171-174, RICTELWCOM, Tokyo (2012)

Watanabe, T., et.al. ,”A guide to NoSQL database for an enterprise-level RDB engineer”, pp 120-131, pp420-461, SHUWA SYSTEM, Tokyo (2016)

Kuwabara,T. ,” InformationSearchDevice,ProgramforSearch,Database-Updating Device, and Program for Updating Database”, Japan Patent No. 6269884, Kanagawa University (patentee), Filed May 19, 2017, Issued Jan. 12, 2018. (2018)

Kuwabara, T., ” New data structures to reduce searching time on databases”, Proceedings of the IEICE General Conference 2018 (Tokyo, Japan, March 20–23, 2018). The Institute of Electronics, Information and Communication Engineers, Tokyo, Japan, D-4-7, 28.(2018)

Kuwabara, T. ,” Information Search Device, Program for Search, Method for Updating Database, Database-Updating Device, and Program for Updating Database”, PCT Patent Application No. PCT/JP2018/018419, Kanagawa University (applicant), Filed May 11, 2018. (2018)

Kuwabara, T. ,”Data Structure, Information Search Device, Method for Updating Database, Database-Updating Device, and Program for Updating Database”, Japan Patent Application No. 2018-090308, Kanagawa University (applicant), Filed May 9, 2018. (2018)

Kuwabara, T. ,” New data structures to reduce data size and search time”, Proceedings of FIT2018 (Fukuoka, Japan, Sep. 19–21, 2018). The Institute of Electronics, Information and Communication Engineers, Tokyo, japan, and Information Processing Society of Japan, Tokyo, Japan, CD-001, No. 2, 1-4. (2018)

Kuwabara, T., ”New Data Structure for Many-to-Many Relations to Reduce Data Size, Recording Time, and Search Time”, 2020 9th International Congress on Advanced Applied Informatics, pp355-360, IIAI AAI (2020)

Published
2020-12-30
Section
Technical Papers (Data Science & Institutional Research)