| /* |
| * 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.hudi.index.bloom; |
| |
| import org.apache.hudi.common.util.collection.Pair; |
| |
| import java.util.ArrayList; |
| import java.util.Collections; |
| import java.util.HashMap; |
| import java.util.HashSet; |
| import java.util.List; |
| import java.util.Map; |
| import java.util.Set; |
| |
| /** |
| * Interval Tree based index look up for Global Index. Builds an {@link KeyRangeLookupTree} for all index files (across |
| * all partitions) and uses it to search for matching index files for any given recordKey that needs to be looked up. |
| */ |
| class IntervalTreeBasedGlobalIndexFileFilter implements IndexFileFilter { |
| |
| private final KeyRangeLookupTree indexLookUpTree = new KeyRangeLookupTree(); |
| private final Set<String> filesWithNoRanges = new HashSet<>(); |
| private final Map<String, String> fileIdToPartitionPathMap = new HashMap<>(); |
| |
| /** |
| * Instantiates {@link IntervalTreeBasedGlobalIndexFileFilter}. |
| * |
| * @param partitionToFileIndexInfo Map of partition to List of {@link BloomIndexFileInfo}s |
| */ |
| IntervalTreeBasedGlobalIndexFileFilter(final Map<String, List<BloomIndexFileInfo>> partitionToFileIndexInfo) { |
| List<BloomIndexFileInfo> allIndexFiles = new ArrayList<>(); |
| |
| partitionToFileIndexInfo.forEach((parition, bloomIndexFileInfoList) -> bloomIndexFileInfoList.forEach(file -> { |
| fileIdToPartitionPathMap.put(file.getFileId(), parition); |
| allIndexFiles.add(file); |
| })); |
| |
| // Note that the interval tree implementation doesn't have auto-balancing to ensure logN search time. |
| // So, we are shuffling the input here hoping the tree will not have any skewness. If not, the tree could be skewed |
| // which could result in N search time instead of NlogN. |
| Collections.shuffle(allIndexFiles); |
| allIndexFiles.forEach(indexFile -> { |
| if (indexFile.hasKeyRanges()) { |
| indexLookUpTree |
| .insert(new KeyRangeNode(indexFile.getMinRecordKey(), indexFile.getMaxRecordKey(), indexFile.getFileId())); |
| } else { |
| filesWithNoRanges.add(indexFile.getFileId()); |
| } |
| }); |
| } |
| |
| @Override |
| public Set<Pair<String, String>> getMatchingFilesAndPartition(String partitionPath, String recordKey) { |
| Set<String> matchingFiles = new HashSet<>(); |
| matchingFiles.addAll(indexLookUpTree.getMatchingIndexFiles(recordKey)); |
| matchingFiles.addAll(filesWithNoRanges); |
| Set<Pair<String, String>> toReturn = new HashSet<>(); |
| matchingFiles.forEach(file -> toReturn.add(Pair.of(fileIdToPartitionPathMap.get(file), file))); |
| return toReturn; |
| } |
| } |