Sciweavers

147 search results - page 12 / 30
» Parallel Query Processing and Edge Ranking of Graphs
Sort
View
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 2 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
PVLDB
2010
152views more  PVLDB 2010»
14 years 7 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
WEBDB
2010
Springer
143views Database» more  WEBDB 2010»
15 years 2 months ago
Querying Wikipedia Documents and Relationships
Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often igno...
Huong Nguyen, Thanh Nguyen, Hoa Nguyen, Juliana Fr...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen