Home › Entities › academia › An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors

An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors

Research article (ACM Transactions on Information Systems, 2023) · cited 13× · AI/ML
academia openalex:W4384523577
Press Enter · cited answer in seconds

An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors

Summary

An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors is a scholarly article[1].

Key Facts

  • An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors's instance of is recorded as scholarly article[2].

Related Entities

Franco Maria Nardini

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors
MLA “An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors.
BibTeX @misc{4ortxyz_an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors}}, year = {2026}, url = {https://4ort.xyz/entity/an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors — https://4ort.xyz/entity/an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-approximate-algorithm-for-maximum-inner-product-search-over-streaming-sparse-vectors · Last refreshed: