98 search results - page 15 / 20 » Finding Regular Simple Paths in Graph Databases |
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
WSC
2000
13 years 8 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...