Research on Semantic and Cache Model of Relational Database

The paper firstly analyze cache replacement strategies at present, and proposed the ideas of the semantic query cache replacement based on user access features, and describe the semantic similarity calculation and realize the algorithm of replacement strategy. The strategy use semantic to match information in the query cache, through dynamic analysis and tracking three characteristics of user access time, user access to content and Business Association, give out the similarity minimum of the cache item, to improve the hit ratio of the cache and the response time and throughput of the server is improved.

Improving SPARQL query performance with algebraic expression tree based caching and entity caching

To obtain comparable high query performance with relational databases,diverse database technologies have to be adapted to confront the complexity posed by both Resource Description Framework(RDF) data and SPARQL query.Database caching is one of such technologies that improves the performance of database with reasonable space expense based on the spatial/temporal/semantic locality principle.However,existing caching schemes exploited in RDF stores are found to be dysfunctional for complex query semantics.Although semantic caching approaches work effectively in this case,little work has been done in this area.In this paper,we try to improve SPARQL query performance with semantic caching approaches,i.e.,SPARQL algebraic expression tree(AET) based caching and entity caching.Successive queries with multiple identical sub-queries and star-shaped joins can be efficiently evaluated with these two approaches.The approaches are implemented on a two-level-storage structure.The main memory stores the most frequently accessed cache items,and items swapped out are stored on the disk for future possible reuse.Evaluation results on three mainstream RDF benchmarks illustrate the effectiveness and efficiency of our approaches.Comparisons with previous research are also provided.

A Semantic Cache Framework for Secure XML Queries

Secure XML query answering to protect data privacy and semantic cache to speed up XML query answering are two hot spots in current research areas of XML database systems. While both issues are explored respectively in depth, they have not been studied together, that is, the problem of semantic cache for secure XML query answering has not been addressed yet. In this paper, we present an interesting joint of these two aspects and propose an efficient framework of semantic cache for secure XML query answering, which can improve the performance of XML database systems under secure circumstances. Our framework combines access control, user privilege management over XML data and the state-of-the-art semantic XML query cache techniques, to ensure that data are presented only to authorized users in an efficient way. To the best of our knowledge, the approach we propose here is among the first beneficial efforts in a novel perspective of combining caching and security for XML database to improve system performance. The efficiency of our framework is verified by comprehensive experiments.

An Effective Semantic Cache for Exploiting XPath Query/View Answerability

Maintaining a semantic cache of materialized XPath views inside or outside the database is a novel, feasible and efficient approach to facilitating XML query processing. However, most of the existing approaches incur the following disadvantages： 1） they cannot discover enough potential cached views sufficiently to effectively answer subsequent queries; or 2） they are inefficient for view selection due to the complexity of XPath expressions. In this paper, we propose SCEND, an effective Semantic Cache based on dEcompositioN and Divisibility, to exploit the XPath query/view answerability. The contributions of this paper include： 1） a novel technique of decomposing complex XPath queries into some much simpler ones, which can facilitate discovering more potential views to answer a new query than the existing methods and thus can adequately exploit the query/view answerability; 2） an efficient view-section method by checking the divisibility between two positive numbers assigned to queries and views; 3） a cache-replacement approach to further enhancing the query/view answerability; 4） an extensive experimental study which demonstrates that our approach achieves higher performance and outperforms the existing state-of-the-art alternative methods significantly.

Answering queries using cooperative semantic cache in mobile computing environments

In cooperative cache research domain, most of previous work engage in peer-to-peer systems and distributed systems, but do not involve applying cooperative semantic cache in mobile computing environments, which wireless communications disconnect at times and clients move frequently. In this paper, we extend the general semantic cache mechanism by enabling mobile clients to share their local semantic caches in a cooperative matter, and the process way and flow chart of the algorithm are described in detail. In addition, we discuss the methods used in cache consistence maintenance, which focus on confirm receiver of the periodic cache invalidation report and the process of validate client＇s local cache. The experiment results indicate cooperative semantic cache mechanism could reduce query response time and increase cache hit ratio effectively.