Image de couverture de livre

COPR -- Efficient, large-scale log storage and retrieval

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Reichinger, Julian, Krismayer, Thomas, Rellermeyer, Jan
Format:	Preprint
Publié:	2024
Sujets:	Information Retrieval Databases Data Structures and Algorithms H.3.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
par: Güting, Ralf Hartmut, et autres
Publié: (2024)

Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$
par: Prinz, Thomas M., et autres
Publié: (2024)

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Timehash: Hierarchical Time Indexing for Efficient Business Hours Search
par: Kim, Jinoh, et autres
Publié: (2026)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, et autres
Publié: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
par: Huang, Qiang, et autres
Publié: (2024)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
par: Dhulipala, Laxman, et autres
Publié: (2024)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
par: Tabei, Yasuo
Publié: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
par: Li, Hui, et autres
Publié: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
Publié: (2025)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
par: Pan, Yunjie, et autres
Publié: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Generalized compression and compressive search of large datasets
par: Prior, Morgan E., et autres
Publié: (2024)

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers
par: Adams, Philip, et autres
Publié: (2025)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
par: Zhang, Ziyu, et autres
Publié: (2025)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
par: Pan, Yunjie, et autres
Publié: (2024)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

CORGI: Efficient Pattern Matching With Quadratic Guarantees
par: Weitekamp, Daniel
Publié: (2025)

Retrieval with Learned Similarities
par: Ding, Bailu, et autres
Publié: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Model-Free Counterfactual Subset Selection at Scale
par: Nguyen, Minh Hieu, et autres
Publié: (2025)

Results of the Big ANN: NeurIPS'23 competition
par: Simhadri, Harsha Vardhan, et autres
Publié: (2024)

AlayaDB: The Data Foundation for Efficient and Effective Long-context LLM Inference
par: Deng, Yangshen, et autres
Publié: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
par: Berger, Benjamin
Publié: (2025)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
par: Dhulipala, Laxman, et autres
Publié: (2023)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
par: Xu, Zhenxiang, et autres
Publié: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
par: Petrov, Aleksandr V., et autres
Publié: (2024)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
par: Zhang, Tian, et autres
Publié: (2026)

Memory Based Collaborative Filtering with Lucene
par: Gennaro, Claudio
Publié: (2016)

Foundations of Vector Retrieval
par: Bruch, Sebastian
Publié: (2024)

An Effective Tag Assignment Approach for Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
par: Lebeda, Christian Janos, et autres
Publié: (2024)