ExtJS Themes

http://extjs.fudini.net/

http://tympanus.net/Development/PhotoDesk/

http://tympanus.net/Development/PhotoDesk/

http://www.webappers.com/2010/08/06/how-to-create-a-gallery-with-scrollable-thumbnails/

http://www.webappers.com/2010/08/06/how-to-create-a-gallery-with-scrollable-thumbnails/

Image slider

http://sorgalla.com/projects/jcarousel/examples/dynamic_javascript.html

disable Browser back button

echo "";

Back button on IE constantly Expires when Moving back to previous page…

Back button on IE constantly Expires when Moving back to previous page…

Response time using form

http://faceconn.com

http://faceconn.com/facebook-extended-permissions-php?sms_ss=facebook&at_xt=4dc2b64b42199b45%2C0

OAuth 2.0

http://www2.alcatel-lucent.com/blogs/techzine/2010/oauth-101/?s_cid=techzine_ppc&s_kwcid=TC|13245|oauth||S|p|9817336659


http://code.google.com/apis/accounts/docs/OAuth2.html

http://translateth.is/

http://translateth.is/

PHP Deamon

http://kevin.vanzonneveld.net/techblog/article/create_daemons_in_php/

share folder in windows using cmd

net share folderpath

Test post

http://davidwalsh.name/

http://gallery.expression.microsoft.com/SeadragonAjax

http://gallery.expression.microsoft.com/SeadragonAjax

Division like select box

Apply size tag

Learn Json

http://it.toolbox.com/blogs/enterprise-web-solutions/json-basics-in-javascript-32660

http://en.wikipedia.org/wiki/JSON

Ajax Basics

open function has 3 parameters
1. method ->get,post (usually 'get' for security)
2. url
3. true/false (true - It means asynchronus request and false - it means synchronus request)


XMLHttpRequest is a javascript object performs asynchronous interaction with server

IE6 and PNG

filter:progid:DXImageTransform.Microsoft.AlphaImageLoader(
src='image.png', sizingMethod='scale');"

Position in html

position:absolute
If you define the position to be absolute it will be calculated from the upper left corner of the page - unless the layer is defined inside another layer, in which case it will be calculated from the upper left corner of the parent layer.

position:relative
If you define the position to be relative it will be relative to the position of the tag that carries the style.
That is, if you add a relatively positioned layer in the middle of the page, then the position will be calculated from that exact spot in the middle of your page where it was added.

Ebooks with Head First

http://getting-free-ebooks.blogspot.com

Jasper Report installation Link

http://aspalliance.com/1140_Creating_Report_Using_JasperReports.all

DBMS/RDBMS

A DBMS has to be persistent, that is it should be accessible when the program created the data ceases to exist or even the application that created the data restarted. A DBMS also has to provide some uniform methods independent of a specific application for accessing the information that is stored.

RDBMS is a Relational Data Base Management System Relational DBMS. This adds the additional condition that the system supports a tabular structure for the data, with enforced relationships between the tables. This excludes the databases that don't support a tabular structure or don't enforce relationships between tables.

Many DBA's think that RDBMS is a Client Server Database system but thats not the case with RDBMS.

Yes you can say DBMS does not impose any constraints or security with regard to data manipulation it is user or the programmer responsibility to ensure the ACID PROPERTY of the database whereas the rdbms is more with this regard bcz rdbms define the integrity constraint for the purpose of holding ACID PROPERTY.

POSTGRESQL vs MYSQL

	POSTGRESQL	MYSQL
ANSI SQL compliance	Closer to ANSI SQL standard	Follows some of the ANSI SQL standards
Performance	Slower	Faster
Sub-selects	Yes	No
Transactions	Yes	Yes, however InnoDB table type must be used
Database replication	Yes	Yes
Foreign key support	Yes	No
Views	Yes	No
Stored procedures	Yes	No
Triggers	Yes	No
Unions	Yes	No
Full joins	Yes	No
Constraints	Yes	No
Windows support	Yes	Yes
Vacuum (cleanup)	Yes	No
ODBC	Yes	Yes
JDBC	Yes	Yes
Different table types	No	Yes

DML DDL DCL TCL

DDL

Data Definition Language (DDL) statements are used to define the database structure or schema. Some examples:

• CREATE - to create objects in the database
• ALTER - alters the structure of the database
• DROP - delete objects from the database
• TRUNCATE - remove all records from a table, including all spaces allocated for the records are removed
• COMMENT - add comments to the data dictionary
• RENAME - rename an object

DML

Data Manipulation Language (DML) statements are used for managing data within schema objects. Some examples:

• SELECT - retrieve data from the a database
• INSERT - insert data into a table
• UPDATE - updates existing data within a table
• DELETE - deletes all records from a table, the space for the records remain
• MERGE - UPSERT operation (insert or update)
• CALL - call a PL/SQL or Java subprogram
• EXPLAIN PLAN - explain access path to data
• LOCK TABLE - control concurrency

DCL

Data Control Language (DCL) statements. Some examples:

• GRANT - gives user's access privileges to database
• REVOKE - withdraw access privileges given with the GRANT command

TCL

Transaction Control (TCL) statements are used to manage the changes made by DML statements. It allows statements to be grouped together into logical transactions.

• COMMIT - save work done
• SAVEPOINT - identify a point in a transaction to which you can later roll back
• ROLLBACK - restore database to original since the last COMMIT
• SET TRANSACTION - Change transaction options like isolation level and what rollback segment to use

Difference between Cluster and Non-cluster index

A clustered index is a special type of index that reorders 
the way records in the table are physically stored. 
Therefore table can have only one clustered index. The leaf 
nodes of a clustered index contain the data pages.
Clustered index will be created by default when u 
create primary key on a column. So we can create one 
clustered index per table. clustered index is stored in 
serial passion.

A nonclustered index is a special type of index in which 
the logical order of the index does not match the physical 
stored order of the rows on disk. The leaf node of a 
nonclustered index does not consist of the data pages. 
Instead, the leaf nodes contain index rows. A table can have 249 non clustred index.Non clustered index will be created automatically when u 
create unique key on a column. A table can have no.of 
unique keys, so we can create no.of non clustered indexes 
per table.

UNIQUE constraints Vs UNIQUE index

The differences between the two methods are very subtle. UNIQUE constraints are part of the ANSI SQL definition and defining UNIQUE constraints is part of defining a database's logical design. In addition, UNIQUE constraints can be created as part of a table's definition and, as a by-product, SQL Server will automatically create a unique index under the hood when the constraint is created. In contrast, defining unique indexes are part of designing the physical data model and they are not ANSI standard.

From a performance standpoint, UNIQUE constraints and unique indexes are effectively the same to the query optimizer and you will not see any performance benefit to using one vs the other.

Database Indexes

Why is it needed?
When data is stored on disk based storage devices, it is stored as blocks of data. These blocks are accessed in their entirety, making them the atomic disk access operation. Disk blocks are structured in much the same way as linked lists; both contain a section for data, a pointer to the location of the next node (or block), and both need not be stored contiguously.
Due to the fact that a number of records can only be sorted on one field, we can state that searching on a field that isn’t sorted requires a Linear Search which requires N/2 block accesses, where N is the number of blocks that the table spans. If that field is a non-key field (i.e. doesn’t contain unique entries) then the entire table space must be searched at N block accesses.
Whereas with a sorted field, a Binary Search may be used, this has log2 N block accesses. Also since the data is sorted given a non-key field, the rest of the table doesn’t need to be searched for duplicate values, once a higher value is found. Thus the performance increase is substantial.
What is indexing?
Indexing is a way of sorting a number of records on multiple fields. Creating an index on a field in a table creates another data structure which holds the field value, and pointer to the record it relates to. This index structure is then sorted, allowing Binary Searches to be performed on it.
The downside to indexing is that these indexes require additional space on the disk, since the indexes are stored together in a MyISAM database, this file can quickly reach the size limits of the underlying file system if many fields within the same table are indexed.

When should it be used?
Given that creating an index requires additional disk space , and that too many indexes can cause issues arising from the file systems size limits, careful thought must be used to select the correct fields to index.
Since indexes are only used to speed up the searching for a matching field within the records, it stands to reason that indexing fields used only for output would be simply a waste of disk space and processing time when doing an insert or delete operation, and thus should be avoided. Also given the nature of a binary search, the cardinality or uniqueness of the data is important. Indexing on a field with a cardinality of 2 would split the data in half, whereas a cardinality of 1,000 would return approximately 1,000 records. With such a low cardinality the effectiveness is reduced to a linear sort, and the query optimizer will avoid using the index if the cardinality is greater than 30% of the record number, effectively making the index a waste of space.

MySql engines- comparision

	MyISAM	InnoDB	MEMORY	NDB
Multi-statement transactions, ROLLBACK	-	X	-	X
Foreign key constraints	-	X	-	-
Locking level	table	row	table	row
BTREE indexes	X	X	-	X
FULLTEXT indexes	X	-	-	-
HASH lookups	-	X	X	X
Other in-memory tree-based index	-	-	4.1.0	-
GIS, RTREE indexes	4.1.0	-	-	-
Unicode	4.1.0	4.1.2	-	-
Merge (union views)	X	-	-	-
Compress read-only storage	X	-	-	-
Relative disk use	low	high	-	low
Relative memory use	low	high	low	high

Vista Booster

Vista Registry Booster Utility offers easy-to-use optimization tools to speed up and improve the stability of your Windows 7, Windows Vista, or Windows XP PC. Regardless of your level of expertise, Vista Registry Booster Utility safely cleans, repairs, and optimizes the registry and automatically backs up changes for future recovery. Now includes essential tools to fix Windows security loopholes. Permanently erase your Internet activity, personal files, and free space to keep your information away from prying eyes.


http://www.digeus.com/products/regcleaner/vista-registry-booster-utility.html