Querying communities in relational databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 724-735

  Qin, Lu ^a   Yu, Jeffrey Xu ^a   Chang, Lijun ^a   Tao, Yufei ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY IS; EFFICIENT ALGORITHM; INDUCED SUBGRAPH; KEYWORD QUERIES; KEYWORD SEARCH; PARTIAL INFORMATION; PERFORMANCE STUDY; REAL DATA SETS; RELATIONAL DATABASE; RUNTIME; STRUCTURAL INFORMATION;

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

References (19)

1. V. Hristidis and Y. Papakonstantinou, "Discover: Keyword search in relational databases," in Proc. of VLDB'02, 2002.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan,"Keyword searching and browsing in databases using banks," in Proc. of ICDE'02, 2002.
3. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar, "Bidirectional expansion for keyword search on graph databases," in Proc. of VLDB'05, 2005.
4. B. Kimelfeld and Y. Sagiv, "Finding and approximating top-k answers in keyword proximity search," in Proc. of PODS'06, 2006.
5. Y. Luo, X. Lin, W. Wang, and X. Zhou, "Spark: top-k keyword query in relational databases," in Proc. of SIGMOD'07, 2007.
6. A. Markowetz, Y. Yang, and D. Papadias, "Keyword search on relational data streams," in Proc. of SIGMOD'07, 2007.
7. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding top-k min-cost connected trees in databases," in Proc. of ICDE'07, 2007.
8. Y. Zhang, J. X. Yu, and J. Hou, Web Communities: Analysis and Construction. Springer Berlin Heidelberg, 2006.
9. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, "On generating all maximal independent sets," Inf. Process. Lett., vol. 27, no. 3, pp. 119-123, 1988.
10. B. Kimelfeld and Y. Sagiv, "Efficiently enumerating results of keyword search," in Proc. of DBPL'05, 2005, pp. 58-73.
11. S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, and Y. Sagiv, "Full disjunctions: Polynomial-delay iterators in action," in Proc. of VLDB'06, 2006, pp. 739-750.
12. 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, vol. 18, no. 7, pp. 401-405, 1972.
13. V. Hristidis, L. Gravano, and Y. Papakonstantinou, "Efficient ir-style keyword search over relational databases," in Proc. of VLDB'03, 2003.
14. S. Agrawal, S. Chaudhuri, and G. Das, "Dbxplorer: A system for keyword-based search over relational databases," in Proc. of ICDE'02, 2002.
15. F. Liu, C. T. Yu, W. Meng, and A. Chowdhury, "Effective keyword search in relational databases," in Proc. of SIGMOD'06, 2006.
16. H. He, H. Wang, J. Yang, and P. S. Yu, "Blinks: ranked keyword searches on graphs," in Proc. of SIGMOD'07, 2007.
17. 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 Proc. of SIGMOD'08, 2008.
18. D. Gibson, J. M. Kleinberg, and P. Raghavan, "Inferring web communities from link topology," in Hypertext, 1998, pp. 225-234.
19. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," in Proc. of SODA'98, 1998, pp. 668-677.