Results 1 - 10
of
15
Using Semantic Caching to Manage Location Dependent Data in Mobile Computing
, 2000
"... Location-dependent applications are becoming very popular in mobile environments. To improve system performance and facilitate disconnection, caching is crucial to such applications. In this paper, a semantic caching scheme is used to access location dependent data in mobile computing. We first deve ..."
Abstract
-
Cited by 50 (2 self)
- Add to MetaCart
Location-dependent applications are becoming very popular in mobile environments. To improve system performance and facilitate disconnection, caching is crucial to such applications. In this paper, a semantic caching scheme is used to access location dependent data in mobile computing. We first develop a mobility model to represent the moving behaviors of mobile users and formally define location dependent queries. We then investigate query processing and cache management strategies. The performance of the semantic caching scheme and its replacement strategy FAR is evaluated through a simulation study. Our results show that semantic caching is more flexible and effective for use in LDD applications than page caching, whose performance is quite sensitive to the database physical organization. We also notice that the semantic cache replacement strategy FAR, which utilizes the semantic locality in terms of locations, performs robustly under different kinds of workloads.
Semantic Caching via Query Matching for Web Sources
- In Proc. of the 1999 ACM CIKM Int. Conf. on Information and Knowledge Management
, 1999
"... A semantic caching scheme suitable for wrappers wrapping web sources is presented. Since the web sources have typically weaker querying capabilities than conventional databases, existing semantic caching schemes cannot be applied directly. A seamlessly integrated query translation and capability map ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
A semantic caching scheme suitable for wrappers wrapping web sources is presented. Since the web sources have typically weaker querying capabilities than conventional databases, existing semantic caching schemes cannot be applied directly. A seamlessly integrated query translation and capability mapping between the wrappers and web sources in semantic caching is described. In addition, an analysis on the match types between the user's input query and cached queries is presented. Semantic knowledge acquired from the data can be used to avoid unnecessary access to the web sources by transforming the cache miss to the cache hit. A polynomial time algorithm based on the proposed query matching technique is presented to find the best matched query in the cache. Experimental results reveal the effectiveness of the proposed semantic caching scheme. 1 Introduction Web databases allow users to pose queries to distributed and heterogeneous web sources. Such systems usually consist of three com...
Bypass caching: Making scientific databases good network citizens
- In: ICDE. (2005
, 2005
"... Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitable for their workloads, which compare and join large data sets. Existing techniques reduce parallelism by conducting distr ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitable for their workloads, which compare and join large data sets. Existing techniques reduce parallelism by conducting distributed queries in a single cache and lose the data reduction benefits of performing selections at each database. We develop the bypass-yield formulation of caching, which reduces network traffic in wide-area database federations, while preserving parallelism and data reduction. Bypass-yield caching is altruistic; caches minimize the overall network traffic generated by the federation, rather than focusing on local performance. We present an adaptive, workload-driven algorithm for managing a bypass-yield cache. We also develop on-line algorithms that make no assumptions about workload: a k-competitive deterministic algorithm and a randomized algorithm with minimal space complexity. We verify the efficacy of bypass-yield caching by running workload traces collected from the Sloan Digital Sky Survey through a prototype implementation.
Client-Oriented Replication in Mobile Database Environments
- Proceedings of the ACM SIGMOD Int. Conf. on Management of Data
, 2003
"... this paper we make a proposal on a client-oriented replication service, which we rst motivated in a German short paper [Gol03]. In Section 2 we describe our approach to client-oriented replication and explain the interfaces provided to application developers and administrators. Although this paper i ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
this paper we make a proposal on a client-oriented replication service, which we rst motivated in a German short paper [Gol03]. In Section 2 we describe our approach to client-oriented replication and explain the interfaces provided to application developers and administrators. Although this paper is focused on the conceptional aspects of client-oriented replication and the service's language interface, we discuss a prototype architecture and important replica management issues in Section 3. Related work is reviewed in Section 4 and Section 5 concludes the paper with a summary and an outlook on open research issues
Using Clustering for Effective Management of a Semantic Cache in Mobile Computing
- In Proceedings of the International Workshop of MobiDE
, 1999
"... Semantic caching is particularly attractive for use in a mobile computing environment due to its content-based reasoning ability and the fact that only the required data (as opposed to a file or pages of data) is transmitted over the wireless link. In this paper we propose a cluster based approach t ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
Semantic caching is particularly attractive for use in a mobile computing environment due to its content-based reasoning ability and the fact that only the required data (as opposed to a file or pages of data) is transmitted over the wireless link. In this paper we propose a cluster based approach to manage a semantic cache, aiming at examining and further making use of the semantic locality among queries in a workload. Cache replacement performance using this technique is shown to outperform that of an LRU scheme where only temporal locality is considered.
Location-based Spatial Queries with Data Sharing in Mobile Environment
, 2005
"... Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We illustrate the appeal of our technique through extensive simulation results. 1.
Similarity-Based Query Caching
- In Proceedings of the 6 th International Conference on Flexible Query Answering Systems
, 2004
"... With the success of the semantic web infrastructures for storing and querying RDF data are gaining importance. A couple of systems are available now that provide basic database functionality for RDF data. ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
With the success of the semantic web infrastructures for storing and querying RDF data are gaining importance. A couple of systems are available now that provide basic database functionality for RDF data.
Caching Complementary Space for Location-Based Services
- In Proceedings of the 10th International Conference on Extending Database Technology (EDBT
, 2006
"... Abstract. In this paper, we propose a novel client-side, multi-granularity caching scheme, called “Complementary Space Caching ” (CS caching), for location-based services in mobile environments. Different from conventional data caching schemes that only cache a portion of dataset, CS caching maintai ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. In this paper, we propose a novel client-side, multi-granularity caching scheme, called “Complementary Space Caching ” (CS caching), for location-based services in mobile environments. Different from conventional data caching schemes that only cache a portion of dataset, CS caching maintains a global view of the whole dataset. Different portions of this view are cached in varied granularity based on the probabilities of being accessed in the future queries. The data objects with very high access probabilities are cached in the finest granularity, i.e., the data objects themselves. The data objects which are less likely to be accessed in the near future are abstracted and logically cached in the form of complementary regions (CRs) in a coarse granularity. CS caching naturally supports all types of location-based queries. In this paper, we explore several design and system issues of CS caching, including cache memory allocation between objects and CRs, and CR coalescence. We develop algorithms for location-based queries and a cache replacement mechanism. Through an extensive performance evaluation, we show that CS caching is superior to existing caching schemes for location-based services. 1
Distributed Caching of Multidimensional Data in Mobile Environments. (available at http://ihome.ust.hk/~liubin
"... Caching has been an important technique for saving network traffic and reducing response time, especially in mobile environments where bandwidth is often a scarce resource. In this paper, we propose a novel approach for caching multidimensional data in a cluster of mobile devices. In particular, we ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Caching has been an important technique for saving network traffic and reducing response time, especially in mobile environments where bandwidth is often a scarce resource. In this paper, we propose a novel approach for caching multidimensional data in a cluster of mobile devices. In particular, we focus on the most common types of multi-dimensional queries, namely range and k-nearest neighbor queries, by computing a cacheable region for every query, caching the result at the client, and indexing it in an R*-tree at the cluster gateway. Subsequent queries are first issued to the R*-tree and only remainder queries or queries that cannot be guaranteed exact answers are sent to the remote data server. To the best of our knowledge, our work is the first to study caching results from complex multi-dimensional queries (e.g., kNN query) and propose to build an R*-tree on previously fetched query results in a cluster of mobile devices. Rigorous experiments show that our approach significantly reduces network traffic and response time.
An error-resilient and tunable distributed indexing scheme for wireless data broadcast
- APPENDIX AUXILIARY FUNCTION — SearchI
"... Abstract—Access efficiency and energy conservation are two critical performance concerns in a wireless data broadcast system. We propose in this paper a novel parameterized index called the exponential index that has a linear yet distributed structure for wireless data broadcast. Based on two tuning ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract—Access efficiency and energy conservation are two critical performance concerns in a wireless data broadcast system. We propose in this paper a novel parameterized index called the exponential index that has a linear yet distributed structure for wireless data broadcast. Based on two tuning knobs, index base and chunk size, the exponential index can be tuned to optimize the access latency with the tuning time bounded by a given limit, and vice versa. The client access algorithm for the exponential index under unreliable broadcast is described. A performance analysis of the exponential index is provided. Extensive ns-2-based simulation experiments are conducted to evaluate the performance under various link error probabilities. Simulation results show that the exponential index substantially outperforms the state-of-the-art indexes. In particular, it is more resilient to link errors and achieves more performance advantages from index caching. The results also demonstrate its great flexibility in trading access latency with tuning time. Index Terms—Index structure, data broadcast, energy conservation, mobile computing. 1

