Tuesday 23rd of April 2024
 

An Implementation of a Dynamic Partitioning Scheme for Web Pages


Timothy Arndt, Ben Blake, Brian Krupp and Janche Sang

In this paper, we introduce a method for the dynamic partitioning of web pages. The algorithm is first illustrated by manually partitioning a web page, then the implementation of the algorithm using PHP is described. The method results in a partitioned web page consisting of small pieces or fragments which can be retrieved concurrently using AJAX or similar technology. The goal of this research is to increase performance of web page delivery by decreasing the latency of web page retrieval.

Keywords: Web Browser, Partitioning, Performance, PHP, Concurrency.

Download Full-Text


ABOUT THE AUTHORS

Timothy Arndt
Timothy Arndt Received a Ph.D. in Computer Science from the University of Pittsburgh. He is currently an Associate Professor of Computer and Information Science at Cleveland State University.

Ben Blake
Ben Blake Received a Ph.D. in Computer Science from the Ohio State University. He is currently an Associate Professor of Computer and Information Science at Cleveland State University..

Brian Krupp
Brian Krupp Received a Master’s Degree in Computer and Information Science from the Cleveland State University. He is currently a Doctoral student in Software Engineering at Cleveland State University and Enterprise Security Architect at Key Bank.

Janche Sang
Janche Sang Received a Ph.D. in Computer Science from Purdue University. He is currently an Associate Professor of Computer and Information Science at Cleveland State University..


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »