Author image not provided
 Ibrahim Abdelaziz

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.53
Citation Count53
Publication count15
Publication years2015-2019
Available for download11
Average downloads per article242.00
Downloads (cumulative)2,662
Downloads (12 Months)863
Downloads (6 Weeks)64
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


15 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 15 of 15
Sort by:

1 published by ACM
March 2019 EuroSys '19: Proceedings of the Fourteenth EuroSys Conference 2019
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 19,   Downloads (12 Months): 216,   Downloads (Overall): 216

Full text available: PDFPDF
Existing query engines for RDF graphs follow one of two design paradigms: relational or graph-based. We explore sparse matrix algebra as a third paradigm and propose MAGiQ: a framework for implementing SPARQL query engines that are portable on various hardware architectures, scalable over thousands of compute nodes, and efficient for ...
Keywords: Graph Query Engines, Matrix Algebra, RDF

2
August 2018 Proceedings of the VLDB Endowment: Volume 11 Issue 12, August 2018
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 28,   Downloads (Overall): 28

Full text available: PDFPDF
Existing RDF engines follow one of two design paradigms: relational or graph-based. Such engines are typically designed for specific hardware architectures, mainly CPUs, and are not easily portable to new architectures. Porting an existing engine to a different architecture (e.g., many-core architectures) entails almost redesign from scratch. We explore sparse ...

3
July 2018
Bibliometrics:
Citation Count: 0

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, ...

4
December 2017 Proceedings of the VLDB Endowment: Volume 11 Issue 4, December 2017
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
The RDF data model allows publishing interlinked RDF datasets, where each dataset is independently maintained and is queryable via a SPARQL endpoint. Many applications would benefit from querying the resulting large, decentralized, geo-distributed graph through a federated SPARQL query processor. A crucial factor for good performance in federated query processing ...

5 published by ACM
November 2017 HotNets-XVI: Proceedings of the 16th ACM Workshop on Hot Topics in Networks
Publisher: ACM
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 22,   Downloads (12 Months): 345,   Downloads (Overall): 885

Full text available: PDFPDF
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 ...

6 published by ACM
September 2017 SoCC '17: Proceedings of the 2017 Symposium on Cloud Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 42,   Downloads (Overall): 144

Full text available: PDFPDF
Many data center applications nowadays rely on distributed computation models like MapReduce and Bulk Synchronous Parallel (BSP) for data-intensive computation at scale [4]. These models scale by leveraging the partition/aggregate pattern where data and computations are distributed across many worker servers, each performing part of the computation. A communication phase ...
Keywords: P4, in-network processing, on-path aggregation

7
September 2017 Proceedings of the VLDB Endowment - Proceedings of the 43rd International Conference on Very Large Data Bases, Munich, Germany: Volume 10 Issue 13, September 2017
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 7,   Downloads (12 Months): 61,   Downloads (Overall): 128

Full text available: PDFPDF
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 ...

8 published by ACM
May 2017 SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Downloads (Overall): 301

Full text available: PDFPDF
There has been a proliferation of datasets available as interlinked RDF data accessible through SPARQL endpoints. This has led to the emergence of various applications in life science, distributed social networks, and Internet of Things that need to integrate data from multiple endpoints. We will demonstrate Lusail; a system that ...
Keywords: decentralized rdf graphs, federated sparql queries, linked data, parallel query processing, query processing, rdf data, sparql

9
May 2017 Web Semantics: Science, Services and Agents on the World Wide Web: Volume 44 Issue C, May 2017
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

DrugDrug 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 ...
Keywords: Link prediction, Drug interaction, Similarity-based

10
January 2017
Bibliometrics:
Citation Count: 0

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, ...

11
November 2016 SC '16: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 6,   Downloads (12 Months): 82,   Downloads (Overall): 495

Full text available: PDFPDF
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 ...

12
November 2016 Pattern Analysis & Applications: Volume 19 Issue 4, November 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The success of using Hidden Markov Models (HMMs) for speech recognition application has motivated the adoption of these models for handwriting recognition especially the online handwriting that has large similarity with the speech signal as a sequential process. Some languages such as Arabic, Farsi and Urdo include large number of ...
Keywords: Large vocabulary, Arabic, Online handwriting recognition, Adaptive training, Advanced modeling, Hidden Markov models

13
June 2016 The VLDB Journal — The International Journal on Very Large Data Bases: Volume 25 Issue 3, June 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Downloads (Overall): 202

Full text available: PDFPDF
State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has ...
Keywords: SPARQL query processing, Main memory engines, Parallel and distributed RDF systems

14
August 2015 Proceedings of the VLDB Endowment - Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii: Volume 8 Issue 12, August 2015
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Downloads (Overall): 151

Full text available: PDFPDF
Distributed RDF systems partition data across multiple computer nodes. Partitioning is typically based on heuristics that minimize inter-node communication and it is performed in an initial, data pre-processing phase. Therefore, the resulting partitions are static and do not adapt to changes in the query workload; as a result, existing systems ...

15
August 2015 Proceedings of the VLDB Endowment - Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii: Volume 8 Issue 12, August 2015
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 29,   Downloads (Overall): 58

Full text available: PDFPDF
A growing number of applications require combining SPARQL queries with generic graph search on RDF data. However, the lack of procedural capabilities in SPARQL makes it inappropriate for graph analytics. Moreover, RDF engines focus on SPARQL query evaluation whereas graph management frameworks perform only generic graph computations. In this work, ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us