Sign In Start Free Trial

Lucene 4 Cookbook

By : Edwood Ng, Vineeth Mohan

3.2 (5)

Lucene 4 Cookbook

3.2 (5)

By: Edwood Ng, Vineeth Mohan

Overview of this book

This book is for software developers who are new to Lucene and who want to explore the more advanced topics to build a search engine. Knowledge of Java is necessary to follow the code samples. You will learn core concepts, best practices, and also advanced features, in order to build an effective search application.

Preface

Preface

What this book covers

What you need for this book

Who this book is for

Sections

Conventions

Reader feedback

Customer support

Free Chapter

1. Introducing Lucene

1. Introducing Lucene

Introduction

Installing Lucene

Setting up a simple Java Lucene project

Obtaining an IndexWriter

Creating an analyzer

Creating fields

Creating and writing documents to an index

Deleting documents

Obtaining an IndexSearcher

Creating queries with the Lucene QueryParser

Performing a search

Enumerating results

2. Analyzing Your Text

2. Analyzing Your Text

Introduction

Obtaining a common analyzer

Obtaining a TokenStream

Obtaining TokenAttribute values

Using PositionIncrementAttribute

Using PerFieldAnalyzerWrapper

Defining custom TokenFilters

Defining custom analyzers

Defining custom tokenizers

Defining custom attributes

3. Indexing Your Data

3. Indexing Your Data

Introduction

Obtaining an IndexWriter

Creating a StringField

Creating a TextField

Creating a numeric field

Creating a DocValue Field

Transactional commits and index versioning

Reusing field and document objects per thread

Delving into field norms

Changing similarity implementation used during indexing

4. Searching Your Indexes

4. Searching Your Indexes

Introduction

Obtaining IndexReaders

Un-inverting single-valued fields in memory with FieldCache

TermVectors

IndexSearcher

Constructing queries

Specifying sort logic

Forming a search result

Pagination

Using Collectors

Sorting with custom FieldComparator

5. Near Real-time Searching

5. Near Real-time Searching

Introduction

Using the DirectoryReader to open index in Near Real-Time

Using the SearcherManager to refresh IndexSearcher

Generational indexing with TrackingIndexWriter

Maintaining search sessions with SearcherLifetimeManager

Performance tuning: latency and throughput

6. Querying and Filtering Data

6. Querying and Filtering Data

Introduction

Performing advanced filtering

Creating a custom filter

Searching with QueryParser

TermQuery and TermRangeQuery

BooleanQuery

PrefixQuery and WildcardQuery

PhraseQuery and MultiPhraseQuery

FuzzyQuery

NumericRangeQuery

DisjunctionMaxQuery

RegexpQuery

SpanQuery

CustomScoreQuery

7. Flexible Scoring

7. Flexible Scoring

Introduction

Overriding similarity

Implementing the BM25 model

Implementing the language model

Implementing the divergence from randomness model

Implementing the information-based model

8. Introducing Elasticsearch

8. Introducing Elasticsearch

Introduction

Getting Elasticsearch

Creating a new index

Predefine field mappings

Adding a document

Deleting a document

Updating a document

Performing bulk indexing

Searching the index

Scaling Elasticsearch

9. Extending Lucene with Modules

9. Extending Lucene with Modules

Introduction

Exploring spatial search

Implementing joins

Performing faceting

Implementing grouping

Employing autosuggest

Implementing highlighting

Index

Index

Customer Reviews

3.2 (5)

5 star

20%

4 star

20%

3 star

40%

2 star

0

1 star

20%

BooleanQuery

A BooleanQuery is a combination of other queries in which you can specify whether each subquery must, must not, or should match. These options provide the foundation to build up to logical operators of AND, OR, and NOT, which you can use in QueryParser. Here is a quick review on QueryParser syntax for BooleanQuery:

"+" means required; for example, a search string +humpty dumpty equates to must match humpty and should match "dumpty"
"-" means must not match; for example, a search string -humpty dumpty equates to must not match humpty and should match dumpty
AND, OR, and NOT are pseudo Boolean operators. Under the hood, Lucene uses BooleanClause.Occur to model these operators. The options for occur are MUST, MUST_NOT, and SHOULD. In an AND query, both terms must match. In an OR query, both terms should match. Lastly, in a NOT query, the term MUST_NOT exists. For example, humpty AND dumpty means must match both humpty and dumpty, humpty OR dumpty means should match either or both...

Search

Your notes and bookmarks