BROAD: Diversified keyword search in databases

Proceedings of the VLDB Endowment

Volumn 4, Issue 12, 2011, Pages 1355-1358

  Zhao, Feng ^a   Zhang, Xiaolong ^b   Tung, Anthony K H ^a   Chen, Gang ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER TREE; DATABASE COMMUNITY; HIERARCHICAL BROWSING; KEYWORD SEARCH; STANDARD SOLUTIONS; SYSTEM PARTITION; EFFECTIVE APPROACHES; REDUNDANCY PROBLEMS;

FORESTRY; SEARCH ENGINES; QUERY PROCESSING;

DATABASE SYSTEMS;

DATA BASES; HIERARCHICAL SYSTEMS; PERFORMANCE;

EID: 84862600441     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (6)

1. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML, pages 97-104, 2006.
2. E. Demidova, P. Fankhauser, X. Zhou, and W. Nejdl. DivQ: diversification for keyword search over structured databases. In SIGIR, pages 331-338, 2010.
3. S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In WWW, pages 381-390, 2009.
4. 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, 2005.
5. S. Vishwanathan and A. Smola. Fast kernels for string and tree matching. Kernel methods in computational biology, pages 113-130, 2004.
6. F. Zhao, X. Zhang, Anthony K.H. Tung, and G. Chen. BROAD:Diversified Keyword Search in Databases. Technical report, TRD3/11, School of Computing, NUS.