100 search results - page 3 / 20 » Closure and factor-critical graphs |
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
DM
2010
13 years 7 months ago
2010
DM
2000
13 years 7 months ago
2000
ACSC
2003
IEEE
14 years 23 days ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
VLDB
2005
ACM
14 years 28 days ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...