Nominative data with ordered set of names
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
683 2
Ultima descărcare din IBN:
2017-09-04 08:40
Căutarea după subiecte
similare conform CZU
[510.6+519.6]:004.42 (1)
Logică matematică (18)
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123)
Programe. Software (293)
SM ISO690:2012
SKOBELEV, Volodymyr, IVANOV, Ievgen, NIKITCHENKO, Mykola. Nominative data with ordered set of names. In: Computer Science Journal of Moldova, 2017, nr. 2(74), pp. 195-216. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(74) / 2017 / ISSN 1561-4042 /ISSNe 2587-4330

Nominative data with ordered set of names
CZU: [510.6+519.6]:004.42

Pag. 195-216

Skobelev Volodymyr1, Ivanov Ievgen2, Nikitchenko Mykola2
 
1 V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine,
2 Taras Shevchenko National University of Kyiv
 
Proiecte:
 
Disponibil în IBN: 14 august 2017


Rezumat

In the paper we analyze the set of nominative sets, which can be considered as some mathematical model for data used in computing systems, under assumption that the set of names is linearly ordered. We design algorithms, implemented for execution of basic set-theoretic operations on this set of nominative sets under assumption that nominative sets are presented by doubly linked lists with the order of names in increasing strength. The worstcase time complexity under logarithmic weight for the designed algorithms is investigated in detail. Applications of presented results for table algebras, which are mathematical models, intended for developing and theoretic analysis of relational databases, as well as of associated query languages, are proposed. The obtained results can be used in formal software development.

Cuvinte-cheie
nominative set, nominative data, linear ordering, set-theoretic operations, time complexity of algorithms