
io.mindmaps.graql.internal.gremlin.Query Maven / Gradle / Ivy
/*
* MindmapsDB - A Distributed Semantic Database
* Copyright (C) 2016 Mindmaps Research Ltd
*
* MindmapsDB is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* MindmapsDB is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with MindmapsDB. If not, see .
*/
package io.mindmaps.graql.internal.gremlin;
import com.google.common.collect.ImmutableSet;
import io.mindmaps.MindmapsGraph;
import io.mindmaps.util.ErrorMessage;
import io.mindmaps.graql.admin.PatternAdmin;
import io.mindmaps.graql.admin.VarAdmin;
import io.mindmaps.graql.admin.Conjunction;
import io.mindmaps.graql.internal.query.match.MatchOrder;
import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import java.util.Collection;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
/**
* A class for building gremlin traversals from patterns.
*
* A {@code Query} is constructed from a single {@code Pattern.Conjunction}. The conjunction is transformed into
* disjunctive normal form and then an {@code InnerQuery} is constructed from each disjunction component. This allows
* each {@code InnerQuery} to be described by a single gremlin traversal.
*
* The {@code Query} returns a list of gremlin traversals, whose results are combined by {@code MatchQueryImpl} to
* maintain any requested ordering.
*/
public class Query {
private final MindmapsGraph graph;
private final Collection innerQueries;
private final ImmutableSet names;
private final Optional order;
/**
* @param graph the graph to execute the query on
* @param pattern a pattern to find in the graph
* @param names the variable names to select
* @param order an optional ordering
*/
public Query(MindmapsGraph graph, PatternAdmin pattern, Set names, Optional order) {
Collection> patterns = pattern.getDisjunctiveNormalForm().getPatterns();
if (graph == null) {
throw new IllegalStateException(ErrorMessage.NO_GRAPH.getMessage());
}
this.graph = graph;
this.names = ImmutableSet.copyOf(names);
this.order = order;
innerQueries = patterns.stream().map(p -> new ConjunctionQuery(graph, p)).collect(toList());
}
/**
* @return a gremlin traversal to execute to find results
*/
public GraphTraversal> getTraversals() {
Traversal[] collect =
innerQueries.stream().map(ConjunctionQuery::getTraversal).toArray(Traversal[]::new);
// Because 'union' accepts an array, we can't use generics...
//noinspection unchecked
GraphTraversal> traversal =
graph.getTinkerTraversal().limit(1).union(collect);
order.ifPresent(o -> o.orderTraversal(traversal));
String[] namesArray = names.toArray(new String[names.size()]);
// Must provide three arguments in order to pass an array to .select
// If ordering, select the variable to order by as well
if (order.isPresent()) {
traversal.select(order.get().getVar(), order.get().getVar(), namesArray);
} else if (namesArray.length != 0) {
traversal.select(namesArray[0], namesArray[0], namesArray);
}
return traversal;
}
/**
* @return a stream of concept IDs mentioned in the query
*/
public Stream getConcepts() {
return innerQueries.stream().flatMap(ConjunctionQuery::getConcepts);
}
}