Decoding billions of integers per second through vectorization

Sep 6, 20170 likes1,113 views

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable CPU time. Therefore, substantial effort has been made to reduce costs associated with compression and decompression. In particular, researchers have exploited the superscalar nature of modern processors and SIMD instructions. Nevertheless, we introduce a novel vectorized scheme called SIMD-BP128 that improves over previously proposed vectorized approaches. It is nearly twice as fast as the previously fastest schemes on desktop processors (varint-G8IU and PFOR). At the same time, SIMD-BP128 saves up to 2 bits per integer. For even better compression, we propose another new vectorized scheme (SIMD-FastPFOR) that has a compression ratio within 10% of a state-of-the-art scheme (Simple-8b) while being two times faster during decoding.

Decoding billions of integers per second through vectorization

Software is often improved incrementally. Each software optimization should be assessed with microbenchmarks. In a microbenchmark, we record performance measures such as elapsed time or instruction counts during specific tasks, often in idealized conditions. In principle, the process is easy: if the new code is faster, we adopt it. Unfortunately, there are many pitfalls, such as unrealistic statistical assumptions and poorly designed benchmarks. Abstractions like cloud computing add further challenges. We illustrate effective benchmarking practices with examples.

Fast indexes with roaring #gomtl-10 Daniel Lemire

��

Presentation on Roaring bitmaps for the Go Montreal meetup (Go 10th anniversary). Roaring bitmaps are a standard indexing data structure. They are widely used in search and database engines. For example, Lucene, the search engine powering Wikipedia relies on Roaring. The Go library roaring implements Roaring bitmaps in Go. It is used in several popular systems such as InfluxDB, Pilosa and Bleve. This library is used in production in several systems, it is part of the Awesome Go collection. After presenting the library, we will cover some advanced Go topics such as the use of assembly language, unsafe mappings, and so forth.

Parsing JSON Really Quickly: Lessons LearnedDaniel Lemire

��

This document discusses techniques for quickly parsing JSON documents. It begins by benchmarking different JSON parsing libraries and finds that simdjson, which uses SIMD instructions, can parse Twitter's JSON feed at 2.4 GB/s on a 3.4 GHz CPU, around 4 times faster than other libraries. It then describes four tricks used in simdjson to achieve this speed: 1) avoiding hard-to-predict branches, 2) using wide SIMD instructions, 3) avoiding memory and object allocation, and 4) measuring performance through benchmark-driven development. The document provides several examples showing how these tricks can dramatically speed up JSON parsing and related tasks.

Next Generation Indexes For Big Data Engineering (ODSC East 2018)Daniel Lemire

��

Maximizing performance in data engineering is a daunting challenge. We present some of our work on designing faster indexes, with a particular emphasis on compressed indexes. Some of our prior work includes (1) Roaring indexes which are part of multiple big-data systems such as Spark, Hive, Druid, Atlas, Pinot, Kylin, (2) EWAH indexes are part of Git (GitHub) and included in major Linux distributions. We will present ongoing and future work on how we can process data faster while supporting the diverse systems found in the cloud (with upcoming ARM processors) and under multiple programming languages (e.g., Java, C++, Go, Python). We seek to minimize shared resources (e.g., RAM) while exploiting algorithms designed for the single-instruction-multiple-data (SIMD) instructions available on commodity processors. Our end goal is to process billions of records per second per core. The talk will be aimed at programmers who want to better understand the performance characteristics of current big-data systems as well as their evolution. The following specific topics will be addressed: 1. The various types of indexes and their performance characteristics and trade-offs: hashing, sorted arrays, bitsets and so forth. 2. Index and table compression techniques: binary packing, patched coding, dictionary coding, frame-of-reference.

Ingénierie de la performance au sein des mégadonnéesDaniel Lemire

��

Les index logiciels accélèrent les applications en intelligence d'affaire, en apprentissage machine et en science des données. Ils déterminent souvent la performance des applications portant sur les mégadonnées. Les index efficaces améliorent non seulement la latence et le débit, mais aussi la consommation d'énergie. Plusieurs index font une utilisation parcimonieuse de la mémoire vive afin que les données critiques demeurent près du processeur. Il est aussi souhaitable de travailler directement sur les données compressées afin d'éviter une étape de décodage supplémentaire. (1) Nous nous intéressons aux index bitmap. Nous les trouvons dans une vaste gamme de systèmes : Oracle, Hive, Spark, Druid, Kylin, Lucene, Elastic, Git... Ils sont une composante de systèmes, tels que Wikipedia ou GitHub, dont dépendent des millions d'utilisateurs à tous les jours. Nous présenterons certains progrès récents ayant trait à l'optimisation des index bitmap, tels qu'ils sont utilisés au sein des systèmes actuels. Nous montrons par des exemples comment multiplier la performance de ces index dans certains cas sur les processeurs bénéficiant d'instructions SIMD (instruction unique, données multiples) avancées. (2) Nous ciblons aussi les listes d'entiers que l'on trouve au sein des arbres B+, dans les indexes inversés et les index bitmap compressés. Nous donnons un exemple récent de technique de compression (Stream VByte) d’entiers qui permet de décoder des milliards d’entiers compressés par seconde.

SIMD Compression and the Intersection of Sorted IntegersDaniel Lemire

��

Sorted lists of integers are commonly used in inverted indexes and database systems. They are often compressed in memory. We can use the SIMD instructions available in common processors to boost the speed of integer compression schemes. Our S4-BP128-D4 scheme uses as little as 0.7 CPU cycles per decoded integer while still providing state-of-the-art compression. However, if the subsequent processing of the integers is slow, the effort spent on optimizing decoding speed can be wasted. To show that it does not have to be so, we (1) vectorize and optimize the intersection of posting lists; (2) introduce the SIMD Galloping algorithm. We exploit the fact that one SIMD instruction can compare 4 pairs of integers at once. We experiment with two TREC text collections, GOV2 and ClueWeb09 (Category B), using logs from the TREC million-query track. We show that using only the SIMD instructions ubiquitous in all modern CPUs, our techniques for conjunctive queries can double the speed of a state-of-the-art approach.

Logarithmic Discrete Wavelet Transform for High-Quality Medical Image Compres...Daniel Lemire

��

The document describes a logarithmic discrete wavelet transform (LNS-DWT) for medical image compression. It aims to improve compression ratio and image quality using a logarithmic number system. The author developed an LNS library for image processing operations like addition, subtraction, multiplication and division. He also implemented a 2D LNS-DWT that showed minimal error compared to the linear domain implementation. The LNS-DWT could provide better compression performance for medical applications with limited resources.

Engineering fast indexes (Deepdive)Daniel Lemire

��

Engineering fast indexesDaniel Lemire

��

MaskedVByte: SIMD-accelerated VByteDaniel Lemire

��

The document discusses techniques for optimizing inverted indexes used for document retrieval, including delta encoding and vectorized VByte decoding. Delta encoding stores the differences between adjacent document IDs rather than the IDs themselves, since differences are usually small integers. VByte encoding compresses these deltas into variable-length bytes. Vectorized VByte decoding decodes multiple VByte-encoded integers simultaneously using CPU intrinsics for improved performance over sequential decoding. It analyzes the variable-length encoding to group integers for bulk decoding in parallel.

Roaring Bitmaps (January 2016)Daniel Lemire

��

Better bitmap performance with Roaring bitmaps Bitmaps are used to implement fast set operations in software. They are frequently found in databases and search engines. Without compression, bitmaps scale poorly, so they are often compressed. Many bitmap compression techniques have been proposed, almost all relying primarily on run-length encoding (RLE). For example, Oracle relies on BBC bitmap compression while the version control system Git and Apache Hive rely on EWAH compression. We can get superior performance with a hybrid compression technique that uses both uncompressed bitmaps and packed arrays inside a two-level tree. An instance of this technique, Roaring, has been adopted by several production platforms (e.g., Apache Lucene/Solr/Elastic, Apache Spark, eBay's Apache Kylin and Metamarkets' Druid). Overall, our implementation of Roaring can be several times faster (up to two orders of magnitude) than the implementations of traditional RLE-based alternatives (WAH, Concise, EWAH) while compressing better. We review the design choices and optimizations that make these good results possible.

Roaring Bitmap : June 2015 reportDaniel Lemire

��

La vectorisation des algorithmes de compression Daniel Lemire

��

Depuis la mise en marché du Pentium 4, nos processeurs bénéficient d'instructions vectorielles. En tenant compte explicitement de ces instructions dans la conception de nos algorithmes, nous pouvons grandement accélérer les calculs. À titre d'exemple, considérons la compression des listes d'entiers telle qu'elle s'effectue au sein de la plupart des moteurs de recherche ou des bases de données. En cette matière, nous utilisons souvent encore des algorithmes développés dans les années 70. Nous expliquerons comment on peut faire beaucoup mieux en ce qui a trait à la vitesse en exploitant les instructions vectorielles.

OLAP and moreDaniel Lemire

��

Decoding billions of integers per second through vectorization Daniel Lemire

��

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable CPU time. Therefore, substantial effort has been made to reduce costs associated with compression and decompression. In particular, researchers have exploited the superscalar nature of modern processors and SIMD instructions. Nevertheless, we introduce a novel vectorized scheme called SIMD-BP128 that improves over previously proposed vectorized approaches. It is nearly twice as fast as the previously fastest schemes on desktop processors (varint-G8IU and PFOR). At the same time, SIMD-BP128 saves up to 2 bits per integer. For even better compression, we propose another new vectorized scheme (SIMD-FastPFOR) that has a compression rate within 10% of a state-of-the-art scheme (Simple-8b) while being two times faster during decoding.

Extracting, Transforming and Archiving Scientific DataDaniel Lemire

��

It is becoming common to archive research datasets that are not only large but also numerous. In addition, their corresponding metadata and the software required to analyse or display them need to be archived. Yet the manual curation of research data can be difficult and expensive, particularly in very large digital repositories, hence the importance of models and tools for automating digital curation tasks. The automation of these tasks faces three major challenges: (1) research data and data sources are highly heterogeneous, (2) future research needs are difficult to anticipate, (3) data is hard to index. To address these problems, we propose the Extract, Transform and Archive (ETA) model for managing and mechanizing the curation of research data. Specifically, we propose a scalable strategy for addressing the research-data problem, ranging from the extraction of legacy data to its long-term storage. We review some existing solutions and propose novel avenues of research.

Innovation without permission: from Codd to NoSQLDaniel Lemire

��

Practitioners often fail to apply textbook database design principles. We observe both a perversion of the relational model and a growth of less formal alternatives. Overall, there is an opposition between the analytic thought that prevailed when many data modeling techniques were initiated, and the pragmatism which now dominates among practitioners. There are at least two recent trends supporting this rejection of traditional models: (1) the rise of the sophisticated user, most notably in social media is challenge to the rationalist view, as it blurs the distinction between design and operation, (2) in the new technological landscape where there are billions of interconnected computers worldwide, simple concepts like consistency sometimes become prohibitively expensive. Overall, for a wide range of information systems, design and operation are becoming integrated in the spirit of pragmatism. Thus, we are left with design methodologies which embrace fast and continual iterations and and exploratory testing. These methodologies allow innovation without permission in that the right to design new features is no longer so closely guarded. Fo

Write good papersDaniel Lemire

��

Faster Column-Oriented IndexesDaniel Lemire

��

Compressing column-oriented indexesDaniel Lemire

��

Column-oriented databases have become fashionable following the work of Stonebraker et al. In the data warehousing industry, the terms "column oriented" and "column store" have become necessary marketing buzzwords. One of the benefits of column-oriented indexes is good compression through run-length encoding (RLE). This type of compression is particularly benefitial since it simultaneously reduce the volume of data and the necessary computations. However, the efficiency of the compression depends on the order of the rows in the table and this is even more important with larger tables. Finding the best row ordering is NP hard. We compare some heuristics for this problem including variations on the lexicographical order, Gray codes, and Hilbert space-filling curves.

All About Bitmap Indexes... And Sorting ThemDaniel Lemire

��

A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAPDaniel Lemire

��

A data warehouse cannot materialize all possible views, hence we must estimate quickly, accurately, and reliably the size of views to determine the best candidates for materialization. Many available techniques for view-size estimation make particular statistical assumptions and their error can be large. Comparatively, unassuming probabilistic techniques are slower, but they estimate accurately and reliability very large view sizes using little memory. We compare five unassuming hashing-based view-size estimation techniques including Stochastic Probabilistic Counting and LogLog Probabilistic Counting. Our experiments show that only Generalized Counting, Gibbons-Tirthapura, and Adaptive Counting provide universally tight estimates irrespective of the size of the view; of those, only Adaptive Counting remains constantly fast as we increase the memory budget.

Tag-Cloud Drawing: Algorithms for Cloud VisualizationDaniel Lemire

��

Tag clouds provide an aggregate of tag-usage statistics. They are typically sent as in-line HTML to browsers. However, display mechanisms suited for ordinary text are not ideal for tags, because font sizes may vary widely on a line. As well, the typical layout does not account for relationships that may be known between tags. This paper presents models and algorithms to improve the display of tag clouds that con- sist of in-line HTML, as well as algorithms that use nested tables to achieve a more general 2-dimensional layout in which tag relationships are considered. The first algorithms leverage prior work in typesetting and rectangle packing, whereas the second group of algorithms leverage prior work in Electronic Design Automation. Experiments show our algorithms can be efficiently implemented and perform well.

Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap IndexesDaniel Lemire

��

Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. These techniques are sensitive to the order of the rows: a simple lexicographical sort can divide the index size by 9 and make indexes several times faster. We investigate reordering heuristics based on computed attribute-value histograms. Simply permuting the columns of the table based on these histograms can increase the sorting efficiency by 40%.

Artificial Intelligence Quick Research Guide by Arthur MorganArthur Morgan

��

This is a Quick Research Guide (QRG). QRGs include the following: - A brief, high-level overview of the QRG topic. - A milestone timeline for the QRG topic. - Links to various free online resource materials to provide a deeper dive into the QRG topic. - Conclusion and a recommendation for at least two books available in the SJPL system on the QRG topic. QRGs planned for the series: - Artificial Intelligence QRG - Quantum Computing QRG - Big Data Analytics QRG (coming 2025) - Spacecraft Guidance, Navigation & Control QRG (coming 2026) - UK Home Computing & The Birth of ARM QRG (coming 2027) Any questions or comments? - Please contact Arthur Morgan at art_morgan@att.net. 100% human made.

Combining Lexical and Semantic Search with Milvus 2.5Zilliz

��

In short, lexical search is a way to search your documents based on the keywords they contain, in contrast to semantic search, which compares the similarity of embeddings. We’ll be covering: Why, when, and how should you use lexical search What is the BM25 distance metric How exactly does Milvus 2.5 implement lexical search How to build an improved hybrid lexical + semantic search with Milvus 2.5

Big Data Analytics Quick Research Guide by Arthur Morgan (PREVIEW)Arthur Morgan

��

Caching for Performance Masterclass: Caching StrategiesScyllaDB

��

GDG Cloud Southlake #40: Brandon Stokes: How to Build a Great ProductJames Anderson

��

How to Build a Great Product Being a tech entrepreneur is about providing a remarkable product or service that serves the needs of its customers better, faster, and cheaper than anything else. The goal is to "make something people want" which we call, product market fit. But how do we get there? We'll explore the process of taking an idea to product market fit (PMF), how you know you have true PMF, and how your product strategies differ pre-PMF from post-PMF. Brandon is a 3x founder, 1x exit, ex-banker & corporate strategist, car dealership owner, and alumnus of Techstars & Y Combinator. He enjoys building products and services that impact people for the better. Brandon has had 3 different careers (banking, corporate finance & strategy, technology) in 7 different industries; Investment Banking, CPG, Media & Entertainment, Telecommunications, Consumer application, Automotive, & Fintech/Insuretech. He's an idea to revenue leader and entrepreneur that helps organizations build products and processes, hire talent, test & iterate quickly, collect feedback, and grow in unregulated and heavily regulated industries.

Getting Started with AWS - Enterprise Landing Zone for Terraform Learning & D...Chris Wahl

��

Recording: https://youtu.be/PASG0NTKUQA?si=1Ih7O9z0Lk0IzX9n Welcome innovators! In this comprehensive tutorial, you will learn how to get started with AWS Cloud and Terraform to build an enterprise-like landing zone for a secure, low-cost environment to develop with Terraform. We'll guide you through setting up AWS Control Tower, Identity and Access Management, and creating a sandbox account, ensuring you have a safe and controlled area for learning and development. You'll also learn about budget management, single sign-on setup, and using AWS organizations for policy management. Plus, dive deep into Terraform basics, including setting up state management, migrating local state to remote state, and making resource modifications using your new infrastructure as code skills. Perfect for beginners looking to master AWS and Terraform essentials!

More Related Content

More from Daniel Lemire (16)

Engineering fast indexesDaniel Lemire

��

MaskedVByte: SIMD-accelerated VByteDaniel Lemire

��

Roaring Bitmaps (January 2016)Daniel Lemire

��

Roaring Bitmap : June 2015 reportDaniel Lemire

��

La vectorisation des algorithmes de compression Daniel Lemire

��

OLAP and moreDaniel Lemire

��

Decoding billions of integers per second through vectorization Daniel Lemire

��

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable CPU time. Therefore, substantial effort has been made to reduce costs associated with compression and decompression. In particular, researchers have exploited the superscalar nature of modern processors and SIMD instructions. Nevertheless, we introduce a novel vectorized scheme called SIMD-BP128 that improves over previously proposed vectorized approaches. It is nearly twice as fast as the previously fastest schemes on desktop processors (varint-G8IU and PFOR). At the same time, SIMD-BP128 saves up to 2 bits per integer. For even better compression, we propose another new vectorized scheme (SIMD-FastPFOR) that has a compression rate within 10% of a state-of-the-art scheme (Simple-8b) while being two times faster during decoding.

Extracting, Transforming and Archiving Scientific DataDaniel Lemire

��

Innovation without permission: from Codd to NoSQLDaniel Lemire

��

Write good papersDaniel Lemire

��

Faster Column-Oriented IndexesDaniel Lemire

��

Compressing column-oriented indexesDaniel Lemire

��

All About Bitmap Indexes... And Sorting ThemDaniel Lemire

��

A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAPDaniel Lemire

��

Tag-Cloud Drawing: Algorithms for Cloud VisualizationDaniel Lemire

��

Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap IndexesDaniel Lemire

��

Engineering fast indexesDaniel Lemire

��

MaskedVByte: SIMD-accelerated VByteDaniel Lemire

��

Roaring Bitmaps (January 2016)Daniel Lemire

��

Roaring Bitmap : June 2015 reportDaniel Lemire

��

La vectorisation des algorithmes de compression Daniel Lemire

��

OLAP and moreDaniel Lemire

��

Decoding billions of integers per second through vectorization Daniel Lemire

��

Extracting, Transforming and Archiving Scientific DataDaniel Lemire

��

Innovation without permission: from Codd to NoSQLDaniel Lemire

��

Write good papersDaniel Lemire

��

Faster Column-Oriented IndexesDaniel Lemire

��

Compressing column-oriented indexesDaniel Lemire

��

All About Bitmap Indexes... And Sorting ThemDaniel Lemire

��

A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAPDaniel Lemire

��

Tag-Cloud Drawing: Algorithms for Cloud VisualizationDaniel Lemire

��

Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap IndexesDaniel Lemire

��

Recently uploaded (20)

Artificial Intelligence Quick Research Guide by Arthur MorganArthur Morgan

��

Combining Lexical and Semantic Search with Milvus 2.5Zilliz

��

Big Data Analytics Quick Research Guide by Arthur Morgan (PREVIEW)Arthur Morgan

��

Caching for Performance Masterclass: Caching StrategiesScyllaDB

��

GDG Cloud Southlake #40: Brandon Stokes: How to Build a Great ProductJames Anderson

��

Getting Started with AWS - Enterprise Landing Zone for Terraform Learning & D...Chris Wahl

��

Mastering ChatGPT & LLMs for Practical Applications: Tips, Tricks, and Use CasesSanjay Willie

��

Our latest session with Astiostech covered how to unlock the full potential of ChatGPT and LLMs for real-world use! ✅ Key Takeaways: 🔹 Effective Prompting: Crafting context-specific, high-quality prompts for optimal AI responses. 🔹 Advanced ChatGPT Features: Managing system prompts, conversation memory, and file uploads. 🔹 Optimizing AI Outputs: Refining responses, handling large texts, and knowing when fine-tuning is needed. 🔹 Competitive Insights: Exploring how ChatGPT compares with other AI tools. 🔹 Business & Content Use Cases: From summarization to SEO, sales, and audience targeting. 💡 The session provided hands-on strategies to make AI a powerful tool for content creation, decision-making, and business growth. 🚀 Are you using AI effectively in your workflow? Let’s discuss how it can improve efficiency and creativity! #AI #ChatGPT #PromptEngineering #ArtificialIntelligence #LLM #Productivity #Astiostech

TrustArc Webinar: State of State Privacy LawsTrustArc

��

The U.S. data privacy landscape is rapidly proliferating, with 20 states enacting comprehensive privacy laws as of November 2024. These laws cover consumer rights, data collection and use including for sensitive data, data security, transparency, and various enforcement mechanisms and penalties for non-compliance. Navigating this patchwork of state-level laws is crucial for businesses to ensure compliance and requires a combination of strategic planning, operational adjustments, and technology to be proactive. Join leading experts from TrustArc, the Future of Privacy Forum, and Venable for an insightful webinar exploring the evolution of state data privacy laws and practical strategies to maintain compliance in 2025. This webinar will review: - A comprehensive overview of each state’s privacy regulations and the latest updates - Practical considerations to help your business achieve regulatory compliance across multiple states - Actionable insights to future-proof your business for 2025

Bedrock Data Automation (Preview): Simplifying Unstructured Data ProcessingZilliz

��

Bedrock Data Automation (BDA) is a cloud-based service that simplifies the process of extracting valuable insights from unstructured content—such as documents, images, video, and audio. Come learn how BDA leverages generative AI to automate the transformation of multi-modal data into structured formats, enabling developers to build applications and automate complex workflows with greater speed and accuracy.

The Constructor's Digital Transformation Playbook: Reducing Risk With TechnologyAggregage

��

Revolutionizing Field Service: How LLMs Are Powering Smarter Knowledge Access...Earley Information Science

��

Revolutionizing Field Service with LLM-Powered Knowledge Management Field service technicians need instant access to accurate repair information, but outdated knowledge systems often create frustrating delays. Large Language Models (LLMs) are changing the game—enhancing knowledge retrieval, streamlining troubleshooting, and reducing technician dependency on senior staff. In this webinar, Seth Earley and industry experts Sanjay Mehta, and Heather Eisenbraun explore how LLMs and Retrieval-Augmented Generation (RAG) are transforming field service operations. Discover how AI-powered knowledge management is improving efficiency, reducing downtime, and elevating service quality. LLMs for Instant Knowledge Retrieval – How AI-driven search dramatically cuts troubleshooting time. Structured Data & AI – Why high-quality, organized knowledge is essential for LLM success. Real-World Implementation – Lessons from deploying LLM-powered knowledge tools in field service. Business Impact – How AI reduces service delays, optimizes workflows, and enhances technician productivity. Empower your field service teams with AI-driven knowledge access. Watch the webinar to see how LLMs are revolutionizing service efficiency.

Temporary Compound microscope slide .pptxSamir Sharma

��

Benchmark Testing Demystified: Your Roadmap to Peak PerformanceShubham Joshi

��

Benchmark testing is the cornerstone of understanding your system’s performance, and this guide breaks it down step-by-step. Learn how to design tests that simulate real-world conditions, measure key performance metrics, and interpret results effectively. This comprehensive roadmap covers everything from selecting the right tools to creating repeatable tests that help identify bottlenecks and optimize resource usage. Whether you're dealing with web applications, mobile apps, or enterprise software, this guide offers practical tips and real-life examples to ensure your system runs at peak efficiency.

Transcript: AI in publishing: Your questions answered - Tech Forum 2025BookNet Canada

��

George Walkley, a publishing veteran and leading authority on AI applications, joins us for a follow-up to his presentation "Applying AI to publishing: A balanced and ethical approach". George gives a brief overview of developments since that presentation and answers attendees' pressing questions about AI’s impact and potential applications in the book industry. Link to recording and presentation slides: https://bnctechforum.ca/sessions/ai-in-publishing-your-questions-answered/ Presented by BookNet Canada on February 20, 2025 with support from the Department of Canadian Heritage.

What's New? ThousandEyes Product Features and HighlightsThousandEyes

��

Not a Kubernetes fan? The state of PaaS in 2025Anthony Dahanne

��

Kubernetes won the containers orchestration war. But has it made deploying your apps easier? Let's explore some of Kubernetes extensive app developer tooling, but mainly what the PaaS space looks like in 2025; 18 years after Heroku made it popular. Is Heroku still around? What about Cloud Foundry? And what are those new comers (fly.io, railway, porter.sh, etc.) worth? Did the Cloud giants replace them all?

AMER Introduction to ThousandEyes WebinarThousandEyes

��

Understanding & Utilizing SharePoint Advanced ManagementDrew Madelung

��

Drew Madelung is a Cloud Solutions Architect and a Microsoft MVP for Office Apps and Services. He helps organizations realize what is possible with Microsoft 365 & Azure, onboard them in a secure and compliant way, and drive sustained adoption for those solutions. He is experienced in a range of technologies but specializes in the collaboration and teamwork workspaces such as Microsoft Teams, SharePoint, and OneDrive. He has helped deploy Microsoft 365 to multiple global companies while rolling out modern information protection and information governance technologies. He has been doing Microsoft consulting for 10+ years with a strength in security & compliance solutions.

Deno ...................................Robert MacLean

��

William Maclyn Murphy McRae - A Seasoned Professional RenownedWilliam Maclyn Murphy McRae

��

Artificial Intelligence Quick Research Guide by Arthur MorganArthur Morgan

��

Combining Lexical and Semantic Search with Milvus 2.5Zilliz

��

Big Data Analytics Quick Research Guide by Arthur Morgan (PREVIEW)Arthur Morgan

��

Caching for Performance Masterclass: Caching StrategiesScyllaDB

��

GDG Cloud Southlake #40: Brandon Stokes: How to Build a Great ProductJames Anderson

��

Getting Started with AWS - Enterprise Landing Zone for Terraform Learning & D...Chris Wahl

��

Mastering ChatGPT & LLMs for Practical Applications: Tips, Tricks, and Use CasesSanjay Willie

��

TrustArc Webinar: State of State Privacy LawsTrustArc

��

Bedrock Data Automation (Preview): Simplifying Unstructured Data ProcessingZilliz

��

The Constructor's Digital Transformation Playbook: Reducing Risk With TechnologyAggregage

��

Revolutionizing Field Service: How LLMs Are Powering Smarter Knowledge Access...Earley Information Science

��

Temporary Compound microscope slide .pptxSamir Sharma

��

Benchmark Testing Demystified: Your Roadmap to Peak PerformanceShubham Joshi

��

Transcript: AI in publishing: Your questions answered - Tech Forum 2025BookNet Canada

��

What's New? ThousandEyes Product Features and HighlightsThousandEyes

��

Not a Kubernetes fan? The state of PaaS in 2025Anthony Dahanne

��

AMER Introduction to ThousandEyes WebinarThousandEyes

��

Understanding & Utilizing SharePoint Advanced ManagementDrew Madelung

��

Deno ...................................Robert MacLean

��

William Maclyn Murphy McRae - A Seasoned Professional RenownedWilliam Maclyn Murphy McRae

��

�ݺ�ߣ