299 search results - page 7 / 60 » On Graph Query Optimization in Large Networks |
103
click to vote
VLDB
1994
ACM
15 years 3 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
100
click to vote
ATMOS
2010
14 years 10 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
102
Voted
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
78
Voted
IJRR
2006
14 years 11 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...