Alshaimaa Abo-alian

Dr. Alshaimaa Abo-alian

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
3 June 2016 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
NBNagwa L. Badr
Nagwa L. Badr
MTM. F. Tolba
M. F. Tolba

9 November 2021 in IEEE Access
Verified
Journal Article
Open access
ARAhmed Abdel Raouf
Ahmed Abdel Raouf
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
NBNagwa L. Badr
Nagwa L. Badr
With the rapid adoption of multi-tenant databases, the cloud provider consolidates multiple tenants’ database on server machines, where the tenants share a common application and database instances. To ensure the quality of service (QoS) for the leased resources, both sides (i.e., the user and the provider) create a Service Level Agreement (SLA). Higher SLA violations result in high SLA contractual penalties and increase the possibility of losing the tenant. In addition, the unusual workload patterns of each tenant transactions require seamless adjustments due to the sudden burden changes and variability. As a result, to satisfy simultaneously availability and performance tenant requirements, it is necessary to perform reliable tenant migration and replication to distribute the workload to a flexible set of sites and avoid SLA violations. In this research, a cluster-based multi-tenant database management system (CB-MT DBMS) is proposed, which takes the migration and replication decisions in advance by monitoring and acting before the violation of the SLA occurs. In addition, a dynamic proactive multi-tenant database migration and replication MTDB-MR algorithm is proposed to reduce collisions and inconsistencies between migration and replication decisions for a group of violated tenants. Experimental results show that the proposed MTDB-MR algorithm is the ideal candidate for migration and replication of the violated multi-tenant databases, as it minimizes the total number of SLA violations, the number of multi-tenant clients SLA violations, client sites average response time and total execution time of each multi-tenant client site as compared to the previous algorithms.

1 January 2009 in International Journal of Bioinformatics Research and Applications
Verified
Journal Article
Closed access
TSTaysir Soliman
Taysir Soliman
TGTarek F. Gharib
Tarek F. Gharib
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
MSM.A. El Sharkawy
M.A. El Sharkawy
The increase of the amount of DNA sequences requires efficient computational algorithms for performing sequence comparison and analysis. Standard compression algorithms are not able to compress DNA sequences because they do not consider special characteristics of DNA sequences (i.e., DNA sequences contain several approximate repeats and complimentary palindromes). Recently, new algorithms have been proposed to compress DNA sequences, often using detection of long approximate repeats. The current work proposes a Lossless Compression Algorithm (LCA), providing a new encoding method. LCA achieves a better compression ratio than that of existing DNA-oriented compression algorithms, when compared to GenCompress, DNACompress, and DNAPack.

1 January 2015
Verified
Book Chapter
Closed access
PDF file
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
NBN. L. Badr
N. L. Badr
MTM. F. Tolba
M. F. Tolba

10 November 2015
Verified
Book Chapter
Closed access
PDF file
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
NBNagwa L. Badr
Nagwa L. Badr
MTM. F. Tolba
M. F. Tolba

11 November 2015 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
AAAlshaimaa Abo-alian
Alshaimaa Abo-alian
NBNagwa Badr
Nagwa Badr
MTM. F. Tolba
M. F. Tolba