198 search results - page 9 / 40 » Reachability on prefix-recognizable graphs |
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
JUCS
2007
13 years 9 months ago
2007
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
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...
VLDB
2012
ACM
12 years 5 months ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
ACSD
2004
IEEE
14 years 1 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...