STAR: Steiner-Tree approximation in relationship graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 868-879

  Kasneci, Gjergji ^a   Ramanath, Maya ^a   Sozio, Mauro ^a   Suchanek, Fabian M ^a   Weikum, Gerhard ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; BUILDING BLOCK; EDGE LABELS; EDGE WEIGHTS; ENTITY-RELATIONSHIP; K-STEINER TREE; KNOWLEDGE BASIS; LARGE GRAPHS; MAIN-MEMORY; NP-HARD PROBLEM; ONLINE COMMUNITIES; RELATIONAL DATA; RELATIONSHIP GRAPHS; RUNTIME; SEMANTIC GRAPHS; SEMANTIC RELATIONS; STEINER TREES; TREE APPROXIMATION;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; SEMANTICS;

GRAPH THEORY;

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

References (29)

1. F. M. Suchanek, G. Kasneci, and G. Weikum, "Yago: A Core of Semantic Knowledge," in Proc. of WWW, 2007.
2. C. Fellbaum, WordNet: An Electronic Lexical Database. MIT Press, 1998. [Online]. Available: citeseer.ist.psu.edu/lin98wordnet.html
3. U. Leser, "A query language for biological networks," Bioinformatics, vol. 21, no. 2, pp. 33 -39, 2005.
4. C5. Plake, T. Schiemann, M. Pankalla, J. Hakenberg, and U. Leser, "Ali baba: Pubmed as a graph," Bioinformatics, vol. 22, 2006.
5. S. Trissl and U. Leser, "Fast and practical indexing and querying of very large graphs," in Proc. of SIGMOD, 2007.
6. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, "Keyword searching and browsing in databases using BANKS," in Proc. of ICDE, 2002.
7. 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, 2005.
8. S. Agrawal, S. Chaudhuri, and G. Das, "DBXplorer: A system for keyword-based search over relational databases," in Proc. of ICDE, 2002.
9. V. Hristidis and Y. Papakonstantinou, "DISCOVER: Keyword search in relational databases," in Proc. of VLDB, 2002.
10. B. Ding, J. Yu, S. Wang, L. Qing, X. Zhang, and X. Lin, "Finding top-k min-cost connected trees in databases," in Proc. of ICDE, 2007.
11. B. Kimelfeld and Y. Sagiv, "Finding and approximating top-k answers in keyword proximity search," in PODS, 2006, pp. 173 -182.
12. H. He, H. Wang, J. Yang, and P. Yu, "BLINKS: Ranked keyword searches on graphs," in Proc. of SIGMOD, 2007.
13. K. Golenberg, B. Kimelfeld, and Y. Sagiv, "Keyword proximity search in complex data graphs," in SIGMOD Conference, 2008, pp. 927 -940.
14. G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou, "Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data," in SIGMOD Conference, 2008, pp. 903 -914.
15. W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal, "Query relaxation by structure and semantics for retrieval of logical web documents," in IEEE Transactions on Knowledge and Data Engineering, 2002.
16. E. Ihler, "Bounds on the quality of approximate solutions on the group steiner tree problem," in 16th International Workshop on Graph- Theoretic Concepts in Computer Science, 1991.
17. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for steiner trees," vol. 15, no. 2, June 1981, pp. 141 -145.
18. V. Hristidis, L. Gravano, and Y. Papakonstantinou, "Efficient ir-style keyword search over relational databases," in Proc. of VLDB, 2003.
19. K. Anyanwu, A. Maduko, and A. P. Sheth, "Sparq2l: towards support for subgraph extraction queries in rdf databases," in WWW, 2007, pp. 797 -806.
20. A. Adya, J. A. Blakeley, S. Melnik, and S. Muralidhar, "Anatomy of the ado.net entity framework," in SIGMOD Conference, 2007, pp. 877 -888.
21. G. Kasneci, F. M. Suchanek, G. Ifrim, M. Ramanath, and G. Weikum, "NAGA: Searching and Ranking Knowledge," in 24th International Conference on Data Engineering (ICDE 2008). IEEE, 2008.
22. H. Tong and C. Faloutsos, "Center-piece subgraphs: problem definition and fast solutions," in KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2006, pp. 404 -413.
23. C. Faloutsos, K. S. Mccurley, and A. Tomkins, "Fast discovery of connection subgraphs," in KDD '04: Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2004, pp. 118 -127. [Online]. Available: http://dx.doi.org/10.1145/1014052.1014068
24. W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal, "Retrieving and organizing web pages by "information unit"," in WWW, 2001, pp. 230 -244.
25. J. Graupmann, "The spheresearch engine for graph-based search on heterogeneous semi-structured data," Ph.D. dissertation, Universität des Saarlandes, May 2006.
26. K. Mehlhorn, "A faster approximation algorithm for the steiner problem in graphs," Inf. Process. Lett., vol. 27, no. 3, pp. 125 -128, 1988.
27. S. Dreyfus and R. Wagner, "The steiner problem in graphs," in Networks, 1972.
28. R. B. Muhammad, "A parallel local search algorithm for euclidean steiner tree problem," in SNPD-SAWN '06. Washington, DC, USA: IEEE Computer Society, 2006, pp. 157 -164.
29. O. Faroe, D. Pisinger, and M. Zachariasen, "Local search for final placement in vlsi design," in ICCAD, 2001, pp. 565 -572.