Interactive data exploration with smart drill-down

2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016

Volumn , Issue , 2016, Pages 906-917

  Joglekar, Manas ^a   Garcia Molina, Hector ^a   Parameswaran, Aditya ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRILLS;

DRILL-DOWN; DYNAMIC SAMPLING; EXPERIMENTAL PROTOTYPE; INTERACTIVE DATA EXPLORATION; NP-HARD; OPTIMIZATION PROBLEMS; REAL DATA SETS; RELATIONAL TABLES;

OPTIMIZATION;

EID: 84980416413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2016.7498300     Document Type: Conference Paper

References (39)

1. http://statweb.stanford.edu/ tibs/ElemStatLearn/datasets/marketing.info.txt.
2. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. The aqua approximate query answering system. In SIGMOD'99, pages 574-576, 1999.
3. S. Agarwal, B. Mozafari, A. Panda, H. Milner, S. Madden, and I. Stoica. Blinkdb: Queries with bounded errors and bounded response times on very large data. In EuroSys, pages 29-42, 2013.
4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.
5. K. Bache and M. Lichman. UCI machine learning repository, 2013.
6. M. Bendre, B. Sun, X. Zhou, D. Zhang, S.-Y. Lin, K. Chang, and A. Parameswaran. Data-spread: Unifying databases and spreadsheets (demo). In VLDB, 2015.
7. A. Bosworth, J. Gray, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Technical report, Microsoft Research, 1995.
8. B. Bringmann, L. Katholieke, and A. Zimmermann. The chosen few: On identifying valuable patterns. In ICDM, 2007.
9. S. Bu, L. V. S. Lakshmanan, and R. T. Ng. Mdl summarization with holes. In VLDB, pages 433-444, 2005.
10. K. S. Candan, H. Cao, Y. Qi, and M. L. Sapino. Alphasum: sizeconstrained table summarization using value lattices. In EDBT, pages 96-107, 2009.
11. U. Cetintemel, M. Cherniack, J. DeBrabant, Y. Diao, K. Dimitriadou, A. Kalinin, O. Papaemmanouil, and S. B. Zdonik. Query steering for interactive data exploration. In CIDR, 2013.
12. T. De Bie, K.-N. Kontonasios, and E. Spyropoulou. A framework for mining interesting pattern sets. In Proceedings of the ACM SIGKDD Workshop on Useful Patterns, UP '10, 2010.
13. K. E. Gebaly, P. Agrawal, L. Golab, F. Korn, and D. Srivastava. Interpretable and informative explanations of outcomes. PVLDB, pages 61-72, 2014.
14. F. Geerts, B. Goethals, and T. Mielikinen. Tiling databases. In Discovery Science, pages 278-289, 2004.
15. B. Goethals, S. Moens, and J. Vreeken. Mime: A framework for interactive visual pattern mining. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '11, 2011.
16. L. Golab, H. Karloff, F. Korn, D. Srivastava, and B. Yu. On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endow., pages 376-390, 2008.
17. L. Golab, F. Korn, and D. Srivastava. Efficient and effective analysis of data quality using pattern tableaux. IEEE Data Eng. Bull., 34(3):26-33, 2011.
18. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages 1-12, 2000.
19. M. Joglekar, H. Garcia-Molina, and A. Parameswaran. http://arxiv.org/pdf/1412.0364.
20. M. Joglekar, H. Garcia-Molina, and A. G. Parameswaran. Smart drilldown: A new data exploration operator. PVLDB, 8(12):1928-1939, 2015.
21. R. Kalakota. Gartner: Bi and analytics a 12.2 billion market, july 2013 (retrieved october 30, 2014).
22. M. L. Kersten, S. Idreos, S. Manegold, and E. Liarou. The researcher's guide to the data deluge: Querying a scientific database in just a few seconds. In VLDB'11, 2011.
23. L. V. S. Lakshmanan, R. T. Ng, C. X. Wang, X. Zhou, and T. J. Johnson. The generalized mdl approach for summarization. In VLDB, pages 766-777, 2002.
24. M. Leeuwen and A. Knobbe. Diverse subgroup set discovery. Data Min. Knowl. Discov., 25, 2012.
25. M. Mampaey, N. Tatti, and J. Vreeken. Tell me what i need to know: Succinctly summarizing data with itemsets. In KDD, pages 573-581, 2011.
26. A. I. McLeod and D. R. Bellhouse. A convenient algorithm for drawing a simple random sample. Journal of the Royal Statistical Society. Series C (Applied Statistics), pages pp. 182-184, 1983.
27. R. J. Miller and Y. Yang. Association rules over interval data. In SIGMOD, pages 452-461, 1997.
28. S. Sarawagi. User-adaptive exploration of multidimensional data. In VLDB, pages 307-316, 2000.
29. S. Sarawagi. User-cognizant multidimensional analysis. The VLDB Journal, pages 224-239, 2001.
30. S. Sarawagi, R. Agrawal, and N. Megiddo. Discovery-driven exploration of olap data cubes. In EDBT, pages 168-182, 1998.
31. T. Sellam and M. L. Kersten. Meet charles, big data query advisor. In CIDR'13, pages-1-1, 2013.
32. L. Sidirourgos, M. Kersten, and P. Boncz. Scientific discovery through weighted sampling. In Big Data, 2013 IEEE International Conference on, pages 300-306, 2013.
33. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In SIGMOD, pages 1-12, 1996.
34. N. Tatti, F. Moerchen, and T. Calders. Finding robust itemsets under subsampling. ACM Trans. Database Syst., 39, 2014.
35. J. S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Softw., pages 37-57, 1985.
36. J. Vreeken, M. Leeuwen, and A. Siebes. Krimp: Mining itemsets that compress. Data Min. Knowl. Discov., 2011.
37. J. Wang, J. Han, Y. Lu, and P. Tzvetkov. Tfp: An efficient algorithm for mining top-k frequent closed itemsets. Knowledge and Data Engineering, IEEE Transactions on, pages 652-663, 2005.
38. Y. Xiang, R. Jin, D. Fuhry, and F. F. Dragan. Succinct summarization of transactional databases: An overlapped hyperrectangle scheme. In KDD, pages 758-766, 2008.
39. X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: A profile-based approach. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD '05, 2005.