Pith. sign in

REVIEW 2 cited by

The Design and Implementation of a Real Time Visual Search System on JD E-commerce Platform

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.07389 v1 pith:EVD3BRBT submitted 2019-08-19 cs.IR

The Design and Implementation of a Real Time Visual Search System on JD E-commerce Platform

classification cs.IR
keywords realsearchsystemvisualtimedesigne-commerceimage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present the design and implementation of a visual search system for real time image retrieval on JD.com, the world's third largest and China's largest e-commerce site. We demonstrate that our system can support real time visual search with hundreds of billions of product images at sub-second timescales and handle frequent image updates through distributed hierarchical architecture and efficient indexing methods. We hope that sharing our practice with our real production system will inspire the middleware community's interest and appreciation for building practical large scale systems for emerging applications, such as ecommerce visual search.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances

    cs.IR 2026-05 unverdicted novelty 6.0

    FAVOR achieves 1.3-5x higher QPS at 95% Recall@10 for arbitrary filtered ANNS by combining exclusion-distance reshaping in HNSW graphs with a selectivity-driven router that switches between brute-force and optimized search.

  2. Cardinality Estimation for High Dimensional Similarity Queries with Adaptive Bucket Probing

    cs.DB 2026-04 unverdicted novelty 4.0

    An LSH-based system with adaptive bucket probing, progressive sampling, and product quantization estimates cardinality for high-dimensional similarity queries efficiently.