Finding Top-k Min-Cost Connected Trees in Databases

@article{Ding2007FindingTM,
  title={Finding Top-k Min-Cost Connected Trees in Databases},
  author={Bolin Ding and Jeffrey Xu Yu and Shan Wang and Lu Qin and Xiao Zhang and Xuemin Lin},
  journal={2007 IEEE 23rd International Conference on Data Engineering},
  year={2007},
  pages={836-845}
}
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p1, p1, ..., pl, against a relational database which can be modeled as a weighted graph, G(V, E). Here V is a set of nodes (tuples) and E is a set of edges representing foreign key references between tuples. Let Vi ⊆ V be a set of nodes that contain the keyword pi. We study finding top-k… CONTINUE READING
Highly Influential
This paper has highly influenced 39 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 316 citations. REVIEW CITATIONS
189 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 189 extracted citations

316 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 316 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

and Clifford

  • T. H. Cormen, C. E. Leiserson, R. L. Rivesi
  • Introduction to Algorithm (2nd Edition). The MIT…
  • 2001
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…