Understanding queries in a search database system

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 273-284

  Fagin, Ronald ^a   Kimelfeld, Benny ^a   Li, Yunyao ^a   Raghavan, Sriram ^a   Vaithyanathan, Shivakumar ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

auxiliary database; search database system

Indexed keywords

ABSTRACT NOTIONS; AUXILIARY DATABASE; DATABASE SEARCHES; POLYNOMIAL SPACE; POLYNOMIAL-TIME; SEARCH ALGORITHMS; SEARCH QUERIES;

LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; SEARCH ENGINES;

DATABASE SYSTEMS;

EID: 77954731844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807121     Document Type: Conference Paper

References (30)

1. B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, Parag, and S. Sudarshan. BANKS: Browsing and keyword searching in relational databases. In VLDB, pages 1083-1086. Morgan Kaufmann, 2002.
2. S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Tree pattern query minimization. VLDB J., 11(4):315-331, 2002.
3. J. Bear, D. J. Israel, J. Petit, and D. L. Martin. Using information extraction to improve document retrieval. In TREC, pages 367-377, 1997.
4. A. Z. Broder. A taxonomy of Web search. SIGIR Forum, 36(2):3-10, 2002.
5. Y. Chen, W. Wang, Z. Liu, and X. Lin. Keyword search on structured and semi-structured data. In SIGMOD Conference, pages 1005-1010. ACM, 2009.
6. M. R. Garey and D. S. Johnson. Two-processor scheduling with start-times and deadlines. SIAM J. Comput., 6(3):416-426, 1977.
7. M. R. Garey and D. S. Johnson. "Strong" NP-completeness results: Motivation, examples, and implications. J. ACM, 25(3):499-508, 1978.
8. K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword proximity search in complex data graphs. In SIGMOD Conference, pages 927-940. ACM, 2008.
9. M. A. Hearst. Direction-based text interpretation as an information access refinement. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 257-274. Erlbaum, Hillsdale, 1992.
10. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, pages 670-681. Morgan Kaufmann, 2002.
11. D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, 1988.
12. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, pages 505-516. ACM, 2005.
13. E. Kandogan, R. Krishnamurthy, S. Raghavan, S. Vaithyanathan, and H. Zhu. Avatar semantic search: a database approach to information retrieval. In SIGMOD Conference, pages 790-792. ACM, 2006.
14. B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS, pages 173-182. ACM, 2006.
15. B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search over data graphs. Inf. Syst., 33(4-5):335-359, 2008.
16. B. Klimt and Y. Yang. Introducing the Enron corpus. In CEAS, 2004.
17. R. Krishnamurthy, Y. Li, S. Raghavan, F. Reiss, S. Vaithyanathan, and H. Zhu. SystemT: a system for declarative information extraction. SIGMOD Record, 37(4):7-13, 2008.
18. E. L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18:401-405, 1972.
19. D. D. Lewis. Text representation for intelligent text retrieval: A classification-oriented view. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 179-197. Erlbaum, Hillsdale, 1992.
20. Y. Li, R. Krishnamurthy, S.Vaithyanathan, and H. V. Jagadish. Getting work done on the Web: supporting transactional queries. In SIGIR, pages 557-564. ACM, 2006.
21. Y. Luo, W. Wang, and X. Lin. SPARK: A keyword search engine on relational databases. In ICDE, pages 1552-1555. IEEE, 2008.
22. K. G. Murty. An algorithm for ranking all the assignments in order of increasing costs. Operations Research, 16:682-687, 1968.
23. B. Pang and L. Lee. Using very simple statistics for review search: An exploration. In Proceedings of COLING: Companion volume: Posters, pages 73-76, 2008.
24. G. Petasis, V. Karkaletsis, G. Paliouras, and C. D. Spyropoulos. Learning context-free grammars to extract relations from text. In ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, pages 303-307. IOS Press, 2008.
25. L. Qin, J. X. Yu, and L. Chang. Keyword search in databases: the power of RDBMS. In SIGMOD Conference, pages 681-694. ACM, 2009.
26. Y. Qiu and H.-P. Frei. Concept based query expansion. In SIGIR, pages 160-169. ACM, 1993.
27. F. Reiss, S. Raghavan, R. Krishnamurthy, H. Zhu, and S. Vaithyanathan. An algebraic approach to rule-based information extraction. In ICDE, pages 933-942. IEEE, 2008.
28. K. Sparck Jones. Assumptions and issues in text-based retrieval. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 157-177. Erlbaum, Hillsdale, 1992.
29. J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17:712-716, 1971.
30. H. Zhu, S. Raghavan, S. Vaithyanathan, and A. Löser. Navigating the intranet with high precision. In WWW, pages 491-500. ACM, 2007.