QueRIE: Collaborative Database Exploration

被引:44
作者
Eirinaki, Magdalini [1 ]
Abraham, Suju [2 ]
Polyzotis, Neoklis [3 ]
Shaikh, Naushin [4 ]
机构
[1] San Jose State Univ, Dept Comp Engn, San Jose, CA 95192 USA
[2] Lucille Packards Children Hosp, Palo Alto, CA 94301 USA
[3] Univ Calif Santa Cruz, Dept Comp Sci, Santa Cruz, CA 95064 USA
[4] Data Domain, EMC, Santa Clara, CA 95054 USA
关键词
Data mining; interactive data exploration and discovery; personalization;
D O I
10.1109/TKDE.2013.79
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Interactive database exploration is a key task in information mining. However, users who lack SQL expertise or familiarity with the database schema face great difficulties in performing this task. To aid these users, we developed the QueRIE system for personalized query recommendations. QueRIE continuously monitors the user's querying behavior and finds matching patterns in the system's query log, in an attempt to identify previous users with similar information needs. Subsequently, QueRIE uses these "similar" users and their queries to recommend queries that the current user may find interesting. In this work we describe an instantiation of the QueRIE framework, where the active user's session is represented by a set of query fragments. The recorded fragments are used to identify similar query fragments in the previously recorded sessions, which are in turn assembled in potentially interesting queries for the active user. We show through experimentation that the proposed method generates meaningful recommendations on real-life traces from the SkyServer database and propose a scalable design that enables the incremental update of similarities, making real-time computations on large amounts of data feasible. Finally, we compare this fragment-based instantiation with our previously proposed tuple-based instantiation discussing the advantages and disadvantages of each approach.
引用
收藏
页码:1778 / 1790
页数:13
相关论文
共 29 条
[1]   SQL QueRIE Recommendations [J].
Akbarnejad, Javad ;
Chatzopoulou, Gloria ;
Eirinaki, Magdalini ;
Koshy, Suju ;
Mittal, Sarika ;
On, Duc ;
Polyzotis, Neoklis ;
Varman, Jothi S. Vindhiya .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (02) :1597-1600
[2]  
Alon N., 1996, P 28 STOC NY NY US
[3]  
[Anonymous], 2009, ACM SIGM 2009 C
[4]  
Borzonyi S., 2001, P IEEE ICDE HEID GER
[5]  
Chatzopoulou G, 2009, LECT NOTES COMPUT SC, V5566, P3, DOI 10.1007/978-3-642-02279-1_2
[6]   Preference formulas in relational queries [J].
Chomicki, J .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2003, 28 (04) :427-466
[7]   Size-estimation framework with applications to transitive closure and reachability [J].
Cohen, E .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (03) :441-453
[8]  
Drosou M., 2011, P 20 ACM INT C INF K, P1547
[9]  
Giacometti A., 2009, P 11 INT C DAWAK LIN
[10]   Query Recommendations for OLAP Discovery-Driven Analysis [J].
Giacometti, Arnaud ;
Marcel, Patrick ;
Negre, Elsa ;
Soulet, Arnaud .
INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING, 2011, 7 (02) :1-25