Learn More
Permission is granted to quote short excerpts and to reproduce figures and tables from this report, provided that the source of such material is fully acknowledged. Abstract Contemporary evidence suggests that most field faults in software applications are found in a small percentage of the software's components. This means that if these faulty software(More)
Database systems serving cloud platforms must handle a large number of applications or tenants. Multi-tenancy database has been prevalent for hosting multiple tenants within a single DBMS while enabling effective resource sharing. Providing such performance goals is challenging for providers as they must balance the performance that they can deliver to(More)
XML has become a widely used standard for data exchange among applications. Consequently, a large amount of data is distributed on the Web and stored in different persistence models. DBMSs provide concurrency control techniques to manage such data. However, the structure of XML data makes the application of these techniques difficult. Regarding distributed(More)
Traditional requirements for persistence layers do not consider limitations of the development platforms available for mobile devices. In order to facilitate the development of applications, which need to store data, for mobile devices, these traditional requirements are reevaluated in this paper and a framework for object persistence is proposed. This(More)
Dynamic resource provisioning poses a major challenge for infrastructure providers because it is necessary to both forecast resource consumption and react to recent surges on demand for maintaining a tradeoff between quality of service and cost. However, approaches to workload analysis and forecast are affected due to noise in observed data, specially in(More)
A typical database workload consists of a mix of multiple query instances of dierent query types that run concurrently and interact with each other. That query interactions can have a signicant impact on database system performance. Hence, developing performance tuning algorithms for database systems requires taking these interactions into account. In this(More)
We consider the problem of finding the closest point of interest in road networks where the travel time along each edge is a function of the departure time and the service time of the facilities are taken into consideration. More specifically, our query aims to find the point of interest (e.g., a museum) in which the user can be served in the minimum amount(More)