2026· International Journal of Advanced Computer Science and Applications· Vol 17· 0 citations· 78 references
TL;DR
This study analyzes the practical considerations for WCOJ adoption across three core query engine layers: interpretation, optimization, and execution, before extending to distributed environments and indicates that the primary bottlenecks delaying widespread adoption are architectural rather than algorithmic.
Abstract
Worst-case optimal join (WCOJ) algorithms have attracted significant interest in both academia and industry due to their strong asymptotic performance guarantees. However, their integration into mature relational database management systems (RDBMSs) remains severely limited. Unlike prior theoretical surveys, this study analyzes the practical considerations for WCOJ adoption across three core query engine layers: interpretation, optimization, and execution, before extending to distributed environments. The findings indicate that the primary bottlenecks delaying widespread adoption are architectural rather than algorithmic. Specifically, WCOJ integration necessitates a fundamental shift in the optimization layer toward hybrid planning and new objective functions based on intersection costs. Furthermore, at the execution layer, the unpredictable pointer-chasing inherent to hierarchical index traversals creates severe hardware inefficiencies. By synthesizing ongoing research efforts, this survey provides a structured roadmap of engineering trade-offs to guide practitioners in successfully integrating WCOJs into conventional database architectures.
Modern web applications are increasingly reliant on Object-Relational Mapper (ORM) frameworks to bridge the gap between high-level application logic and relational databases. However, in standard Create, Read, Update, and Delete (CRUD) architectures, the use of a unified data model often leads to significant performanc...
Justin Evan Surya, Kenny Jingga· International Conferences on...· 0 citations
DBRepro is presented, an automated end-to-end framework that formulates database generation as a constrained distribution synthesis problem that reproduces the execution performance of complex slow queries with high fidelity on a nearly 1 TB real-world dataset.
Zhao-Yang Zhang, Shuang Liu, Deng-Feng Xu et al.· Proceedings of the 41st IEEE...· 0 citations
Efficiency of skyline algorithms is highly influenced by the underlying data characteristics. Traditionally, optimization efforts have focused on minimizing the total number of tuple-pair dominance checks to improve query performance. However, in practice, a dominance check between two tuples does not necessarily requi...
Abhinav Gorantla, Pratanu Mandal, K. Candan et al.· 0 citations
A systematic benchmark comparing all three layout strategies across four analytical workload types on a 50-million-record dataset, using real Databricks query profiles contains at least two findings I have not seen documented anywhere else, and one of them is a failure mode that could silently degrade query performance...
Kushal Vishwakarma· Advanced International Journ...· 0 citations
CRM+RCCR, an architecture-agnostic cost-aware objective that encodes cost preference into continuous relevance targets through per-pair independent scoring, eliminating multi-positive dilution while regularizing queries with similar routing preferences to be closer in the routing space.
Tao Yu, Yi-Fei Qu, Zhi-Qing Cui et al.· 1 citation
Optimization of queries in RDBMSs have been one of the most important roadblocks as the rule-based optimizer s fail to scale to the non-linear nature of the new analytical workloads. Although Machine Learning (ML) models have demonstrated good latency predictability, their poor interpret-ability creates a Trust Ga...
Hanan Abed Alwally Abed Allah, علي عزيز محمد الساعدي, Saif Saad Khudhair· Journal of the College of B...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.