Learn More
Caching at proxy servers is one of the ways to reduce the response time perceived by Web users Cache replacement algorithms play a central role in the response time reduction by selecting a subset of documents for caching so that a given performance metric is maximized At the same time the cache must take extra steps to guarantee some form of consistency of(More)
Data warehouses store large volumes of data which are used frequently by decision support applications. Such applications involve complex queries. Query performance in such an environment is critical because decision support applications often require interactive query response time. Because data warehouses are updated infrequently, it becomes possible to(More)
Caching at proxy servers plays an important role in reducing the latency of the user response, the network delays and the load on Web servers. The cache performance depends critically on the design of the cache replacement algorithm. Unfortunately, most cache replacement algorithms ignore the Web’s scale. In this paper we argue for the design of(More)
The World-Wide Web can be viewed as a collection of semistructured multimedia documents in the form of Web pages connected through hyperlinks. Unlike most Web search engines, which primarily focus on information retrieval functionality, WebDB aims at supporting a comprehensive database-like query functionality, including selection, aggregation, sorting,(More)
The response time of DSS (Decision Support System) queries is typically several orders of magnitude higher than the response time of OLTP (OnLine Transaction Processing) queries. Since DSS queries are often submitted interactively, techniques for reducing their response time are becoming increasingly important. We argue that caching of query results is one(More)
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation time of similarity join is critical issue, since similarity join requires computing similarity values for all possible pairs of objects. Several existing algorithms adopt prefix(More)
An ontology-based product-recommender system can help catalog administrators in B2B marketplaces maintain up-to-date product databases by acquiring mapping information between the new product data and existing data. The proposed approach is keyword-based and independent of the underlying physical structure of product ontology. With a Bayesian belief network(More)
Recent research shows that the database performance can be significantly improved by the effective cache utilization of the conventional microprocessors. Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. A Cache Sensitive B+-Tree is designed to minimize the impact of cache(More)