Keyword proximity search in complex data graphs

@inproceedings{Golenberg2008KeywordPS,
  title={Keyword proximity search in complex data graphs},
  author={Konstantin Golenberg and Benny Kimelfeld and Yehoshua Sagiv},
  booktitle={SIGMOD Conference},
  year={2008}
}
In keyword search over data graphs, an answer is a nonredundant subtree that includes the given keywords. An algorithm for enumerating answers is presented within an architecture that has two main components: an engine that generates a set of candidate answers and a ranker that evaluates their score. To be effective, the engine must have three fundamental properties. It should not miss relevant answers, has to be efficient and must generate the answers in an order that is highly correlated with… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 202 citations. REVIEW CITATIONS
120 Citations
7 References
Similar Papers

Citations

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

202 Citations

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

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem

  • E. L. Lawler
  • Management Science, 18
  • 1972
Highly Influential
13 Excerpts

Similar Papers

Loading similar papers…