Abstract

Today, data exploration platforms are widely used to assist users in locating interesting objects within large volumes of scientific and business data. In those platforms, users try to make sense of the underlying data space by iteratively posing numerous queries over large databases. While diversification of query results, like other data summarization techniques, provides users with quick insights into the huge query answer space, it adds additional complexity to an already computationally expensive data exploration task. To address this challenge, in this paper we propose a diversification scheme that targets the problem of efficiently diversifying the results of multiple queries within and across different data exploratory sessions. Our proposed scheme relies on a model-based diversification method and an ordered cache. In particular, we employ an adaptive regression model to estimate the diversity of a diverse subset. Such estimation of diversity value allows us to select diverse results without scanning all the query results. In order to further expedite the diversification process, we propose an order-based caching scheme to leverage the overlap between sequence of data exploration queries. Our extensive experimental evaluation on both synthetic and real data sets shows the significant benefits provided by our scheme as compared to the existing methods.

Details

Title
Model-Based Diversification for Sequential Exploratory Queries
Author
Khan, Hina A 1 ; Sharaf, Mohamed A 1 

 University of Queensland, Brisbane, Australia (GRID:grid.1003.2) (ISNI:0000 0000 9320 7537) 
Pages
151-168
Publication year
2017
Publication date
Jun 2017
Publisher
Springer Nature B.V.
e-ISSN
2364-1541
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2407551588
Copyright
© The Author(s) 2017. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.