PreCN: Preprocessing Candidate Networks for Efficient Keyword Search over Databases
暂无分享,去创建一个
[1] Martin Bergman,et al. The deep web:surfacing the hidden value , 2000 .
[2] Jennifer Widom,et al. Indexing relational database content offline for efficient keyword-based search , 2005, 9th International Database Engineering & Application Symposium (IDEAS'05).
[3] S. Sudarshan,et al. Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.
[4] Ji-Jun Wen. SEEKER: Keyword-Based Information Retrieval over Relational Databases , 2005 .
[5] Shan Wang,et al. Searching Databases with Keywords , 2005, Journal of Computer Science and Technology.
[6] Vagelis Hristidis,et al. DISCOVER: Keyword Search in Relational Databases , 2002, VLDB.
[7] Michael K. Bergman. White Paper: The Deep Web: Surfacing Hidden Value , 2001 .
[8] Surajit Chaudhuri,et al. DBXplorer: a system for keyword-based search over relational databases , 2002, Proceedings 18th International Conference on Data Engineering.
[9] Jun Zhang,et al. CLASCN: Candidate Network Selection for Efficient Top-k Keyword Queries over Databases , 2007, Journal of Computer Science and Technology.
[10] Luis Gravano,et al. Efficient IR-Style Keyword Search over Relational Databases , 2003, VLDB.
[11] Amanda Spink,et al. Real life, real users, and real needs: a study and analysis of user queries on the web , 2000, Inf. Process. Manag..
[12] S. Sudarshan,et al. Bidirectional Expansion For Keyword Search on Graph Databases , 2005, VLDB.