Sciweavers

Share
69 search results - page 1 / 14
» A hierarchical approach to reachability query answering in v...
Sort
View
CIKM
2010
Springer
8 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
9 years 10 months ago
Efficiently answering reachability queries on very large directed graphs
Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
7 years 20 days ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
9 years 2 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
9 years 11 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
books