299 search results - page 31 / 60 » On Graph Query Optimization in Large Networks |
119
click to vote
CN
2010
15 years 2 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
108
click to vote
GLOBECOM
2006
IEEE
15 years 8 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...
117
click to vote
SERVICES
2008
15 years 3 months ago
2008
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
191
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
113
click to vote
WISE
2002
Springer
15 years 6 months ago
2002
Springer
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...