@inproceedings{f49a254c117e4e2ca5ec16ceed1b05c1,
title = "On Two Kinds of Dataset Decomposition",
abstract = "We consider a Cartesian decomposition of datasets, i.e. finding datasets such that their unordered Cartesian product yields the source set, and some natural generalization of this decomposition. In terms of relational databases, this means reversing the SQL CROSS JOIN and INNER JOIN operators (the last is equipped with a test verifying the equality of a tables attribute to another tables attribute). First we outline a polytime algorithm for computing the Cartesian decomposition. Then we describe a polytime algorithm for computing a generalized decomposition based on the Cartesian decomposition. Some applications and relating problems are discussed.",
keywords = "Compactification, Data analysis, Databases, Decision tables, Decomposition, Functional dependency, Knowledge discovery, Optimization of boolean functions, DISCOVERY",
author = "Pavel Emelyanov",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-93701-4_13",
language = "English",
isbn = "9783319937007",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "171--183",
editor = "Y Shi and H Fu and Y Tian and VV Krzhizhanovskaya and MH Lees and J Dongarra and PMA Sloot",
booktitle = "Computational Science – ICCS 2018 - 18th International Conference, Proceedings",
address = "Germany",
note = "18th International Conference on Computational Science, ICCS 2018 ; Conference date: 11-06-2018 Through 13-06-2018",
}