Finding top-k min-cost connected trees in databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 836-845

  Ding, Bolin ^a   Yu, Jeffrey Xu ^a   Wang, Shan ^b   Qin, Lu ^a   Zhang, Xiao ^b   Lin, Xuemin ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b RENMIN UNIVERSITY OF CHINA   (China)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION RETRIEVAL; PARAMETER ESTIMATION; QUERY PROCESSING; USER INTERFACES;

DIRECTED GRAPHS; HIGH QUALITY SERVICES; RELATIONAL DATABASES; STEINER TREE PROBLEMS; UNDIRECTED GRAPHS; WEIGHTED GRAPHS;

TREES (MATHEMATICS);

EID: 34548795315     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367929     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 Proc. of ICDE'02, 2002.
2. S. Amer-Yahia, P. Case, T. Rölleke, J. Shanmugasundaram, and G. Weikum. Report on the db/ir panel at SIGMOD 2005. SIGMOD Record, 34(4), 2005.
3. R. Baeza-Yates and M. Consens. The continued saga of DBIR integration. In Proc. of VLDB'04 (tutorial), 2004.
4. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In Proc. of VLDB '04, 2004.
5. C. D. Bateman, C. S. Helvig, G. Robins, and A. Zelikovsky. Provably good routing tree construction with multi-port terminals. In Proc. of ISPD'97, 1997.
6. 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.
7. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7), 1998.
8. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. Journal of Algorithms, 33(1), 1999.
9. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: Deterministic approximation algorithms for group steiner trees and k-median. In Proc. of STOC'98, 1998.
10. S. Chaudhuri, R. Ramakrishnan, and G. Weikum. Integrating DB and IR techniques: What is the sound of one hand clapping? In Proc. of CIDR'05, 2005.
11. T. H. Cormen, C. E. Leiserson, R. L. Rivesi, and Clifford. Introduction to Algorithm (2nd Edition). The MIT Press, USA, 2001.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
13. S. Dreyfus and R. Wagner. The steiner problem in graphs. Networks, 1(1), 1972.
14. U. Feige. A threshold of In n for approximating set cover. Journal of ACM, 45(4), 1998.
15. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proc. of SODA'98, 1998.
16. C. Helvig, B. Robins, and A. Zelikovsky. Improved approximation bounds for the group steiner problem. Networks, 37(1), 2001.
17. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In Proc. of VLDB'03, 2003.
18. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In Proc. of VLDB'02, 2002.
19. E. Ihler. Bounds on the quality of approximate solutions to the group steiner problem. In Proc. of WG'90, 1990.
20. E. Ihler. The complexity of approximating the class steiner tree problem. Technical, report of Institut fur Informatik, Universitat Freiburg, 1991.
21. M.Ley. DBLP: Computer Science Bibliography, http://dblp.uni-trier.de/xml/ .
22. W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Query relaxation by structure and semantics for retrieval of logical web documents. IEEE Trans. Knowl. Data Eng., 14(4), 2002.
23. G. Reich and P. Widmayer. Beyond steiner's problem: A vlsi oriented generalization. In Proc. of WG'89, 1989.
24. J. Riedl and J. Konstan. MoveLens. http://www.cs.umn.edu/Research/ GroupLens.
25. K. Varun, P. Shashank, C. Soumen, S. Sudarshan, D. Rushi, and K. Hrishikesh. Bidirectional expansion for keyword search on graph databases. In Proc. of VLDB'05, 2005.