歡迎來到Linux教程網
Linux教程網
Linux教程網
Linux教程網
Linux教程網 >> Linux基礎 >> Linux教程 >> 基於Lucene多索引進行索引和搜索

基於Lucene多索引進行索引和搜索

日期:2017/2/28 15:51:56   编辑:Linux教程

Lucene支持創建多個索引目錄,同時存儲多個索引。我們可能擔心的問題是,在索引的過程中,分散地存儲到多個索引目錄中,是否在搜索時能夠得到全局的相關度計算得分,其實Lucene的ParallelMultiSearcher和MultiSearcher支持全局得分的計算,也就是說,雖然索引分布在多個索引目錄中,在搜索的時候還會將全部的索引數據聚合在一起進行查詢匹配和得分計算。


索引目錄處理


下面我們通過將索引隨機地分布到以a~z的26個目錄中,並實現一個索引和搜索的程序,來驗證一下Lucene得分的計算。

首先,實現一個用來構建索引目錄以及處理搜索的工具類,代碼如下所示:

  1. package org.shirdrn.lucene;
  2. import java.io.File;
  3. import java.io.IOException;
  4. import java.util.ArrayList;
  5. import java.util.HashMap;
  6. import java.util.Iterator;
  7. import java.util.List;
  8. import java.util.Map;
  9. import java.util.Random;
  10. import java.util.concurrent.locks.Lock;
  11. import java.util.concurrent.locks.ReentrantLock;
  12. import org.apache.lucene.index.CorruptIndexException;
  13. import org.apache.lucene.index.IndexWriter;
  14. import org.apache.lucene.index.IndexWriterConfig;
  15. import org.apache.lucene.index.IndexWriter.MaxFieldLength;
  16. import org.apache.lucene.search.DefaultSimilarity;
  17. import org.apache.lucene.search.IndexSearcher;
  18. import org.apache.lucene.search.Searchable;
  19. import org.apache.lucene.search.Similarity;
  20. import org.apache.lucene.store.FSDirectory;
  21. import org.apache.lucene.store.LockObtainFailedException;
  22. import org.shirdrn.lucene.MultipleIndexing.IndexWriterObj;
  23. /**
  24. * Indexing accross multiple Lucene indexes.
  25. *
  26. * @author shirdrn
  27. * @date 2011-12-12
  28. */
  29. public class IndexHelper {
  30. private static WriterHelper writerHelper = null;
  31. private static SearcherHelper searcherHelper = null;
  32. public static WriterHelper newWriterHelper(String root, IndexWriterConfig indexConfig) {
  33. return WriterHelper.newInstance(root, indexConfig);
  34. }
  35. public static SearcherHelper newSearcherHelper(String root, IndexWriterConfig indexConfig) {
  36. return SearcherHelper.newInstance(root, indexConfig);
  37. }
  38. protected static class WriterHelper {
  39. private String alphabet = "abcdefghijklmnopqrstuvwxyz";
  40. private Lock locker = new ReentrantLock();
  41. private String indexRootDir = null;
  42. private IndexWriterConfig indexConfig;
  43. private Map<Character, IndexWriterObj> indexWriters = new HashMap<Character, IndexWriterObj>();
  44. private static Random random = new Random();
  45. private WriterHelper() {
  46. }
  47. private synchronized static WriterHelper newInstance(String root, IndexWriterConfig indexConfig) {
  48. if(writerHelper==null) {
  49. writerHelper = new WriterHelper();
  50. writerHelper.indexRootDir = root;
  51. writerHelper.indexConfig = indexConfig;
  52. }
  53. return writerHelper;
  54. }
  55. public IndexWriterObj selectIndexWriter() {
  56. int pos = random.nextInt(alphabet.length());
  57. char ch = alphabet.charAt(pos);
  58. String dir = new String(new char[] {ch});
  59. locker.lock();
  60. try {
  61. File path = new File(indexRootDir, dir);
  62. if(!path.exists()) {
  63. path.mkdir();
  64. }
  65. if(!indexWriters.containsKey(ch)) {
  66. IndexWriter indexWriter = new IndexWriter(FSDirectory.open(path), indexConfig.getAnalyzer(), MaxFieldLength.UNLIMITED);
  67. indexWriters.put(ch, new IndexWriterObj(indexWriter, dir));
  68. }
  69. } catch (CorruptIndexException e) {
  70. e.printStackTrace();
  71. } catch (LockObtainFailedException e) {
  72. e.printStackTrace();
  73. } catch (IOException e) {
  74. e.printStackTrace();
  75. } finally {
  76. locker.unlock();
  77. }
  78. return indexWriters.get(ch);
  79. }
  80. @SuppressWarnings("deprecation")
  81. public void closeAll(boolean autoOptimize) {
  82. Iterator<Map.Entry<Character, IndexWriterObj>> iter = indexWriters.entrySet().iterator();
  83. while(iter.hasNext()) {
  84. Map.Entry<Character, IndexWriterObj> entry = iter.next();
  85. try {
  86. if(autoOptimize) {
  87. entry.getValue().indexWriter.optimize();
  88. }
  89. entry.getValue().indexWriter.close();
  90. } catch (CorruptIndexException e) {
  91. e.printStackTrace();
  92. } catch (IOException e) {
  93. e.printStackTrace();
  94. }
  95. }
  96. }
  97. }
  98. protected static class SearcherHelper {
  99. private List<IndexSearcher> searchers = new ArrayList<IndexSearcher>();
  100. private Similarity similarity = new DefaultSimilarity();
  101. private SearcherHelper() {
  102. }
  103. private synchronized static SearcherHelper newInstance(String root, IndexWriterConfig indexConfig) {
  104. if(searcherHelper==null) {
  105. searcherHelper = new SearcherHelper();
  106. if(indexConfig.getSimilarity()!=null) {
  107. searcherHelper.similarity = indexConfig.getSimilarity();
  108. }
  109. File indexRoot = new File(root);
  110. File[] files = indexRoot.listFiles();
  111. for(File f : files) {
  112. IndexSearcher searcher = null;
  113. try {
  114. searcher = new IndexSearcher(FSDirectory.open(f));
  115. } catch (CorruptIndexException e) {
  116. e.printStackTrace();
  117. } catch (IOException e) {
  118. e.printStackTrace();
  119. }
  120. if(searcher!=null) {
  121. searcher.setSimilarity(searcherHelper.similarity);
  122. searcherHelper.searchers.add(searcher);
  123. }
  124. }
  125. }
  126. return searcherHelper;
  127. }
  128. public void closeAll() {
  129. Iterator<IndexSearcher> iter = searchers.iterator();
  130. while(iter.hasNext()) {
  131. try {
  132. iter.next().close();
  133. } catch (IOException e) {
  134. e.printStackTrace();
  135. }
  136. }
  137. }
  138. public Searchable[] getSearchers() {
  139. Searchable[] a = new Searchable[searchers.size()];
  140. return searchers.toArray(a);
  141. }
  142. }
  143. }
由於在索引的時候,同時打開了多個Directory實例,而每個Directory對應一個IndexWriter,我們通過記錄a~z這26個字母為每個IndexWriter的名字,將IndexWriter和目錄名稱包裹在IndexWriterObj類的對象中,便於通過日志看到實際數據的分布。在進行Lucene Document構建的時候,將這個索引目錄的名字(a~z字符中之一)做成一個Field。在索引的時候,值需要調用IndexHelper.WriterHelper的selectIndexWriter()方法,即可以自動選擇對應的IndexWriter實例去進行索引。

在搜索的時候,通過IndexHelper.SearcherHelper工具來獲取多個Searchable實例的數組,調用getSearchers()即可以獲取到,提供給MultiSearcher構建搜索。

Copyright © Linux教程網 All Rights Reserved