BLINKS: Ranked keyword searches on graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 305-316

  He, Hao ^a   Wang, Haixun ^b   Yang, Jun ^a   Yu, Philip S ^b  

^a DUKE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Graphs; Indexing; Keyword search; Ranking

Indexed keywords

DATA GRAPHS; GRAPH-STRUCTURED DATA; KEYWORD SEARCH; QUERY KEYWORDS;

DATA STRUCTURES; GRAPH THEORY; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; PROBLEM SOLVING; TABU SEARCH;

QUERY PROCESSING;

EID: 35448999368     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247516     Document Type: Conference Paper

References (25)

1. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. In ICDE, 2002.
2. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
3. G. Bhalotia, C. Nakhe, A. Hulgeri, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, 2002.
4. Y. Cai, X. Dong, A. Halevy, J. Liu, and J. Madhavan. Personal information management with SEMEX. In SIGMOD, 2005.
5. S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A semantic search engine for XML. In VLDB, 2003.
6. B. Ding, J.X. Yu, S. Wang, L. Qing, X. Zhang, and X. LIN. Finding top-k min-cost connected trees in databases. In ICDE, 2007.
7. S. E. Dreyfus and R. A. Wagner. The Steiner problem, in graphs. Networks, 1:195-207, 1972.
8. S. Dumais, E. Cutrell, JJ Cadiz, G. Jancke, R. Sarin, and D. C. Robbins. Stuff i've seen: a system for personal information retrieval and re-use. In SIGIR, 2003.
9. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, 2001.
10. D. Florescu, D. Kossmann, and I. Manolescu. Integrating keyword, search into XML query processing. Comput. Networks, 33(1-6):119-135, 2000.
11. M. Garey, D. Johnson, and L. Stockmeyer. Some simplified. NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
12. R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. In VLDB, pages 26-37, 1998.
13. J. Graupmann, R. Schenkel, and G. Weikum. The spheresearch engine for unified ranked retrieval of heterogeneous XML and web documents. In VLDB, pages 529-540, 2005.
14. L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. XRANK: ranked, keyword search over XML documents. In SIGMOD, pages 16-27, 2003.
15. H. He, H. Wang, J. Yang, and P. S. Yu. Blinks: Ranked keyword searches on graphs. Technical report, Duke CS Department, 2007.
16. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In VLDB, pages 850-861, 2003.
17. V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In VLDB, 2002.
18. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph, databases. In VLDB, 2005.
19. G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Supercomputing, 1995.
20. R. Kaushik, R. Krishnamurthy, J. F. Naughton, and R. Ramakrishnan. On the integration of stmcture indexes and inverted lists. In SIGMOD, pages 779-790, 2004.
21. B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS, pages 173182, 2006.
22. Yunyao Li, Cong Yu, and H. V. Jagadish. Schema-free XQuery. In VLDB, pages 72-83, 2004.
23. F. Liu, C. T. Yu, W. Meng, and. A. Chowdhury. Effective keyword search in relational databases. In SIGMOD, pages 563-574, 2006.
24. J. Liu. A graph, partitioning algorithm by node separators. ACM Trans. Math. Softw., 15(3):198-219, 1989.
25. Y. Xu and Y. Papakonstantinou. Efficient keyword search for smallest LCAs in XML databases. In SIGMOD, 2005.