NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1)
This paper introduces a novel approach for storing Resource Description Framework (RDF) data based on the possibilities of Natural Language Addressing (NLA) and on a special NLA basic structure for storing Big Data, called “NLA-bit”, which is aimed to support middle-size or large distributed RDF tri...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Big Data and Cognitive Computing |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-2289/5/1/8 |
| _version_ | 1797395424817971200 |
|---|---|
| author | Krasimira Borislavova Ivanova |
| author_facet | Krasimira Borislavova Ivanova |
| author_sort | Krasimira Borislavova Ivanova |
| collection | DOAJ |
| description | This paper introduces a novel approach for storing Resource Description Framework (RDF) data based on the possibilities of Natural Language Addressing (NLA) and on a special NLA basic structure for storing Big Data, called “NLA-bit”, which is aimed to support middle-size or large distributed RDF triple or quadruple stores with time complexity O(1). The main idea of NLA is to use letter codes as coordinates (addresses) for data storing. This avoids indexing and provides high-speed direct access to the data with time complexity O(1). NLA-bit is a structured set of all RDF instances with the same “Subject”. An example based on a document system, where every document is stored as NLA-bit, which contains all data connected to it by metadata links, is discussed. The NLA-bits open up a wide field for research and practical implementations in the field of large databases with dynamic semi-structured data (Big Data). Important advantages of the approach are as follow: (1) The reduction of the amount of occupied memory due to the complete absence of additional indexes, absolute addresses, pointers, and additional files; (2) reduction of processing time due to the complete lack of demand—the data are stored/extracted to/from a direct address. |
| first_indexed | 2024-03-09T00:35:18Z |
| format | Article |
| id | doaj.art-3b60ce894e3a4c019e7d30be376e7836 |
| institution | Directory Open Access Journal |
| issn | 2504-2289 |
| language | English |
| last_indexed | 2024-03-09T00:35:18Z |
| publishDate | 2021-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Big Data and Cognitive Computing |
| spelling | doaj.art-3b60ce894e3a4c019e7d30be376e78362023-12-11T18:13:19ZengMDPI AGBig Data and Cognitive Computing2504-22892021-02-0151810.3390/bdcc5010008NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1)Krasimira Borislavova Ivanova0Information Technology Department, University of Telecommunications and Post, 1700 Sofia, BulgariaThis paper introduces a novel approach for storing Resource Description Framework (RDF) data based on the possibilities of Natural Language Addressing (NLA) and on a special NLA basic structure for storing Big Data, called “NLA-bit”, which is aimed to support middle-size or large distributed RDF triple or quadruple stores with time complexity O(1). The main idea of NLA is to use letter codes as coordinates (addresses) for data storing. This avoids indexing and provides high-speed direct access to the data with time complexity O(1). NLA-bit is a structured set of all RDF instances with the same “Subject”. An example based on a document system, where every document is stored as NLA-bit, which contains all data connected to it by metadata links, is discussed. The NLA-bits open up a wide field for research and practical implementations in the field of large databases with dynamic semi-structured data (Big Data). Important advantages of the approach are as follow: (1) The reduction of the amount of occupied memory due to the complete absence of additional indexes, absolute addresses, pointers, and additional files; (2) reduction of processing time due to the complete lack of demand—the data are stored/extracted to/from a direct address.https://www.mdpi.com/2504-2289/5/1/8Big DataNatural Language AddressingNLA-bitDBMS time complexity O(1) |
| spellingShingle | Krasimira Borislavova Ivanova NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) Big Data and Cognitive Computing Big Data Natural Language Addressing NLA-bit DBMS time complexity O(1) |
| title | NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) |
| title_full | NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) |
| title_fullStr | NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) |
| title_full_unstemmed | NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) |
| title_short | NLA-Bit: A Basic Structure for Storing Big Data with Complexity O(1) |
| title_sort | nla bit a basic structure for storing big data with complexity o 1 |
| topic | Big Data Natural Language Addressing NLA-bit DBMS time complexity O(1) |
| url | https://www.mdpi.com/2504-2289/5/1/8 |
| work_keys_str_mv | AT krasimiraborislavovaivanova nlabitabasicstructureforstoringbigdatawithcomplexityo1 |