Ibrahim Abdelaziz

Ibrahim Abdelaziz

Auto-generated profile, based on publicly available information

Ibrahim Abdelaziz

IBM Research USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
30 November 2017
Verified
Conference Paper
Open access
ASAmedeo Sapio
Amedeo Sapio
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
AAAbdulla Aldilaijan
Abdulla Aldilaijan
MCMarco Canini
Marco Canini
PKPanos Kalnis
Panos Kalnis
Programmable data plane hardware creates new opportunities for infusing intelligence into the network. This raises a fundamental question: what kinds of computation should be delegated to the network? In this paper, we discuss the opportunities and challenges for co-designing data center distributed systems with their network layer. We believe that the time has finally come for offloading part of their computation to execute in-network. However, in-network computation tasks must be judiciously crafted to match the limitations of the network machine architecture of programmable devices. With the help of our experiments on machine learning and graph analytics workloads, we identify that aggregation functions raise opportunities to exploit the limited computation power of networking hardware to lessen network congestion and improve the overall application performance. Moreover, as a proof-of-concept, we propose D AIET , a system that performs in-network data aggregation. Experimental results with an initial prototype show a large data reduction ratio (86.9%-89.3%) and a similar decrease in the workers' computation time

1 May 2017 in Journal of Web Semantics
Verified
Journal Article
Open access
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
AFAchille Fokoue
Achille Fokoue
OHOktie Hassanzadeh
Oktie Hassanzadeh
PZPing Zhang
Ping Zhang
MSMohammad Sadoghi
Mohammad Sadoghi
Drug-Drug Interactions (DDIs) are a major cause of preventable Adverse Drug Reactions (ADRs), causing a significant burden on the patients’ health and the healthcare system. It is widely known that clinical studies cannot sufficiently and accurately identify DDIs for new drugs before they are made available on the market. In addition, existing public and proprietary sources of DDI information are known to be incomplete and/or inaccurate and so not reliable. As a result, there is an emerging body of research on in-silico prediction of drug-drug interactions. In this paper, we present Tiresias, a large-scale similarity-based framework that predicts DDIs through link prediction. Tiresias takes in various sources of drug-related data and knowledge as inputs, and provides DDI predictions as outputs. The process starts with semantic integration of the input data that results in a knowledge graph describing drug attributes and relationships with various related entities such as enzymes, chemical structures, and pathways. The knowledge graph is then used to compute several similarity measures between all the drugs in a scalable and distributed framework. In particular, Tiresias utilizes two classes of features in a knowledge graph: local and global features. Local features are derived from the information directly associated to each drug (i.e., one hop away) while global features are learnt by minimizing a global loss function that considers the complete structure of the knowledge graph. The resulting similarity metrics are used to build features for a large-scale logistic regression model to predict potential DDIs. We highlight the novelty of our proposed Tiresias and perform thorough evaluation of the quality of the predictions. The results show the effectiveness of Tiresias in both predicting new interactions among existing drugs as well as newly developed drugs

8 February 2016 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
RHRazen Harbi
Razen Harbi
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
PKPanos Kalnis
Panos Kalnis
NMNikos Mamoulis
Nikos Mamoulis
YEYasser Ebrahim
Yasser Ebrahim
MSMajed Sahli
Majed Sahli

1 September 2017 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
RHRazen Harbi
Razen Harbi
ZKZuhair Khayyat
Zuhair Khayyat
PKPanos Kalnis
Panos Kalnis
Distributed SPARQL engines promise to support very large RDF datasets by utilizing shared-nothing computer clusters. Some are based on distributed frameworks such as MapReduce; others implement proprietary distributed processing; and some rely on expensive preprocessing for data partitioning. These systems exhibit a variety of trade-offs that are not well-understood, due to the lack of any comprehensive quantitative and qualitative evaluation. In this paper, we present a survey of 22 state-of-the-art systems that cover the entire spectrum of distributed RDF data processing and categorize them by several characteristics. Then, we select 12 representative systems and perform extensive experimental evaluation with respect to preprocessing cost, query performance, scalability and workload adaptability, using a variety of synthetic and real large datasets with up to 4.3 billion triples. Our results provide valuable insights for practitioners to understand the trade-offs for their usage scenarios. Finally, we publish online our evaluation framework, including all datasets and workloads, for researchers to compare their novel systems against the existing ones.

1 November 2016
Verified
Conference Paper
Closed access
EAEhab Abdelhamid
Ehab Abdelhamid
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
PKPanos Kalnis
Panos Kalnis
ZKZuhair Khayyat
Zuhair Khayyat
FJFuad Jamour
Fuad Jamour
Frequent Subgraph Mining is an essential operation for graph analytics and knowledge extraction. Due to its high computational cost, parallel solutions are necessary. Existing approaches either suffer from load imbalance, or high communication and synchronization overheads. In this paper we propose ScaleMine; a novel parallel frequent subgraph mining system for a single large graph. ScaleMine introduces a novel two-phase approach. The first phase is approximate; it quickly identifies subgraphs that are frequent with high probability, while collecting various statistics. The second phase computes the exact solution by employing the results of the approximation to achieve good load balance; prune the search space; generate efficient execution plans; and guide intra-task parallelism. Our experiments show that ScaleMine scales to 8,192 cores on a Cray XC40 (12× more than competitors); supports graphs with one billion edges (10× larger than competitors), and is at least an order of magnitude faster than existing solutions.

1 January 2024
Verified
Conference Paper
Open access
PDF file
KBKinjal Basu
Kinjal Basu
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
SCSubhajit Chaudhury
Subhajit Chaudhury
SDSoham Dan
Soham Dan
MCMaxwell Crouse
Maxwell Crouse
LLLuis Lastras
Luis Lastras
Kinjal Basu, Ibrahim Abdelaziz, Subhajit Chaudhury, Soham Dan, Maxwell Crouse, Asim Munawar, Vernon Austel, Sadhana Kumaravel, Vinod Muthusamy, Pavan Kapanipathi, Luis Lastras. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.