Abstract. The algorithms implementing intersection, union, and difference in table algebras are investigated. Modifications of the most common algorithms reducing the amount of computation are proposed. Based on the evaluated complexities in the worst case and in the average for the modified algorithms, the fastest algorithm for each operation is found. The program experimentally confirming the theoretical estimates is developed.
Keywords: complexity of algorithms, database, table algebra.
1Taras Shevchenko National University of Kyiv, Kyiv, Ukraine
2Taras Shevchenko National University of Kyiv, Kyiv, Ukraine,
e-mail: dmitriybuy@mail.ru; buy@unicyb.kiev.ua.
3Taras Shevchenko National University of Kyiv, Kyiv, Ukraine,
e-mail: Iren_kiss@mail.ru.
4Taras Shevchenko National University of Kyiv, Kyiv, Ukraine,
e-mail: senchenko_as@mail.ru.