SIQXC: Schema Independent Queryable XML Compression for Smartphones

The explosive growth of XML use over the last decade has led to a lot of research on how to best store and access it. This growth has resulted in XML being described as a de facto standard for storage and exchange of data over the web. However, XML has high redundancy because of its self-­‐ describing nature making it verbose. The verbose nature of XML poses a storage problem. This has led to much research devoted to XML compression. It has become of more interest since the use of resource constrained devices is also on the rise. These devices are limited in storage space, processing power and also have finite energy. Therefore, these devices cannot cope with storing and processing large XML documents. XML queryable compression methods could be a solution but none of them has a query processor that runs on such devices. Currently, wireless connections are used to alleviate the problem but they have adverse effects on the battery life. They are therefore not a sustainable solution. This thesis describes an attempt to address this problem by proposing a queryable compressor (SIQXC) with a query processor that runs in a resource constrained environment thereby lowering wireless connection dependency yet alleviating the storage problem. It applies a novel simple 2 tuple integer encoding system, clustering and gzip. SIQXC achieves an average compression ratio of 70% which is higher than most queryable XML compressors and also supports a wide range of XPATH operators making it competitive approach. It was tested through a practical implementation evaluated against the real data that is usually used for XML benchmarking. The evaluation covered the compression ratio, compression time and query evaluation accuracy and response time. SIQXC allows users to some extent locally store and manipulate the otherwise verbose XML on their Smartphones

AC3P: an architecture using cloud computing for the provision of mathematical powerpoint content to feature phones

The Govan Mbeki Mathematics Development Unit (GMMDU) provides additional mathematics content to learners via mathematics workshops and DVDs. Mathematics is presented in PPT format. The prominence of feature phone usage has been confirmed amongst learners in socio-economic disadvantaged schools, specifically those learners participating in the GMMDU mathematics workshops. Feature phones typically contain limited device resources such as memory, battery power, and network resources. Distributed computing provides the potential to facilitate a new class of mobile applications with the provision of off-device resources. The objective of this research was the design of an architecture using Cloud Computing for the provision of mathematics in the form of PPT slides to feature phones. The capabilities of typical feature phones were reviewed as well as various distributed computing architectures that demonstrate potential benefit to the mobile environment. An Architecture using Cloud Computing for Content Provision (AC3P) was subsequently designed and applied as a proof of concept to facilitate the provision of mathematics in the form of PPT slides to feature phones. The application of AC3P was evaluated for efficiency and effectiveness. It was demonstrated that the application of AC3P provided efficient and effective provision of PPT to feature phones. The successful application of AC3P provided evidence that Cloud Computing may be used to facilitate the provision of mathematics content to feature phones. It is evident that AC3P may be applied in domains other than the provision of mathematics

AC3P: an architecture using cloud computing for the provision of mathematical powerpoint content to feature phones

The Govan Mbeki Mathematics Development Unit (GMMDU) provides additional mathematics content to learners via mathematics workshops and DVDs. Mathematics is presented in PPT format. The prominence of feature phone usage has been confirmed amongst learners in socio-economic disadvantaged schools, specifically those learners participating in the GMMDU mathematics workshops. Feature phones typically contain limited device resources such as memory, battery power, and network resources. Distributed computing provides the potential to facilitate a new class of mobile applications with the provision of off-device resources. The objective of this research was the design of an architecture using Cloud Computing for the provision of mathematics in the form of PPT slides to feature phones. The capabilities of typical feature phones were reviewed as well as various distributed computing architectures that demonstrate potential benefit to the mobile environment. An Architecture using Cloud Computing for Content Provision (AC3P) was subsequently designed and applied as a proof of concept to facilitate the provision of mathematics in the form of PPT slides to feature phones. The application of AC3P was evaluated for efficiency and effectiveness. It was demonstrated that the application of AC3P provided efficient and effective provision of PPT to feature phones. The successful application of AC3P provided evidence that Cloud Computing may be used to facilitate the provision of mathematics content to feature phones. It is evident that AC3P may be applied in domains other than the provision of mathematics

A Comprehensive Framework for Testing Database-Centric Software Applications

The database is a critical component of many modern software applications. Recent reports indicate that the vast majority of database use occurs from within an application program. Indeed, database-centric applications have been implemented to create digital libraries, scientific data repositories, and electronic commerce applications. However, a database-centric application is very different from a traditional software system because it interacts with a database that has a complex state and structure. This dissertation formulates a comprehensive framework to address the challenges that are associated with the efficient and effective testing of database-centric applications. The database-aware approach to testing includes: (i) a fault model, (ii) several unified representations of a program's database interactions, (iii) a family of test adequacycriteria, (iv) a test coverage monitoring component, and (v) tools for reducing and re-ordering a test suite during regression testing.This dissertation analyzes the worst-case time complexity of every important testing algorithm. This analysis is complemented by experiments that measure the efficiency and effectiveness of thedatabase-aware testing techniques. Each tool is evaluated by using it to test six database-centric applications. The experiments show thatthe database-aware representations can be constructed with moderate time and space overhead. The adequacy criteria call for test suitesto cover 20% more requirements than traditional criteria and this ensures the accurate assessment of test suite quality. It is possibleto enumerate data flow-based test requirements in less than one minute and coverage tree path requirements are normally identified in no morethan ten seconds. The experimental results also indicate that the coverage monitor can insert instrumentation probes into all six of theapplications in fewer than ten seconds. Although instrumentation may moderately increase the static space overhead of an application, the coverage monitoring techniques only increase testing time by 55% on average. A coverage tree often can be stored in less than five seconds even though the coverage report may consume up to twenty-fivemegabytes of storage. The regression tester usually reduces or prioritizes a test suite in under five seconds. The experiments also demonstrate that the modified test suite is frequently more streamlined than the initial tests