Parsing Millions of URLs per Second

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Nizipli, Yagiz, Lemire, Daniel
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917630484414464
author Nizipli, Yagiz
Lemire, Daniel
author_facet Nizipli, Yagiz
Lemire, Daniel
contents URLs are fundamental elements of web applications. By applying vector algorithms, we built a fast standard-compliant C++ implementation. Our parser uses three times fewer instructions than competing parsers following the WHATWG standard (e.g., Servo's rust-url) and up to eight times fewer instructions than the popular curl parser. The Node.js environment adopted our C++ library. In our tests on realistic data, a recent Node.js version (20.0) with our parser is four to five times faster than the last version with the legacy URL parser.
format Preprint
id arxiv_https___arxiv_org_abs_2311_10533
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Parsing Millions of URLs per Second
Nizipli, Yagiz
Lemire, Daniel
Programming Languages
Data Structures and Algorithms
URLs are fundamental elements of web applications. By applying vector algorithms, we built a fast standard-compliant C++ implementation. Our parser uses three times fewer instructions than competing parsers following the WHATWG standard (e.g., Servo's rust-url) and up to eight times fewer instructions than the popular curl parser. The Node.js environment adopted our C++ library. In our tests on realistic data, a recent Node.js version (20.0) with our parser is four to five times faster than the last version with the legacy URL parser.
title Parsing Millions of URLs per Second
topic Programming Languages
Data Structures and Algorithms
url https://arxiv.org/abs/2311.10533