Abstract

The article describes the concept of a unified information space and an algorithm of its formation using a special information and computer system. The process of incoming object search in a unified information space is considered, which makes it possible to uniquely identify it by corresponding features. One of the main tasks of a unified information space is that each information object in it is uniquely identified. For this, the identification method was used, which is based on a step-by-step analysis of object characteristics. The method of parallel information object search in unified information spaces is proposed, when information object search will be conducted independently in all unified information spaces in parallel. Experimental studies of the method of parallel information object search in unified information spaces were conducted, on the basis of which the analysis of efficiency and incoming objects search time in unified information spaces was carried out. There was experimentally approved that the more parameters that describe the information object, the less the time of object identification depends on the length of the interval. Also, there was experimentally approved that the efficiency of the searching of the incoming objects in unified information spaces tends to a directly proportional relationship with a decrease in the length of the interval and an increase in the number of parameters, and vice versa.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.