anchor.diff:  ExcerptTailer reader = chronicle.createTailer();
   ----
   
  -The `NativeExcerptAppender.startExcerpt` method performs checks and calculates the `startAddr` and `limitAddr(startAddr+100)` for this excerpt.
  -
  -[source,java]
  -----
  -appender.startExcerpt(100);
  -----
  -
  -The `writeObject` method copies the contents of the object into the excerpt:
  -
  -[source,java]
  -----
  -appender.writeObject("TestMessage");
  -----
  -
  -The `finish` method object offset is written to index cache. This method acts like a commit, without writing this offset to cache you put data to the data cache, but not persist it.
  -
  -[source,java]
  -----
  -appender.finish();
  -----
  -
  -In order to read data from the data cache, you first need to get the physical start address of the data from index cache. The `Reader.index(0)` method does the calculation for you. You read the data and finish the reading operation:
  -
  -[source,java]
  -----
  -reader.index(0); // optional as it is at the start already
  -Object ret = reader.readObject();
  -reader.finish();
  -----
  +The `write` and `read` an object 
  +
  +[source,java]
  +----
  +// todo
  +----
  +
   
   == Tiered Indexing
   Chronicle Queue uses tiered multi-level indexing to provide a fast and efficient method for searching for messages in a large queue.
  
positive.code: 
  [source,java]
  ----
  package net.openhft.chronicle.examples;
  import java.io.IOException;
      import net.openhft.chronicle.Excerpt;
      import net.openhft.chronicle.ExcerptAppender;
      import net.openhft.chronicle.Chronicle;
      import net.openhft.chronicle.ChronicleQueueBuilder;
      import net.openhft.chronicle.tools.ChronicleTools;
  
      public class GettingStartedMain {
          public static void main(String... ignored) throws IOException {
  
              String basePath = System.getProperty("java.io.tmpdir") + "/SimpleChronicle";
              ChronicleTools.deleteOnExit(basePath);
  
              Chronicle chronicle = ChronicleQueueBuilder.indexed(basePath).build();
  
              // write one object
              ExcerptAppender appender = chronicle.acquireAppender();
              appender.startExcerpt(256); // an upper limit to how much space in bytes this message should need.
              appender.writeObject("TestMessage");
              appender.finish();
              appender.close();
  
              // read one object
              ExcerptTailer reader = chronicle.createTailer();
              while(!reader.nextIndex()); // while until there is a new Excerpt to read
              Object ret = reader.readObject();
              reader.finish();
              reader.close();
  
              chronicle.close();
  
              System.out.println(ret);
          }
      }
  
  ----
  
  Create a Chronicle queue giving `Java_temp_directory/SimpleChronicle` as the base folder.
  
  [source,java]
  ----
  String basePath = System.getProperty("java.io.tmpdir") + "/SimpleChronicle";
  ChronicleTools.deleteOnExit(basePath);
  
  Chronicle chronicle = ChronicleQueueBuilder.indexed(basePath).build();
  ----
  
  Chronicle creates two `RandomAccessFile`. One for indexes, and one for data having names relatively:
  
  [source,java]
  ----
  Java_temp_directory/SimpleChronicle.index
  Java_temp_directory/SimpleChronicle.data
  ----
  
  Create appender and reader:
  
  [source,java]
  
negative.code: 
  == Building Blocks
  
  Chronicle Queue has two main conceptual components:
  
   - Tailer - used for both sequential reads and random reads
   - Appender - sequential writes
  
  Chronicle Queue is the main interface for management and can be seen as the collection class of the Chronicle environment.
  
  Chronicle Queue allows you to put huge numbers of objects of different sizes onto a single queue. For each data record, Chronicle builds it indexes ( used for random access reads ) automatically when ever messages are appended to the queue. 
  
  An appender is used to write/add data to the queue.
  
   
  == Getting Started
  In the following example we will:
  
  