Oracle Coherence Cache Mangement

Oracle has got Coherence Cache management product by acquiring Tangasole. Coherence provides data management and cacheing service. It is not just simple caching service. It provides much more than it, such as 
  • Distributed
  • replicated 
  • reliable
  • scalable 
  • clustered 
  • automatic load balanced 
  • consistent 
  • indexed
 in-memory  data management.  

Using Coherence, you can have distributed cache management over clustered network. IT provides several implementations , such as 
  • Local Cache 
  • Replicated Cache
  • Partitioned
  • Near Cache 
The most interesting feature is ease of installation and implementation. Installation of coherence is only one step process, just include jars in path.  
Following are few step to install, implement and test it [ Only basic implementation ]
1. Installation
Download and unzip step up  archive from Oracle Coherence home page

2.  Update Classpath
Include coherence.jar in  your CLASS_PATH, you will find this jar at coherence_home/lib/

3. Implementing using java 
//Create named cache using CacheFactory 
NamedCache cache = CacheFactory.getCache("cache_name");

//using cache, putting data in cache
cache.put("key","value");

//accessing data 
Object value = cahce.get("key");


That's it, only simple 2-3 steps and you are done with installing, putting and accessing get 

Comments

Post a Comment

Popular posts from this blog

Table sorting accessibility for AngularJS table/list

Has your SPA accessibility compliance done ? Ahhh … let me get back to you. That’s usual scenario for dynamic single page application. Since content of the web app changes dynamically/asynchronously. It required need addition planning to make dynamic web accessibility complain. For those who are new to web accessibility The power of the Web is in its universality. Access by everyone regardless of disability is an essential aspect. There are many tools are being provided to make the web accessible like screen reader. The screen reader read out the html content with help of aria attributes. One of the accessibility attribute is aria-sort . It let the user know that the given html table is sorted by of the its column and in which order. The sorted column of the table expected to have ng-aria=”ascending/descending”. The problem with SPA table is that on sorting the table the content get sorted without loading the web, so having static aria-sort attribute is going t...
Read more

State Design Pattern by Example

Image
State pattern falls under the category of Behavioral patterns. State design pattern comes in picture when a system’s behavior is depends on its own state or some other resource’s state. If an implementation is depends on the states, we end up with snarl of conditional statement every where in code. A very neat approach to deal with such situation is to separate out every state’s behavior and use them where ever they are applicable. The state pattern allows an object to alter its behavior when is internal state changes . The object is appeared to change its class. State pattern is a way to implement the same. Class Diagram : As above class diagram shows, System class holds state instance. As state of system changes , all handle request delegated to respective State’s concrete implementation. Example : Have an example of Vending machine. Vending machine has following states No Coin Inserted Coin Inserted Dispensing Empty Following diagram explain behavior...
Read more

HashMap hashCode collision by example

Image
As we all know Hash is a part of Java Collection framework and stores key-value pairs. HashMap uses hash Code value of key object to locate their possible in under line collection data structure, to be specific it is nothing but array. Hash code value of key object decide index of array where value object get stored. As per hashcode – equals method implementation rules Objects that are equal according to the equals method must return the same hashCode value. & If two objects are not equal according to equals, they are not required to return different hashCode values. As per above statement it is possible that two different object may have same hashcode values, this is called hashcode collision . To overcome this problem concept of bucket has been introduced. All the Value objects whose corresponding Key’s hashcode values are same , they fall under same bucket. Above diagram explains hash code collision. There are three key-value entries are shown , out of which second and thi...
Read more