Efficiently enumerating results of keyword search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3774 LNCS, Issue , 2005, Pages 58-73

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA HANDLING; DATABASE SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION;

DATA GRAPH; K-FRAGMENTS; KEYWORD SEARCH; SUBTREE;

INFORMATION RETRIEVAL;

EID: 33745380060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601524_4     Document Type: Conference Paper

References (14)

1. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: enabling keyword search over relational databases. In SIGMOD Conference, page 627, 2002.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, pages 431-440, 2002.
3. S. Cohen, Y. Kanza, B. Kimelfeld, and Y. Sagiv. Interconnection semantics for keyword search in xml. In CIKM, 2005.
4. M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics, 32:835-859, 1977.
5. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In HDMS, 2003.
6. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, pages 670-681, 2002.
7. V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword proximity search on XML graphs. In ICDE, pages 367-378, 2003.
8. V. M. Jiménez and A. Marzal. Computing the K shortest paths: A new algorithm and an experimental comparison. In Algorithm Engineering, pages 15-29, 1999.
9. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, March 1988.
10. 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.
11. B. Kimelfeld and Y. Sagiv. Efficient engines for keyword proximity search. In WebDB, pages 67-72, 2005.
12. B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search, 2005. Available at Kimelfeld's home page (http://wwv.cs.huji.ac.il/ ~bennyk/).
13. W. S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing Web pages by "information unit". In WWW, pages 230-244, 2001.
14. M. Y. Vardi. The complexity of relational query languages (extended abstract). In STOC, pages 137-146, 1982.