Cartesian decomposition in data analysis

Pavel Emelyanov; Denis Ponomaryov

doi:10.1109/SSDSE.2017.8071964

Cartesian decomposition in data analysis

Кафедра программирования ММФ

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

4 Цитирования (Scopus)

Аннотация

We consider the Cartesian decomposition of relational data sets, i.e. the problem of finding two or several data sets such that their unordered Cartesian product equals the source set. In terms of relational databases, this means reversing the SQL CROSS JOIN operator. We describe a polytime algorithm for computing a Cartesian decomposition based on factorization of boolean polynomials. We provide an implementation of the algorithm in Transact SQL and discuss some generalizations of the Cartesian decomposition.

Язык оригинала	английский
Название основной публикации	Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017
Издатель	Institute of Electrical and Electronics Engineers Inc.
Страницы	55-60
Число страниц	6
ISBN (электронное издание)	9781538615935
DOI	https://doi.org/10.1109/SSDSE.2017.8071964
Состояние	Опубликовано - 18 окт 2017
Событие	2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017 - Novosibirsk, Akademgorodok, Российская Федерация Продолжительность: 12 апр 2017 → 13 апр 2017

Конференция

Конференция	2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017
Страна	Российская Федерация
Город	Novosibirsk, Akademgorodok
Период	12.04.2017 → 13.04.2017

Доступ к документу

10.1109/SSDSE.2017.8071964

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Cartesian decomposition in data analysis». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@inproceedings{4ff59076afd040e8803a2c9851a5e849,

title = "Cartesian decomposition in data analysis",

abstract = "We consider the Cartesian decomposition of relational data sets, i.e. the problem of finding two or several data sets such that their unordered Cartesian product equals the source set. In terms of relational databases, this means reversing the SQL CROSS JOIN operator. We describe a polytime algorithm for computing a Cartesian decomposition based on factorization of boolean polynomials. We provide an implementation of the algorithm in Transact SQL and discuss some generalizations of the Cartesian decomposition.",

keywords = "Data Analysis, Databases, Partitioning Algorithms",

author = "Pavel Emelyanov and Denis Ponomaryov",

year = "2017",

month = oct,

day = "18",

doi = "10.1109/SSDSE.2017.8071964",

language = "English",

pages = "55--60",

booktitle = "Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017 ; Conference date: 12-04-2017 Through 13-04-2017",

}

Emelyanov, P & Ponomaryov, D 2017, Cartesian decomposition in data analysis. в Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017., 8071964, Institute of Electrical and Electronics Engineers Inc., стр. 55-60, 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017, Novosibirsk, Akademgorodok, Российская Федерация, 12.04.2017. https://doi.org/10.1109/SSDSE.2017.8071964

Cartesian decomposition in data analysis. / Emelyanov, Pavel ; Ponomaryov, Denis.

Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017. Institute of Electrical and Electronics Engineers Inc., 2017. стр. 55-60 8071964.

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

TY - GEN

T1 - Cartesian decomposition in data analysis

AU - Emelyanov, Pavel

AU - Ponomaryov, Denis

PY - 2017/10/18

Y1 - 2017/10/18

N2 - We consider the Cartesian decomposition of relational data sets, i.e. the problem of finding two or several data sets such that their unordered Cartesian product equals the source set. In terms of relational databases, this means reversing the SQL CROSS JOIN operator. We describe a polytime algorithm for computing a Cartesian decomposition based on factorization of boolean polynomials. We provide an implementation of the algorithm in Transact SQL and discuss some generalizations of the Cartesian decomposition.

AB - We consider the Cartesian decomposition of relational data sets, i.e. the problem of finding two or several data sets such that their unordered Cartesian product equals the source set. In terms of relational databases, this means reversing the SQL CROSS JOIN operator. We describe a polytime algorithm for computing a Cartesian decomposition based on factorization of boolean polynomials. We provide an implementation of the algorithm in Transact SQL and discuss some generalizations of the Cartesian decomposition.

KW - Data Analysis

KW - Databases

KW - Partitioning Algorithms

UR - http://www.scopus.com/inward/record.url?scp=85040374812&partnerID=8YFLogxK

U2 - 10.1109/SSDSE.2017.8071964

DO - 10.1109/SSDSE.2017.8071964

M3 - Conference contribution

AN - SCOPUS:85040374812

SP - 55

EP - 60

BT - Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017

Y2 - 12 April 2017 through 13 April 2017

ER -