Leomrlin commented on code in PR #716: URL: https://github.com/apache/geaflow/pull/716#discussion_r2664132012
########## geaflow-ai/src/main/java/org/apache/geaflow/ai/operator/SessionOperator.java: ########## @@ -0,0 +1,142 @@ +/* + * Licensed to the Apache Software Foundation (ASF) under one + * or more contributor license agreements. See the NOTICE file + * distributed with this work for additional information + * regarding copyright ownership. The ASF licenses this file + * to you under the Apache License, Version 2.0 (the + * "License"); you may not use this file except in compliance + * with the License. You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, + * software distributed under the License is distributed on an + * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY + * KIND, either express or implied. See the License for the + * specific language governing permissions and limitations + * under the License. + */ + +package org.apache.geaflow.ai.operator; + +import java.util.*; +import java.util.stream.Collectors; +import org.apache.geaflow.ai.graph.GraphAccessor; +import org.apache.geaflow.ai.graph.GraphEdge; +import org.apache.geaflow.ai.graph.GraphEntity; +import org.apache.geaflow.ai.graph.GraphVertex; +import org.apache.geaflow.ai.index.IndexStore; +import org.apache.geaflow.ai.index.vector.IVector; +import org.apache.geaflow.ai.index.vector.VectorType; +import org.apache.geaflow.ai.search.VectorSearch; +import org.apache.geaflow.ai.subgraph.SubGraph; + +public class SessionOperator implements SearchOperator { + + private final GraphAccessor graphAccessor; + private final IndexStore indexStore; + + public SessionOperator(GraphAccessor accessor, IndexStore store) { + this.graphAccessor = Objects.requireNonNull(accessor); + this.indexStore = Objects.requireNonNull(store); + } + + @Override + public List<SubGraph> apply(List<SubGraph> subGraphList, VectorSearch search) { + List<IVector> keyWordVectors = search.getVectorMap().get(VectorType.KeywordVector); + if (keyWordVectors == null || keyWordVectors.isEmpty()) { + if (subGraphList == null) { + return new ArrayList<>(); + } + return new ArrayList<>(subGraphList); + } + List<String> contents = new ArrayList<>(keyWordVectors.size()); + for (IVector v : keyWordVectors) { + contents.add(v.toString()); + } + String query = String.join(" ", contents); + List<GraphEntity> globalResults = searchWithGlobalGraph(query); + if (subGraphList == null || subGraphList.isEmpty()) { + List<GraphVertex> startVertices = new ArrayList<>(); + for (GraphEntity resEntity : globalResults) { + if (resEntity instanceof GraphVertex) { + startVertices.add((GraphVertex) resEntity); + } + } + //Apply to subgraph + return startVertices.stream().map(v -> { + SubGraph subGraph = new SubGraph(); + subGraph.addVertex(v); + return subGraph; + }).collect(Collectors.toList()); + } else { + Map<GraphEntity, List<IVector>> extendEntityIndexMap = new HashMap<>(); + //Traverse all extension points of the subgraph and search within the extension area + for (SubGraph subGraph : subGraphList) { + List<GraphEntity> extendEntities = getSubgraphExpand(subGraph); + for (GraphEntity extendEntity : extendEntities) { + List<IVector> entityIndex = indexStore.getEntityIndex(extendEntity); + extendEntityIndexMap.put(extendEntity, entityIndex); + } + } + //recall compute + GraphSearchStore searchStore = initSearchStore(extendEntityIndexMap); + List<GraphEntity> matchEntities = searchStore.search(query, graphAccessor); + Set<GraphEntity> matchEntitiesSet = new HashSet<>(matchEntities); + + //Apply to subgraph + List<SubGraph> subGraphs = new ArrayList<>(subGraphList); + for (SubGraph subGraph : subGraphs) { + Set<GraphEntity> subgraphEntitySet = new HashSet<>(subGraph.getGraphEntityList()); + List<GraphEntity> extendEntities = getSubgraphExpand(subGraph); + for (GraphEntity extendEntity : extendEntities) { + if (matchEntitiesSet.contains(extendEntity) + && !subgraphEntitySet.contains(extendEntity)) { + subgraphEntitySet.add(extendEntity); + subGraph.addEntity(extendEntity); + } + } + } + return subGraphs; + } + } + + private List<GraphEntity> getSubgraphExpand(SubGraph subGraph) { + List<GraphEntity> entityList = subGraph.getGraphEntityList(); + List<GraphEntity> expandEntities = new ArrayList<>(); + for (GraphEntity entity : entityList) { + List<GraphEntity> entityExpand = graphAccessor.expand(entity); + expandEntities.addAll(entityExpand); + } + return expandEntities; + } + + private List<GraphEntity> searchWithGlobalGraph(String query) { + Map<GraphEntity, List<IVector>> entityIndexMap = new HashMap<>(); + Iterator<GraphVertex> vertexIterator = graphAccessor.scanVertex(); + while (vertexIterator.hasNext()) { + GraphVertex vertex = vertexIterator.next(); + //Read all vertices indices from the index and add them to the candidate set. + List<IVector> vertexIndex = indexStore.getEntityIndex(vertex); + entityIndexMap.put(vertex, vertexIndex); + } + //recall compute + GraphSearchStore searchStore = initSearchStore(entityIndexMap); + return searchStore.search(query, graphAccessor); + } + + private GraphSearchStore initSearchStore(Map<GraphEntity, List<IVector>> entityIndexMap) { + GraphSearchStore searchStore = new GraphSearchStore(); + for (Map.Entry<GraphEntity, List<IVector>> entry : entityIndexMap.entrySet()) { Review Comment: Unfortunately, there is no better solution at the moment. The algorithm requires that during each iteration, the `Operator` searches within the potential traversal area. Using the previous `GraphSearchStore`—whether based on the previous iteration or the entire graph—would inevitably lead to an expanding search scope. Fortunately, though, the retrieval area is not particularly large in the graph. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
