Finding and approximating top-k answers in keyword proximity search

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 173-182

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximations of top k answers; Keyword proximity search; Top k answers

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; DATA STRUCTURES; DATABASE SYSTEMS; LARGE SCALE SYSTEMS; WEBSITES; XML;

APPROXIMATIONS OF TOP-K ANSWERS; KEYWORD PROXIMITY SEARCH; Q-FRAGMENT; TOP-K ANSWERS;

SEARCH ENGINES;

EID: 34250642809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142377     Document Type: Conference Paper

References (25)

1. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: enabling keyword search over relational databases. In SIGMOD, 2002.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, 2002.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7), 1998.
4. M. Charikar, C. Chekuri, T. Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, 1998.
5. S. Dreyfus and R. Wagner. The Steiner problem in graphs. Networks, 1, 1972.
6. D.-Z. Du, J. Smith, and J. Rubinstein. Advances in Steiner Trees. Springer, 2000.
7. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
8. J. Feldman and M. Ruhl. The directed steiner network problem is tractable for a constant number of terminals. In FOCS, 1999.
9. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms, 37(1), 2000.
10. C. S. Helvig, G. Robins, and A. Zelikovsky. An improved approximation scheme for the group Steiner problem. Networks, 37(1), 2001.
11. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, 2002.
12. V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword proximity search on XML graphs. In ICDE, 2003.
13. D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27, 1988.
14. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005.
15. B. Kimelfeld and Y. Sagiv. New algorithms for computing Steiner trees for a fixed number of terminals. To be found in the first author's home page (http://www.cs.huji.ac.il/~bennyk).
16. B. Kimelfeld and Y. Sagiv. Efficient engines for keyword proximity search. In WebDB, 2005.
17. B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search. In DBPL, 2005.
18. L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Inf., 15, 1981.
19. 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, 18, 1972.
20. W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing web pages by "information unit". In WWW, 2001.
21. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In SODA, 2000.
22. M. Y. Vardi. The complexity of relational query languages (extended abstract). In STOC, 1982.
23. J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17, 1971.
24. J. Y. Yen. Another algorithm for finding the k shortest loopless network paths. In "Proc. 41st Mtg. Operations Research Society of America", volume 20, 1972.
25. A. Zelikovsky. An 11/6-approximation algorithm for the network steiner problem. Algorithmica, 9(5), 1993.