Scalable Vector Graphics (SVG) is a XML based language for describing 2D (two dimension) graphics, both static and dynamic.

SVG is an open standard developed by W3C (World Wide Web Consortium). Since the SVG images are defined in XML, they can be searched, indexed, compressed. SVG images can be edited using any text editors.

All major web browsers except Internet Explorer supports and renders the SVG images. Internet Explorer needs a plugin for rendering SVG images.

SVG allows 3 types of graphics:

1. Vector Graphics

2. Raster Graphics

3. Text

A typical SVG image’s xml look like

<?xml version="1.0"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
         "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<svg xmlns="http://www.w3.org/2000/svg"
     xmlns:xlink="http://www.w3.org/1999/xlink">
  <polygon fill="red" stroke-width="10" fill-opacity="0.4"
           points="350, 75 379,161 469,161 397,215
                   423,301 350,250 277,301 303,215
                   231,161 321,161"
           transform="translate(-350,-200) scale(2) rotate(10)" />
</svg>

and its Image output

Popularity: 1% [?]

The iBATIS Data Mapper makes it easier to use a database with Java and .NET applications. iBATIS couples objects with stored procedures or SQL statements using a XML descriptor. Simplicity is the biggest advantage of the iBATIS Data Mapper over object relational mapping tools.

The iBatis framework is a lightweight data mapping framework and persistence API that can be used to quickly leverage a legacy database schema to generate a database persistence layer for your Java application. A set of XML encoded SQL Map files–one for each database table–holds SQL templates that are executed as prepared statements and map the expected results to Java domain classes. From application code, a layer of iBatis Data Access Objects (DAO) acts as the API that executes the SQL Map templates and assigns the results to the corresponding Java domain classes.

To enable communication among DAO layers and Sql Map layers, an XML configuration file describes each DAO interface and implementation class, as well as the location of a second XML configuration file that in turn points to each SQL Map file and contains the database connection information.

Popularity: 1% [?]

Linked list is one of the fundamental concepts in the data structure. It consists of a set of nodes, each containing a ‘data’ field and one or two references (pointing to adjacent nodes). It is a self referential datatype since it contains reference(s) of the adjacent (next or previous) datum of the same type.

Advantage :
Advantage of linked list compared to conventional array are

• Insertions and deletions of nodes can be done at anywhere in the list.
• List size can be increased and decreased in runtime.
• Order of the linked items can be different from how it is stored in memory or disk, thus allowing the list of items to be traversed in different order.

Types of linked lists exist are Singly linked list, Doubly linked list and Circular linked list.

Popularity: 1% [?]