Using LDAP directory caches

Cluet, Sophie; Kapitskaia, Olga; Srivastava, Divesh

doi:10.1145/303976.304003

Cited by 23 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach has been explored for LDAP (Lightweight Directory Access Protocol) with existing studies [6] focusing on how to reuse results from existing LDAP queries to answer future queries. More recently, Amiri et al [2] has proposed using semantic information to generate results based on cached query results for dynamic content queries sharing the same query template.…”

Section: Semantic Cachingmentioning

confidence: 99%

Transparent caching with strong consistency in dynamic content web sites

Amza¹,

Soundararajan²,

Cecchet

2005

Proceedings of the 19th Annual International Conference on Supercomputing

View full text Add to dashboard Cite

We consider a cluster architecture in which dynamic content is generated by a database back-end and a collection of Web and application server front-ends. We study the effect of transparent query caching on the performance of such a cluster. Transparency requires that cached entries be invalidated as a result of writes. We start with a coarse-grain table-level automatic invalidation cache. Based on observed workload characteristics, we enhance the cache with the necessary dependency tracking and invalidations at the finer granularity of columns. Finally we reduce the miss penalty of invalidations through full and partial coverage of query results. In terms of system design, a query cache may be located at the database back-end, on dedicated machines, on the front-ends, or on a combination thereof. This paper evaluates the tradeoffs of the different cache designs and the cache location using the TPC-W benchmark.Our experiments show that our transparent query cache improves performance very substantially by up to a factor of 1.5 in throughput and 4.2 in response time overall compared to the baseline tablebased invalidation scheme. An important contributor to this end result, our optimization for reducing the miss penalty through full and partial coverage detection of query results from the cache improves response time by up to a factor of 2.9 compared to a cache with fine-grained column-based invalidations alone. Thus, the benefits of the higher hit ratio in our optimizations outweigh the costs of additional processing. The results are less clear-cut in terms of where to locate the cache. Performance differences when varying the cache location and the number of caches are small.

show abstract

Section: Semantic Cachingmentioning

confidence: 99%

Transparent caching with strong consistency in dynamic content web sites

Amza¹,

Soundararajan²,

Cecchet

2005

Proceedings of the 19th Annual International Conference on Supercomputing

View full text Add to dashboard Cite

show abstract

“…Query processing is to find the relationship between a query and a semantic frag ment. There are number of techniques for query processing [3] [5][6] such as LDAP (Lightweight Directory Access Protocol) [9] . The objective of this paper is to perform the evaluation of indexing schemes for semantic cache.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Index Schemes for Semantic Cache

Naz¹,

Naeem²,

Qayyum³

2013

IJITCS

View full text Add to dashboard Cite

In last decade of computing, a growing popularity for semantic cache schemes has been observed. Nu merous techniques have been proposed for improved performance of semantic cache. Semantic cache is aimed towards reducing the network traffic load with the ab ility to address some queries without contacting the server. Semantic cache overcomes the limitat ions of previous page-caching and tuple-cache techniques. A prime concern of semantic cache includes query processing (query response-time) and cache management. The efficiency of semantic cache can be improved by using semantic indexing sachems. Semantic indexing sachems are segment based and hierarchical semantic indexing scheme. Both these sachems can improve the efficiency of query processing and cache management. In this paper, we have performed the evaluation of index schemes for Semantic Cache through the experimental study. Evaluations of these schemes are available in literature but experimental study is not available. Through this experiment, we have highlighted which technique is most suited in what kind of scenario. Amir Qayyum: received his Bachelors in Electrical Engineering fro m U.E.T., Lahore, Pakistan in 1991,then M.S. in Co mputer Engineering fro m E.S.I.M., France in 1995, then D.E.A. fro m University of Paris -Sud, France in 1996 and then Doctorate fro m Un iversity of Paris -Sud, France in 2000. He is currently a professor at M. A. Jinnah University, Islamabad and also the head of the Center of Research in Networks and Teleco mmunication (Co ReNeT). His current research interests include mobility management framework for mobile devices, Qo S and scalable mult icast in IPv6 networks, MANETs and VANETs, VoIP and network security. Currently he is Dean of Faculty of Engineering at Mohammad Ali Jinnah University Islamabad Pakistan How to cite this paper:

show abstract

“…LDAP (Lightweight Directory Access Protocol) is based on the X.500 standard, and publishes directory information to many different resources [1] [2]. In previous releases, replication was discussed in terms of a master server and some number of slave servers.…”

Section: Introductionmentioning

confidence: 99%

LDAP Directory Template Model on Multi-master Replication

Cui

2010

2010 IEEE Asia-Pacific Services Computing Conference

View full text Add to dashboard Cite

LDAP Multi-Master Technique is a replication approach using Syncrepl to replicate data to multiple servers. As the specialized database optimized for read access, the directory is used to represent heterogeneous entities in directory information tree (DIT). Compared with existing Sync replication models, the directory template replication model based on query templates proposed in this paper only replicates the entries matching the template specification. Replicated templates can reduce the complexity of the query containment problem and generalize the user queries corresponding to semantic regions demonstrating locality of reference. The synchronization protocol, which uses standard means of extending LDAP, is used to support (N-way) MultiMaster server replication modes. In this case, masters can be located in several physical sites, and other masters will continue the database if one master fails. Finally, we demonstrate the advantages of the novel model considering higher hit rates and the large update traffic with an experimental study based on real data and a prototype implementation of the LDAP directory cache.

show abstract

Using LDAP directory caches

Cited by 23 publications

References 14 publications

Transparent caching with strong consistency in dynamic content web sites

Transparent caching with strong consistency in dynamic content web sites

Performance Evaluation of Index Schemes for Semantic Cache

LDAP Directory Template Model on Multi-master Replication

Contact Info

Product

Resources

About