INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES

METHODS OF INFORMATION SEARCH FOR UNSTRUCTURED DATA

Authors

  • Auezova A.S. International Information Technology University
  • Muratova K.N. International Information Technology University
  • Sinchev B. International Information Technology University

DOI:

https://doi.org/10.54309/IJICT.2021.05.1.011

Keywords:

search, method, algorithm, unstructured information, search engine, polynomial algorithms, NP-complete, big data

Abstract

The article discusses new methods used to solve the problem of information retrieval of unstructured (text) data. Search for documents is carried out by keywords in the natural language used in search engines. Thus, on the basis of polynomial algorithms, a universal multi-key sampling machine is created with improved time and space characteristics. This proposed machine can be used for processing big data in various areas of the economy. To achieve this goal, the new poly-nomial algorithms are based on the problem of the sum of subsets, which belongs to the NP-complete class. These algorithms are significantly more time and space efficient than the existing best polynomial and exponential algorithms.

Downloads

Download data is not yet available.

Downloads

Published

2021-03-15

How to Cite

Auezova A.S., Muratova K.N., & Sinchev B. (2021). METHODS OF INFORMATION SEARCH FOR UNSTRUCTURED DATA. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES, 2(1), 79–84. https://doi.org/10.54309/IJICT.2021.05.1.011

Issue

Vol. 2 No. 1 (2021): INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGIES

Section

Статьи

License

Copyright (c) 2021 International Journal of Information and Communication Technologies

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

https://creativecommons.org/licenses/by-nc-nd/3.0/deed.en