Two Database Related Interpretations of Rough Approximations: Data Organization and Query Execution

Authors:
Dominik Ślęzak;Piotr Synak;Arkadiusz Wojna;Jakub Wróblewski
Affiliations:
Institute of Mathematics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland and Infobright Inc., ul. Krzywickiego 34 lok. 219, 02-078 Warsaw, Poland. slezak@{mimuw.edu.pl,infobright.com};Infobright Inc., ul. Krzywickiego 34 lok. 219, 02-078 Warsaw, Poland. {synak,arek.wojna,jakubw}@infobright.com;Infobright Inc., ul. Krzywickiego 34 lok. 219, 02-078 Warsaw, Poland. {synak,arek.wojna,jakubw}@infobright.com;Infobright Inc., ul. Krzywickiego 34 lok. 219, 02-078 Warsaw, Poland. {synak,arek.wojna,jakubw}@infobright.com
Venue:
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Year:
2013

Citing 9
Cited 0

From rough set theory to evidence theory

Advances in the Dempster-Shafer theory of evidence
Uncertainly measures of rough set prediction

Artificial Intelligence
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
On Databases with Incomplete Information

Journal of the ACM (JACM)
Rough set methods in feature selection and recognition

Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Adaptive query processing

Foundations and Trends in Databases
Brighthouse: an analytic data warehouse for ad-hoc queries

Proceedings of the VLDB Endowment
Approximate boolean reasoning: foundations and applications in data mining

Transactions on Rough Sets V
Soft clustering -- Fuzzy and rough approaches and their extensions and derivatives

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present analytic data processing technology derived from the principles of rough sets and granular computing. We show how the idea of approximate computations on granulated data has evolved toward complete product supporting standard analytic database operations and their extensions. We refer to our previous works where our query execution algorithms were described in terms of iteratively computed rough approximations. We explain how to interpret our data organization methods in terms of classical rough set notions such as reducts and generalized decisions.