Rana Alotaibi

Rana Alotaibi

Auto-generated profile, based on publicly available information

Rana Alotaibi

Microsoft Gray Systems Lab, Redmond, WA, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
HHHanxian Huang
Hanxian Huang
TSTarique Siddiqui
Tarique Siddiqui
RARana Alotaibi
Rana Alotaibi
CCCarlo Curino
Carlo Curino
JLJyoti Leeka
Jyoti Leeka
YTYuanyuan Tian
Yuanyuan Tian
Database systems often rely on historical query traces to perform workload-based performance tuning. However, real production workloads are time-evolving, making historical queries ineffective for optimizing future workloads. To address this challenge, we propose SIBYL, an end-to-end machine learning-based framework that accurately forecasts a sequence of future queries, with the entire query statements, in various prediction windows. Drawing insights from real-workloads, we propose template-based featurization techniques and develop a stacked-LSTM with an encoder-decoder architecture for accurate forecasting of query workloads. We also develop techniques to improve forecasting accuracy over large prediction windows and achieve high scalability over large workloads with high variability in arrival rates of queries. Finally, we propose techniques to handle workload drifts. Our evaluation on four real workloads demonstrates that SIBYL can forecast workloads with an 87.3% median F1 score, and can result in 1.7× and 1.3× performance improvement when applied to materialized view selection and index selection applications, respectively.

4 June 2023
Verified
Conference Paper
Open access
YZYiwen Zhu
Yiwen Zhu
YTYuanyuan Tian
Yuanyuan Tian
JCJoyce Cahoon
Joyce Cahoon
SKSubru Krishnan
Subru Krishnan
AAAnkita Agarwal
Ankita Agarwal
RRRaghu Ramakrishnan
Raghu Ramakrishnan

8 December 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
BHBrandon Haynes
Brandon Haynes
RARana Alotaibi
Rana Alotaibi
APAnna Pavlenko
Anna Pavlenko
JLJyoti Leeka
Jyoti Leeka
AJAlekh Jindal
Alekh Jindal
YTYuanyuan Tian
Yuanyuan Tian
Large scale analytics engines have become a core dependency for modern data-driven enterprises to derive business insights and drive actions. These engines support a large number of analytic jobs processing huge volumes of data on a daily basis, and workloads are often inundated with overlapping computations across multiple jobs. Reusing common computation is crucial for efficient cluster resource utilization and reducing job execution time. Detecting common computation is the first and key step for reducing this computational redundancy. However, detecting equivalence on large-scale analytics engines requires efficient and scalable solutions that are fully automated. In addition, to maximize computation reuse, equivalence needs to be detected at the semantic level instead of just the syntactic level (i.e., the ability to detect semantic equivalence of seemingly different-looking queries). Unfortunately, existing solutions fall short of satisfying these requirements. In this paper, we take a major step towards filling this gap by proposing GEqO, a portable and lightweight machine-learning-based framework for efficiently identifying semantically equivalent computations at scale. GEqO introduces two machine-learning-based filters that quickly prune out nonequivalent subexpressions and employs a semi-supervised learning feedback loop to iteratively improve its model with an intelligent sampling mechanism. Further, with its novel database-agnostic featurization method, GEqO can transfer the learning from one workload and database to another. Our extensive empirical evaluation shows that, on TPC-DS-like queries, GEqO yields significant performance gains-up to 200x faster than automated verifiers-and finds up to 2x more equivalences than optimizer and signature-based equivalence detection approaches.

3 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
CLChuan Lei
Chuan Lei
RARana Alotaibi
Rana Alotaibi
AQAbdul Quamar
Abdul Quamar
VEVasilis Efthymiou
Vasilis Efthymiou
FÖFatma Özcan
Fatma Özcan
Enterprises are creating domain-specific knowledge graphs by curating and integrating their business data from multiple sources. The data in these knowledge graphs can be described using ontologies, which provide a semantic abstraction to define the content in terms of the entities and the relationships of the domain. The rich semantic relationships in an ontology contain a variety of opportunities to reduce edge traversals and consequently improve the graph query performance. Although there has been a lot of effort to build systems that enable efficient querying over knowledge graphs, the problem of schema optimization for query performance has been largely ignored in the graph setting. In this work, we show that graph schema design has significant impact on query performance, and then propose optimization algorithms that exploit the opportunities from the domain ontology to generate efficient property graph schemas. To the best of our knowledge, we are the first to present an ontology-driven approach for property graph schema optimization. We conduct empirical evaluations with two real-world knowledge graphs from medical and financial domains. The results show that the schemas produced by the optimization algorithms achieve up to 2 orders of magnitude speed-up compared to the baseline approach.