Reducing metadata complexity for faster table summarization

Kasim Candan, Mario Cataldi, Maria Luisa Sapino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users quickly explore large data sets. An effective summary needs to minimize the information loss due to the reduction in details. Summarization algorithms leverage the redundancy in the data to identify value and tuple clustering strategies that represent the (almost) same amount of information with a smaller number of data representatives. It has been shown that, when available, metadata, such as value hierarchies associated to the attributes of the tables, can help greatly reduce the resulting information loss. However, table summarization, whether carried out through data analysis performed on the table from scratch or supported through already available metadata, is an expensive operation. We note that the table summarization process can be significantly sped up when the metadata used for supporting the summarization itself is pre-processed to reduce the unnecessary details. The pre-processing of the metadata, however, needs to be performed carefully to ensure that it does not add significant amounts of additional loss to the table summarization process. In this paper, we propose a tRedux algorithm for value hierarchy pre-processing and reduction. Experimental evaluations show that, depending on the table and taxonomy complexity, metadata summarization can provide gains in table summarization time that can range (in absolute values) from seconds to 10s-of-1000s of seconds. Consequently, while resulting in only an extra ∼ 20% reduction in table quality, tRedux can provide ∼ 2x speedups in table summarization time. Experiments also show that tRedux has a better performance than alternative metadata reduction strategies in supporting table summarization; and, as the taxonomy complexity increases, the absolute gains of tRedux also increase.

Original languageEnglish (US)
Title of host publicationAdvances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings
Pages240-251
Number of pages12
DOIs
StatePublished - May 19 2010
Event13th International Conference on Extending Database Technology: Advances in Database Technology - EDBT 2010 - Lausanne, Switzerland
Duration: Mar 22 2010Mar 26 2010

Publication series

NameAdvances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Other

Other13th International Conference on Extending Database Technology: Advances in Database Technology - EDBT 2010
CountrySwitzerland
CityLausanne
Period3/22/103/26/10

    Fingerprint

Keywords

  • Metadata complexity
  • Table summarization
  • Taxonomy reduction

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Candan, K., Cataldi, M., & Sapino, M. L. (2010). Reducing metadata complexity for faster table summarization. In Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings (pp. 240-251). (Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings). https://doi.org/10.1145/1739041.1739072