37 search results - page 7 / 8 » Neighbor query friendly compression of social networks |
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
SIGMOD
2011
ACM
12 years 9 months ago
2011
ACM
Differential privacy is a powerful tool for providing privacypreserving noisy query answers over statistical databases. It guarantees that the distribution of noisy query answers...
IPPS
2007
IEEE
14 years 17 days ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups by means of a rewiring procedure that is periodically executed by each pe...