On the Fractal Nature of WWW and Its Application to Cache Modeling

The World Wide Web (WWW or Web) is growing rapidly on the Internet. Web users want fast response time and easy access to a enormous variety of information across the world. Thus, performance is becoming a main issue in the Web. Fractals have been used to study fluctuating phenomena in many different disciplines, from the distribution of galaxies in astronomy to complex physiological control systems. The Web is also a complex, irregular, and random system. In this paper, we look at the document reference pattern at Internet Web servers and use fractal-based models to understand aspects (e.g. caching schemes) that affect the Web performance.

Campus-based publishing partnerships: A guide to critical issues

Campus-based publishing partnerships offer the academy greater control over the intellectual products that it helps create. To fully realize this potential, such partnerships will need to evolve from informal working alliances to long-term, programmatic collaborations. SPARCâ s Campus-based Publishing Partnerships: A Guide to Critical Issues addresses issues relevant to building sound and balanced partnerships, including: Establishing governance and administrative structures; Identifying funding models that accommodate the objectives of both libraries and presses; Defining a partnershipâ s objectives to align the missions of the library and the press; Determining what services to provide; and Demonstrating the value of the collaboration. SPARCâ s Campus-based Publishing Partnerships will help libraries, presses, and academic units to define effective partnerships capable of supporting innovative approaches to campus-based publishing.

Authenticated Index Structures for Outsourced Database Systems

In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to access and query the data more efficiently. As servers might be untrusted or can be compromised, query authentication becomes an essential component of ODB systems. Existing solutions for this problem concentrate mostly on static scenarios and are based on idealistic properties for certain cryptographic primitives. In this work, first we define a variety of essential and practical cost metrics associated with ODB systems. Then, we analytically evaluate a number of different approaches, in search for a solution that best leverages all metrics. Most importantly, we look at solutions that can handle dynamic scenarios, where owners periodically update the data residing at the servers. Finally, we discuss query freshness, a new dimension in data authentication that has not been explored before. A comprehensive experimental evaluation of the proposed and existing approaches is used to validate the analytical models and verify our claims. Our findings exhibit that the proposed solutions improve performance substantially over existing approaches, both for static and dynamic environments.