首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到17条相似文献,搜索用时 250 毫秒
1.
移动环境下缓存弱一致性的研究   总被引:5,自引:0,他引:5  
在移动环境下,客户缓存为提高客户一服务器数据库系统的整体性能提供了有效途径。缓存与服务方数据的同步策略是缓存研究的重要内容。移动环境下,考虑到网络的带宽、开销和可靠性等因素,客户有可能允许缓存维护弱一致性,即允许缓存与服务方数据存在偏差。本文针对基于语义的缓存,给出客户限定偏差范围的方法,并且提出基于有效期的缓存同步算法。  相似文献   

2.
语义缓存的最小权值项LWI替换策略   总被引:5,自引:0,他引:5  
在客户-服务器数据库系统中,语义缓存是基于客户查询语义相关建立的一种客户缓存.语义缓存的内容由以往查询的结果以及相应的描述构成.针对语义缓存的特征,提出语义缓存下最小权值项LWI(1east weight itern)替换策略.该策略由缓存项投影属性的访问频率和缓存项与查询的条件匹配情况,结合数据访问的时间局部性考虑决定缓存项的权值,替换最小权值项.通过性能分析实验,在语义缓存中,基于LWI替换策略的系统性能要优于基于传统LRU和LFU替换策略的系统性能.  相似文献   

3.
基于语义缓存的移动查询导出   总被引:19,自引:2,他引:19  
吴婷婷  周兴铭 《计算机学报》2002,25(10):1104-1110
在移动环境下,客户缓存为提高客户-服务器数据库系统的整体性能,特别是保证客户端数据可用性提供了有效途径,该文针对如何从基于语义描述的缓存中导出当前查询(部分)结果的问题,研究了查询从缓存导出的充分条件,并在定义查询与缓存之间的精确匹配,包含匹配和相互匹配几种情况的基础上,给出缓存与查询,包含与相交匹配的判断条件和相应的算法,基于该文的研究,查询可以充分利用本地语义缓存的内容,从而降低网络开销,加快响应时间,并支持移动客户断接时的数据访问。  相似文献   

4.
断接下查询的缓存处理   总被引:5,自引:0,他引:5  
吴婷婷  章文嵩  周兴铭 《计算机学报》2003,26(10):1393-1399
移动环境下,由于无线网络可靠性低、费用高,移动主机本身受电源、资源等方面的限制,移动主机经常会主动或被动地处于断接,即没有网络连接的状态.为了提高断接时移动客户对数据的访问能力,有效利用移动缓存,该文提出断接下基于语义缓存的查询处理QPID算法.该算法的主要思路是先找出缓存中与当前查询相关的缓存项,再通过对相关项数据的进一步处理获得缓存中满足查询的结果.试验表明,基于QPID算法的查询处理可以更好地满足断接下客户的查询请求.  相似文献   

5.
基于XQuery语义缓存的异构数据集成系统的查询处理   总被引:1,自引:0,他引:1  
提出了一种在Mediator-Wrapper结构中嵌入基于XQuery语义缓存的异构数据集成系统的查询处理方案,主要包括查询包含关系判定、查询分解和重写.同时提出利用树型同态算法解决XQuery查询语义包含关系的判断问题和Web环境下的缓存替换策略,旨在提高信息集成系统的查询性能.  相似文献   

6.
基于逻辑规则的语义缓存查询处理优化技术   总被引:3,自引:0,他引:3  
郝小卫  章陶  李磊 《计算机学报》2005,28(7):1096-1103
语义缓存在移动计算环境中有着非常广阔的应用前景.查询处理是语义缓存的一个关键问题,但是现有的查询处理算法在时空效率和裁剪结果的复杂度两个方面存在很大的局限性,这在一定程度上限制了语义缓存的实用性.为了克服这些缺陷,作者首先给出并证明了用于优化查询裁剪的逻辑规则;基于这些规则,给出了剩余查询的裁剪算法;最终给出了只需进行剩余查询裁剪的优化查询处理算法.算法分析从理论上证明了该优化机制的有效性,同时,仿真实验的性能比较也表明该优化方法在提高查询裁剪时空效率和降低剩余查询复杂度等方面都要明显优于没有优化的方法.  相似文献   

7.
一种基于移动环境的语义缓存一致性维护技术   总被引:1,自引:0,他引:1  
在深入研究缓存失效广播技术和语义缓存的基础上,提出了一种新的基于移动环境的语义缓存一致性维护技术——基于语义缓存的异步有状态(BSCAS)技术。BSCAS技术可以支持移动客户的各种断接方式,减少无线通信的开销,让移动客户有更好的自治性。  相似文献   

8.
针对现有移动计算环境中的语义缓存缺乏位置信息的空间索引,提出一种基于四叉树索引结构的语义缓存及其查询裁剪算法,扩展了传统的语义缓存,实现面向对象的语义缓存。通过模拟实验,对算法的性能进行比较分析。结果表明四叉树语义缓存,降低了平均响应时间、查询比较次数和网络通信负荷。  相似文献   

9.
嵌入式移动数据库查询优化策略研究   总被引:1,自引:0,他引:1  
李荣鑫  洪胜华 《微机发展》2005,15(5):145-147
随着通信技术和网络技术的发展,嵌入式移动数据库正成为数据库领域的一个新的研究方向。针对嵌入式移动数据库中频繁断接性、低带宽等特性,介绍了数据广播和客户缓存两种用于嵌入式移动数据库中处理断接操作的方法,提出了基于语义的查询优化策略。研究表明,该策略能够提高移动数据库查询的效率。  相似文献   

10.
随着通信技术和网络技术的发展,嵌入式移动数据库正成为数据库领域的一个新的研究方向.针对嵌入式移动数据库中频繁断接性、低带宽等特性,介绍了数据广播和客户缓存两种用于嵌入式移动数据库中处理断接操作的方法,提出了基于语义的查询优化策略.研究表明,该策略能够提高移动数据库查询的效率.  相似文献   

11.
In a mobile computing environment, database servers disseminate information to multiple mobile clients via wireless channels. Due to the low bandwidth and low reliability of wireless channels, it is important for a mobile client to cache its frequently accessed database items into its local storage. This improves performance of database queries and improves availability of database items for query processing during disconnection. In this paper, we investigate issues on caching granularity, coherence strategy, and replacement policy of caching mechanisms for a mobile environment utilizing point-to-point communication paradigm.We first illustrate that page-based caching is not suitable in the mobile context due to the lack of locality among database items. We propose three different levels of caching granularity: attribute caching, object caching, and hybrid caching, a hybrid approach of attribute and object caching. Next, we show that existing coherence strategies are inappropriate due to frequent disconnection in a mobile environment, and propose a cache coherence strategy, based on the update patterns of database items. Via a detail simulation model, we examine the performance of various levels of caching granularity with our cache coherence strategy. We observe, in general, that hybrid caching could achieve a better performance. Finally, we propose several cache replacement policies that can adapt to the access patterns of database items. For each given caching granularity, we discover that our replacement policies outperform conventional ones in most situations.  相似文献   

12.
Abstract. In meta-searchers accessing distributed Web-based information repositories, performance is a major issue. Efficient query processing requires an appropriate caching mechanism. Unfortunately, standard page-based as well as tuple-based caching mechanisms designed for conventional databases are not efficient on the Web, where keyword-based querying is often the only way to retrieve data. In this work, we study the problem of semantic caching of Web queries and develop a caching mechanism for conjunctive Web queries based on signature files. Our algorithms cope with both relations of semantic containment and intersection between a query and the corresponding cache items. We also develop the cache replacement strategy to treat situations when cached items differ in size and contribution when providing partial query answers. We report results of experiments and show how the caching mechanism is realized in the Knowledge Broker system. Received June 15, 1999 / Accepted December 24, 1999  相似文献   

13.
14.
The ever increasing deployment of broadband networks and simultaneous proliferation of low-cost video capturing and multimedia-enabled mobile devices such as smart cellular phones, netbook computers, and tablet computers have triggered a wave of novel mobile multimedia applications making video streaming on mobile devices increasingly popular and commonplace. Networked environments consisting of mobile devices tend to be highly heterogeneous in terms of client-side and system-wide resource constraints, clients’ queries for information, geospatial distribution, and dynamic trajectories of the mobile clients, and client-side and server-side privacy and security requirements. Invariably, the video streams need to be personalized to provide a resource-constrained mobile device with video content that is most relevant to the client’s request while simultaneously satisfying the client-side and system-wide resource constraints, privacy and security requirements and the constraints imposed by the geospatial distribution and dynamic trajectories of the mobile clients relative to the server(s). In this paper, we present the design and implementation of a distributed system, consisting of several geographically distributed video personalization servers and proxy caches, for efficient dissemination of personalized video in a resource-constrained mobile environment. With the objective of optimizing cache performance, a novel cache replacement policy and multi-stage client request aggregation strategy, both of which are specifically tailored for personalized video content, are proposed. A novel Latency-Biased Collaborative Caching (LBCC) protocol based on counting Bloom filters is designed for further enhancing the scalability and efficiency of disseminating personalized video content. The benefits and costs associated with collaborative caching for disseminating personalized video content to resource-constrained and geographically distributed clients are analyzed and experimentally verified. The impact of different levels of collaboration among the caches and the advantages of using multiple video personalization servers with varying degrees of mirrored content on the efficiency of personalized video delivery are also studied. Experimental results demonstrate that the proposed collaborative caching scheme, coupled with the proposed personalization-aware cache replacement and client request aggregation strategies, provides a means for efficient dissemination of personalized video streams in resource-constrained environments.  相似文献   

15.
16.
Towards Intelligent Semantic Caching for Web Sources   总被引:2,自引:0,他引:2  
An intelligent semantic caching scheme suitable for web sources is presented. Since web sources typically have weaker querying capabilities than conventional databases, existing semantic caching schemes cannot be directly applied. Our proposal takes care of the difference between the query capabilities of an end user system and web sources. In addition, an analysis on the match types between a user's input query and cached queries is presented. Based on this analysis, we present an algorithm that finds the best matched query under different circumstances. Furthermore, a method to use semantic knowledge, acquired from the data, to avoid unnecessary access to web sources by transforming the cache miss to the cache hit is presented. To verify the effectiveness of the proposed semantic caching scheme, we first show how to generate synthetic queries exhibiting different levels of semantic localities. Then, using the test sets, we show that the proposed query matching technique is an efficient and effective way for semantic caching in web databases.  相似文献   

17.
The continuous partial match query is a partial match query whose result remains consistently in the client’s memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号