On-line exact shortest distance query processing

@inproceedings{Cheng2009OnlineES,
  title={On-line exact shortest distance query processing},
  author={Jiefeng Cheng and Jeffrey Xu Yu},
  booktitle={EDBT},
  year={2009}
}
Shortest-path query processing not only serves as a long established routine for numerous applications in the past but also is of increasing popularity to support novel graph applications in very large databases nowadays. For a large graph, there is the new scenario to query intensively against arbitrary nodes, asking to quickly return node distance or even shortest paths. And traditional main memory algorithms and shortest paths materialization become inadequate. We are interested in graph… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS
44 Citations
10 References
Similar Papers

Citations

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

75 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.

References

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

Similar Papers

Loading similar papers…