Image de couverture de livre

Dimensionality Reduced Clustered Data and Order Partition and Stepwise Dimensionality Increasing Indices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Thomasian, Alexander
Format:	Preprint
Publié:	2024
Sujets:	Databases Digital Libraries Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
par: Yang, Huihui, et autres
Publié: (2025)

Range (Rényi) Entropy Queries and Partitioning
par: Esmailpour, Aryan, et autres
Publié: (2023)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)

New Compressed Indices for Multijoins on Graph Databases
par: Arroyuelo, Diego, et autres
Publié: (2024)

Clustering with Set Outliers and Applications in Relational Clustering
par: Surianarayanan, Vaishali, et autres
Publié: (2025)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
par: Wang, Kaixin, et autres
Publié: (2026)

Scalable Order-Preserving Pattern Mining
par: Li, Ling, et autres
Publié: (2024)

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

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

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data
par: Li, Xiaoyu, 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)

Computing Data Distribution from Query Selectivities
par: Agarwal, Pankaj K., 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)

Faster Relational Algorithms Using Geometric Data Structures
par: Esmailpour, Aryan, et autres
Publié: (2026)

Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
par: Liu, Kaiwen, et autres
Publié: (2026)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
par: Zhao, Fuheng, et autres
Publié: (2023)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond
par: Stoian, Mihail, et autres
Publié: (2022)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
par: Arenas, Marcelo, et autres
Publié: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
par: Hamada, Kou, et autres
Publié: (2024)

Approaching 100% Confidence in Stream Summary through ReliableSketch
par: Wu, Yuhan, et autres
Publié: (2024)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
par: Kenig, Batya, et autres
Publié: (2024)

Space-Efficient Indexes for Uncertain Strings
par: Gabory, Esteban, et autres
Publié: (2024)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
par: Ertl, Otmar
Publié: (2024)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
par: Zhou, Yingli, et autres
Publié: (2024)

Optimal Dynamic Parameterized Subset Sampling
par: Gan, Junhao, et autres
Publié: (2024)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
par: Kurkure, Yash, et autres
Publié: (2024)

Text Indexing for Long Patterns using Locally Consistent Anchors
par: Ayad, Lorraine A. K., et autres
Publié: (2024)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

Influential Slot and Tag Selection in Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
par: Fan, Xiaoyu, et autres
Publié: (2024)

Recent Increments in Incremental View Maintenance
par: Olteanu, Dan
Publié: (2024)

Targeted Least Cardinality Candidate Key for Relational Databases
par: Nakos, Vasileios, et autres
Publié: (2024)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

Aleph Filter: To Infinity in Constant Time
par: Dayan, Niv, et autres
Publié: (2024)