Thank you so much, David! I hope we get to meet in person someday! Just created a pull request: https://github.com/apache/solr-site/pull/156
Best regards, Rauf Aliev On Wed, Oct 29, 2025 at 8:39 PM David Smiley <[email protected]> wrote: > Congratulations Rauf; that's a huge accomplishment! And you > self-published too. I wish I did that. We should get your book on the > website: https://solr.apache.org/resources.html#solr-books Would you be > willing to submit a PR for that?: https://github.com/apache/solr-site > > On Wed, Oct 29, 2025 at 12:48 AM Rauf Aliev Rauf Aliev <[email protected]> > wrote: > >> Hello everyone, >> >> I am presenting my book "*Inside Solr and Lucene: **Algorithms and >> Engineering Deep Dive*". (*I have three books out on Amazon—it just so >> happened that they were released simultaneously, and there's synergy there >> - all of them are about Search & Recsys*). >> >> You are all developers, I hope you will find it useful. "Inside Solr and >> Lucene" differs from others on the topic of Solr/Lucene in that it >> describes the algorithms and data structures used there, starting from the >> problem that faced the developers, then examining naive or straightforward >> solutions, and further sharing how the architects in Solr/Lucene solved >> the >> problem. In very many cases, these are interesting, science-intensive >> solutions, backed by scientific works and papers (links are available in >> the book). >> >> https://testmysearch.com/books/inside-solr.html >> >> For example, I talk not only about the inverted index, posting lists, and >> how segments are stored—you can find it in other books—but also about how >> Finite-State Transducer (FST) is used there (this is a graph-based >> structure for term dictionaries, storing terms and metadata with shared >> prefixes/suffixes, solving high-memory usage and slow prefix/range queries >> in large vocabularies by providing compact, O(length of term) lookups); I >> talk about Pulsing Codec, Delta Encoding, Skip Lists, PackedInts >> (bit-packing algorithm that uses minimal bits per integer block based on >> the maximum value), Variable-Length Integers, LSM-Tree, HNSW for vectors, >> Roaring Bitmaps, LZ4 and DEFLATE compressions, Memory-Mapped I/O, >> Scatter-Gather Query Execution, Hash-Based Routing, SIMD Vectorization and >> a lot of other things of this kind. >> >> For solution architects and search engineers. Paperback and e-book >> versions. Worldwide delivery. I hope you will find it useful. >> >> P.S. I am currently working on the second edition of the book. Please let >> me know if you have something to add or change in it. >> >> -- >> Rauf Aliev, >> [email protected], >> Phone +15713428492 (EST) >> https://testmysearch.com/raufaliev >> https://testmysearch.com >> https://hybrismart.com >> >> >> >> -- >> Rauf Aliev, >> [email protected], >> Phone +15713428492 (EST) >> https://testmysearch.com/raufaliev >> https://testmysearch.com >> https://hybrismart.com >> > -- Rauf Aliev, [email protected], Phone +15713428492 (EST) https://testmysearch.com/raufaliev https://testmysearch.com https://hybrismart.com
