Nominative data with ordered set of names
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 nom...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2017-08-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v25-n2/v25-n2-(pp195-216).pdf |
| _version_ | 1811302185976201216 |
|---|---|
| author | Volodymyr G. Skobelev Ievgen Ivanov Mykola Nikitchenko |
| author_facet | Volodymyr G. Skobelev Ievgen Ivanov Mykola Nikitchenko |
| author_sort | Volodymyr G. Skobelev |
| collection | DOAJ |
| description | 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 worst-case 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. |
| first_indexed | 2024-04-13T07:23:31Z |
| format | Article |
| id | doaj.art-69913b895d6c4c9caee73130c6ace9be |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-13T07:23:31Z |
| publishDate | 2017-08-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-69913b895d6c4c9caee73130c6ace9be2022-12-22T02:56:32ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422017-08-01252(74)195216Nominative data with ordered set of namesVolodymyr G. Skobelev0Ievgen Ivanov1Mykola Nikitchenko2V.M. Glushkov Institute of Cybernetics of NAS of Ukraine, 40 Glushkova ave., Kyiv, Ukraine, 03187Taras Shevchenko National University of Kyiv, 01601, Kyiv, Volodymyrska st, 60Taras Shevchenko National University of Kyiv, 01601, Kyiv, Volodymyrska st, 60In 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 worst-case 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.http://www.math.md/files/csjm/v25-n2/v25-n2-(pp195-216).pdfnominative setnominative datalinear orderingset-theoretic operationstime complexity of algorithms |
| spellingShingle | Volodymyr G. Skobelev Ievgen Ivanov Mykola Nikitchenko Nominative data with ordered set of names Computer Science Journal of Moldova nominative set nominative data linear ordering set-theoretic operations time complexity of algorithms |
| title | Nominative data with ordered set of names |
| title_full | Nominative data with ordered set of names |
| title_fullStr | Nominative data with ordered set of names |
| title_full_unstemmed | Nominative data with ordered set of names |
| title_short | Nominative data with ordered set of names |
| title_sort | nominative data with ordered set of names |
| topic | nominative set nominative data linear ordering set-theoretic operations time complexity of algorithms |
| url | http://www.math.md/files/csjm/v25-n2/v25-n2-(pp195-216).pdf |
| work_keys_str_mv | AT volodymyrgskobelev nominativedatawithorderedsetofnames AT ievgenivanov nominativedatawithorderedsetofnames AT mykolanikitchenko nominativedatawithorderedsetofnames |