Sciweavers

67 search results - page 2 / 14
» A hierarchical approach to reachability query answering in v...
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
11 years 12 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 4 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 2 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 4 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
PVLDB
2010
149views more  PVLDB 2010»
13 years 2 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...