Sciweavers

299 search results - page 6 / 60
» On Graph Query Optimization in Large Networks
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 10 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
15 years 10 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 1 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
89
Voted
DCOSS
2009
Springer
15 years 4 months ago
Similarity Based Optimization for Multiple Query Processing in Wireless Sensor Networks
Wireless sensor networks (WSNs) have been proposed for a large variety of applications. As the number of applications of sensor networks continue to grow, the number of users in se...
Hui Ling, Taieb Znati