768 search results - page 85 / 154 » Efficient Correlation Search from Graph Databases |
218
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
144
click to vote
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
121
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
114
click to vote
ITPRO
2007
15 years 3 months ago
2007
Federation of Abstracting and Information Services presentation (“TheThomsonTransformation: Remaking a Global 500 Company,” http://www. nfais.org/TurnerNFAIS06.ppt). Now conten...
143
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...