Progressive keyword search in relational databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 1183-1186

  Li, Guoliang ^a   Zhou, Xiaofang ^b   Feng, Jianhua ^a   Wang, Jianyong ^a  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

KEYWORD QUERIES; KEYWORD SEARCH; NEW CONCEPT; NP-HARD; PROCESSING CAPABILITY; RELATIONAL DATABASE; SEARCH EFFICIENCY; STATE-OF-THE-ART APPROACH; STEINER TREE PROBLEM; STEINER TREES;

COMPUTATIONAL COMPLEXITY; INDEXING (MATERIALS WORKING); ONLINE SEARCHING;

GRAPH THEORY;

EID: 67649671761     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.196     Document Type: Conference Paper

References (7)

1. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, "Keyword searching and browsing in databases using banks," in ICDE, 2002, pp. 431-440.
2. V. Hristidis, L. Gravano, and Y. Papakonstantinou, "Efficient ir-style keyword search over relational databases," in VLDB, 2003, pp. 850-861.
3. G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," in SODA, 2000.
4. S. M. Beitzel, E. C. Jensen, A. Chowdhury, D. Grossman, and O. Frieder, "Analysis of a very large web search engine query," in SIGIR, 2004.
5. F. Aurenhammer, "Voronoi diagrams: a survey of a fundamental data structure," in ACM Computing Surveys, 23:345-405, 1991.
6. H. He, H. Wang, J. Yang, and P. Yu, "Blinks: Ranked keyword searches on graphs," in SIGMOD, 2007.
7. G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou, "Ease: Efficient and adaptive keyword search on unstructured, semi-structured and structured data," in SIGMOD, 2008.