Cover Image

On-Demand JSON: A Better Way to Parse Documents?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Keiser, John, Lemire, Daniel
Format:	Preprint
Published:	2023
Subjects:	Databases Performance
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parsing Gigabytes of JSON per Second
by: Langdale, Geoff, et al.
Published: (2019)

Validating UTF-8 In Less Than One Instruction Per Byte
by: Keiser, John, et al.
Published: (2020)

On‐demand JSON: A better way to parse documents?
by: John Keiser, et al.
Published: (2024)

BranchBench: Aligning Database Branching with Agentic Demands
by: Ang, Elaine, et al.
Published: (2026)

A Modular Graph-Native Query Optimization Framework
by: Lyu, Bingqing, et al.
Published: (2024)

LoPace: A Lossless Optimized Prompt Accurate Compression Engine for Large Language Model Applications
by: Ulla, Aman
Published: (2026)

Accelerating Machine Learning Queries with Linear Algebra Query Processing
by: Sun, Wenbo, et al.
Published: (2023)

Implementing and Evaluating E2LSH on Storage
by: Nakanishi, Yu, et al.
Published: (2024)

On the effects of logical database design on database size, query complexity, query performance, and energy consumption
by: Taipalus, Toni
Published: (2025)

Robust Recursive Query Parallelism in Graph Database Management Systems
by: Chakraborty, Anurag, et al.
Published: (2025)

Micro-architectural Analysis of OLAP: Limitations and Opportunities
by: Sirin, Utku, et al.
Published: (2019)

One-Hop Sub-Query Result Caches for Graph Database Systems
by: Nguyen, Hieu, et al.
Published: (2024)

HistogramTools for Efficient Data Analysis and Distribution Representation in Large Data Sets
by: Malhotra, Shubham
Published: (2025)

CXL and the Return of Scale-Up Database Engines
by: Lerner, Alberto, et al.
Published: (2024)

Analysis and Evaluation of Using Microsecond-Latency Memory for In-Memory Indices and Caches in SSD-Based Key-Value Stores
by: Bando, Yosuke, et al.
Published: (2025)

GraphMini: Accelerating Graph Pattern Matching Using Auxiliary Graphs
by: Liu, Juelin, et al.
Published: (2024)

FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
by: Sharma, Akshit, et al.
Published: (2024)

Heterogeneous Data Access Model for Concurrency Control and Methods to Deal with High Data Contention
by: Thomasian, Alexander
Published: (2024)

Sig2Model: A Boosting-Driven Model for Updatable Learned Indexes
by: Heidari, Alireza, et al.
Published: (2025)

JSPIM: A Skew-Aware PIM Accelerator for High-Performance Databases Join and Select Operations
by: Tajdari, Sabiha, et al.
Published: (2025)

Faster Base64 Encoding and Decoding Using AVX2 Instructions
by: Muła, Wojciech, et al.
Published: (2017)

VDTuner: Automated Performance Tuning for Vector Data Management Systems
by: Yang, Tiannuo, et al.
Published: (2024)

Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study
by: Merkel, Nikolai, et al.
Published: (2024)

Leveraging Approximate Caching for Faster Retrieval-Augmented Generation
by: Bergman, Shai, et al.
Published: (2025)

P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction
by: Rayhan, Yeasir, et al.
Published: (2024)

Real-time Event Joining in Practice With Kafka and Flink
by: Saket, Srijan, et al.
Published: (2024)

Fixing ill-formed UTF-16 strings with SIMD instructions
by: Clausecker, Robert, et al.
Published: (2026)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
by: Chen, Yuan, et al.
Published: (2025)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)

Towards a Standard for JSON Document Databases
by: Botoeva, Elena, et al.
Published: (2025)

VectorSearch: Enhancing Document Retrieval with Semantic Embeddings and Optimized Search
by: Monir, Solmaz Seyed, et al.
Published: (2024)

AR-PPF: Advanced Resolution-Based Pixel Preemption Data Filtering for Efficient Time-Series Data Analysis
by: Kim, Taewoong, et al.
Published: (2024)

PHast -- Perfect Hashing made fast
by: Beling, Piotr, et al.
Published: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)

Terabyte-Scale Analytics in the Blink of an Eye
by: Wu, Bowen, et al.
Published: (2025)

Kairos: Efficient Temporal Graph Analytics on a Single Machine
by: da Trindade, Joana M. F., et al.
Published: (2024)

FluxSieve: Unifying Streaming and Analytical Data Planes for Scalable Cloud Observability
by: Vogel, Adriano, et al.
Published: (2026)

From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
by: Abtahi, Seyed Moein, et al.
Published: (2025)

Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining
by: Singapuram, Sanjay Sri Vallabh, et al.
Published: (2025)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)