Image de couverture de livre

Approximating Opaque Top-k Queries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chang, Jiwon, Nargesian, Fatemeh
Format:	Preprint
Publié:	2025
Sujets:	Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

ListK: Semantic ORDER BY and LIMIT K with Listwise Prompting
par: Shin, Jason, et autres
Publié: (2026)

Query Refinement for Diverse Top-$k$ Selection
par: Campbell, Felix S., et autres
Publié: (2024)

OpenForge: Probabilistic Metadata Integration
par: Cong, Tianji, et autres
Publié: (2024)

Top-k Approximate Functional Dependency Discovery
par: Wan, Xiaolong, et autres
Publié: (2026)

GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
par: Ge, Mingchang, et autres
Publié: (2025)

Approximate Reverse $k$-Ranks Queries in High Dimensions
par: Amagata, Daichi, et autres
Publié: (2025)

Efficient Algorithms for Top-k Stabbing Queries on Weighted Interval Data (Full Version)
par: Amagata, Daichi, et autres
Publié: (2024)

FairEM360: A Suite for Responsible Entity Matching
par: Shahbazi, Nima, et autres
Publié: (2024)

Personalized Top-k Set Queries Over Predicted Scores
par: Nia, Sohrab Namazi, et autres
Publié: (2025)

NetChain: Authenticated Blockchain Top-k Graph Data Queries and its Application in Asset Management
par: Zhao, Hongguang, et autres
Publié: (2025)

Discovering Top-k Periodic and High-Utility Patterns
par: Zhou, Qingfeng, et autres
Publié: (2025)

Flexible Keyword-Aware Top-$k$ Route Search
par: Yu, Ziqiang, et autres
Publié: (2025)

Top-k contrast order-preserving pattern mining
par: Wu, Youxi, et autres
Publié: (2023)

Top-k Representative Search for Comparative Tree Summarization
par: Chen, Yuqi, et autres
Publié: (2024)

Temporal $k$-Core Query, Revisited
par: Liu, Yinyu, et autres
Publié: (2025)

Learning Approximation Sets for Exploratory Queries
par: Davidson, Susan B., et autres
Publié: (2024)

Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
par: Chen, Liuyi, et autres
Publié: (2025)

Understanding User Preference -- Comparison between Linear and Directional Top-K Query results
par: Jiang, Xiaolei
Publié: (2025)

Probabilistic Top-k Dominating Query Monitoring over Multiple Uncertain IoT Data Streams in Edge Computing Environments
par: Lai, Chuan-Chi, et autres
Publié: (2019)

Redundancy-Driven Top-$k$ Functional Dependency Discovery
par: Wan, Xiaolong, et autres
Publié: (2026)

Complete Approximations of Incomplete Queries
par: Corman, Julien, et autres
Publié: (2024)

Combined Approximations for Uniform Operational Consistent Query Answering
par: Calautti, Marco, et autres
Publié: (2025)

Efficient k-step Weighted Reachability Query Processing Algorithms
par: Mei, Congquan, et autres
Publié: (2024)

Approximating Queries on Probabilistic Graphs
par: Amarilli, Antoine, et autres
Publié: (2023)

Multi-Attribute Group Fairness in $k$-NN Queries on Vector Databases
par: On, Thinh, et autres
Publié: (2026)

MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance
par: d'Hondt, Jens E., et autres
Publié: (2025)

Approximate Diverse $k$-nearest Neighbor Search in Vector Database
par: Zhao, Jiachen, et autres
Publié: (2025)

Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries
par: Hu, Xiao, et autres
Publié: (2026)

Distributed Processing of kNN Queries over Moving Objects on Dynamic Road Networks
par: Tao, Mingjin, et autres
Publié: (2025)

Approximation-First Timeseries Monitoring Query At Scale
par: Zhu, Zeying, et autres
Publié: (2025)

PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression
par: Hurst, Aaron, et autres
Publié: (2024)

ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search
par: Yang, Mingyu, et autres
Publié: (2025)

Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search
par: Yang, Mingyu, et autres
Publié: (2024)

BRkNN-light: Batch Processing of Reverse k-Nearest Neighbor Queries for Moving Objects on Road Networks
par: Song, Anbang, et autres
Publié: (2025)

TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
par: Wei, Jiuqi, et autres
Publié: (2026)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
par: Focke, Jacob, et autres
Publié: (2021)

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

A Formalization of Top-Down Unnesting
par: Neumann, Thomas
Publié: (2024)

Private Approximate Query over Horizontal Data Federation
par: Laouir, Ala Eddine, et autres
Publié: (2024)

Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees
par: Zhu, Yuxuan, et autres
Publié: (2026)