Anastasios Zouzias
ABSTRACT
Businesses and large organizations accumulate increasingly large amounts of customer interaction data. Analysis of such data holds great importance for tasks such as strategic planning and orchestration of sales/marketing campaigns. However, discovery and analysis over heterogeneous enterprise data can be challenging. Primary reasons for this are dispersed data repositories, requirements for schema knowledge, and difficulties in using complex user interfaces. As a solution to the above, we propose a TEmplated Search paradigm (TES) for exploring relational data that combines the advantages of keyword search interfaces with the expressive power of question-answering systems. The user starts typing a few keywords and TES proposes data exploration questions in real time. A key aspect of our approach is that the questions displayed are diverse to each other and optimally cover the space of possible questions for a given question-ranking framework. Efficient exact and provably approximate algorithms are presented. We show that the Templated Search paradigm renders the potentially complex underlying data sources intelligible and easily navigable. We support our claims with experimental results on real-world enterprise data.
- S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. In Proc. ICDE, pages 5--16, 2002. Google Scholar
Digital Library
- ApacheFoundation. Lucene/solr. http://lucene.apache.org/solr, 2013.Google Scholar
- Z. Bao, B. Kimelfeld, and Y. Li. Automatic suggestion of query-rewrite rules for enterprise search. In Proc. SIGIR, pages 591--600, 2012. Google ScholarDigital Library
- G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In Proc. ICDE, pages 431--440, 2002. Google ScholarDigital Library
- S. Bhatia, D. Majumdar, and P. Mitra. Query suggestions in the absence of query logs. In Proc. SIGIR, pages 795--804, 2011. Google ScholarDigital Library
- J. Carbonell and J. Goldstein. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proc. SIGIR, pages 335--336, 1998. Google ScholarDigital Library
- B. Chandra and M. M. Halldórsson. Approximation algorithms for dispersion problems. J. Algorithms, 38(2):438--465, Feb. 2001. Google ScholarDigital Library
- R. Chandrasekaran and A. Daughety. Location on Tree Networks: P-Centre and n-Dispersion Problems. Mathematics of Operations Research, 6(1):50--57, 1981.Google ScholarDigital Library
- E. Chu, A. Baid, X. Chai, A. Doan, and J. Naughton. Combining keyword search and forms for ad hoc querying of databases. In Proc. SIGMOD, pages 349--360, 2009. Google ScholarDigital Library
- M. Curtiss, I. Becker, T. Bosman, S. Doroshenko, L. Grijincu, T. Jackson, S. Kunnatur, S. Lassen, P. Pronin, S. Sankar, et al. Unicorn: A system for searching the social graph. Proc. VLDB, 6(11):1150--1161, 2013. Google ScholarDigital Library
- V. Dang and B. W. Croft. Term level search result diversification. In Proc. SIGIR, pages 603--612, 2013. Google ScholarDigital Library
- V. Dang and W. B. Croft. Diversity by proportionality: An election-based approach to search result diversification. In Proc. SIGIR, pages 65--74, 2012. Google ScholarDigital Library
- E. Demidova, X. Zhou, and W. Nejdl. Efficient query construction for large scale data. In Proc. SIGIR, pages 573--582, 2013. Google ScholarDigital Library
- M. Drosou and E. Pitoura. Search result diversification. SIGMOD Rec., 39(1):41--47, Sept. 2010. Google ScholarDigital Library
- M. Drosou and E. Pitoura. DisC diversity: Result diversification based on dissimilarity and coverage. Proc. VLDB, 6(1):13--24, 2012. Google ScholarDigital Library
- G. J. Fakas, Z. Cai, and N. Mamoulis. Size-l object summaries for relational keyword search. Proc. VLDB, 5(3):229--240, Nov. 2011. Google ScholarDigital Library
- S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In Proc. WWW, pages 381--390, 2009. Google ScholarDigital Library
- R. Hassin, S. Rubinstein, and A. Tamir. Approximation algorithms for maximum dispersion. Operations Research Letters, 21(3):133--137, 1997. Google ScholarDigital Library
- V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient ir-style keyword search over relational databases. In Proc. VLDB, pages 850--861, 2003. Google ScholarDigital Library
- V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword Search in Relational Databases. In Proc. VLDB, pages 670--681, 2002. Google ScholarDigital Library
- M. Jayapandian and H. V. Jagadish. Automated creation of a forms-based database query interface. In Proc. VLDB, pages 695--709, 2008. Google ScholarDigital Library
- M. Jayapandian and H. V. Jagadish. Expressive query specification through form customization. In Proc. EDBT, pages 416--427, 2008. Google ScholarDigital Library
- K. S. Jones, S. Walker, and S. E. Robertson. A probabilistic model of information retrieval: development and comparative experiments - part 1. Inf. Process. Manage., 36(6):779--808, 2000. Google ScholarDigital Library
- B. Korte and D. Hausmann. An analysis of the greedy heuristic for independence systems. In P. H. B. Alspach and D. Miller, editors, Algorithmic Aspects of Combinatorics, volume 2 of Annals of Discrete Mathematics, pages 65--74. Elsevier, 1978.Google ScholarCross Ref
- Y. Lei, V. S. Uren, and E. Motta. SemSearch: A Search Engine for the Semantic Web. In Proc. EKAW, pages 238--245, 2006. Google ScholarDigital Library
- X. Li and M. Boucher. Under the hood: The natural language interface of graph search. http://goo.gl/bPlHb, 2013.Google Scholar
- Y. Papakonstantinou, M. Petropoulos, and V. Vassalos. QURSED: querying and reporting semistructured data. In Proc. SIGMOD, pages 192--203, 2002. Google ScholarDigital Library
- A.-M. Popescu, O. Etzioni, and H. Kautz. Towards a theory of natural language interfaces to databases. In Proc. IUI, pages 149--157, 2003. Google ScholarDigital Library
- J. Pound, S. Paparizos, and P. Tsaparas. Facet discovery for structured web search: a query-log mining approach. In Proc. SIGMOD, pages 169--180, 2011. Google ScholarDigital Library
- S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Operations Research, 42(2):pp. 299--310, 1994.Google ScholarDigital Library
- I. Robinson, J. Webber, and E. Eifrem. Graph Databases. O'Reilly Media, Incorporated, 2013. Google ScholarDigital Library
- S. Sankar. Under the hood: Indexing and ranking in graph search. http://goo.gl/jHKCK, March 14 2013.Google Scholar
- N. Sarkas, S. Paparizos, and P. Tsaparas. Structured annotations of web queries. In Proc. SIGMOD, pages 771--782, 2010. Google ScholarDigital Library
- S. Tata and G. M. Lohman. SQAK: doing more with keywords. In Proc. SIGMOD, pages 889--902, 2008. Google ScholarDigital Library
- A. Termehchy and M. Winslett. Keyword search for data-centric xml collections with long text fields. In Proc. EDBT, pages 537--548, 2010. Google ScholarDigital Library
- P. Wu, Y. Sismanis, and B. Reinwald. Towards keyword-driven analytical processing. In Proc. SIGMOD, pages 617--628, 2007. Google ScholarDigital Library
- X. Yang, C. M. Procopiuc, and D. Srivastava. Recommending join queries via query log analysis. In Proc. ICDE, pages 964--975, 2009. Google ScholarDigital Library
- W. Zheng, H. Fang, and C. Yao. Exploiting concept hierarchy for result diversification. In Proc. CIKM, pages 1844--1848, 2012. Google ScholarDigital Library
Index Terms
- Templated Search over Relational Databases
Recommendations
Scalable top-k keyword search in relational databases
DASFAA'12: Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part IIKeyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. There would be a huge number of ...
Effective Keyword Search over Relational Databases Considering Keywords Proximity and Keywords N-grams
DEXA '11: Proceedings of the 2011 22nd International Workshop on Database and Expert Systems ApplicationsThe current amount of text data in relational databases is massive and is growing fast. This increases the importance and need for non-technical users to be able to search for such information using a simple keyword search. Researchers have studied and ...
Effective keyword search in relational databases
SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of dataWith the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the major RDBMSs have provided full-text search capabilities, they still ...
Comments