Skip to main content

Harmful Girls : Way of looking


How it is harmful :
Girls are beautiful, intelligent, and altogether wonderful creatures... at least for the most part. There are several harmful types of girls you should avoid dating to help save your emotional, physical, and even financial well being. These types of girls are usually selfish and/or have bad habits that make them harmful to date. To get the scoop on these types of girls and how to identify them.
1. Spoiled Brats : Spoiled brats make bad dating options because of their unrealistic expectations and unwillingness to acknowledge their flaws. If you decide to date a spoiled brat, you should expect to do a lot of work without getting any credit for it.

2. Players : Players will charm, seduce, and even date you, but they'll never start a real relationship with you. They're bad to date because they jump from guy to guy and don't offer any real long term potential.

3. Party Girls : Party girls aren't any good to date because they just love partying too much. If you aren't much of a party guy yourself, this can cause some problems down the road.

4. Gold Diggers : Gold diggers will go to great lengths to find and date men with money. This is a problem because they want to live a life of luxury without having to work for it. Gold diggers are usually very shallow and value money and material possessions more than anything else.

5. Psychos : If you decide to date a psycho, you better be prepared for some very serious challenges. Psycho girls are characterized by being insecure, controlling, manipulative, and needy. Like the many other types of girls on this list, psychos are very selfishly motivated. If that isn't bad enough, they're the most difficult type of girl to break up with. If you start a serious relationship with a psycho and she becomes dependent on you, breaking up with her will take more than just a talk. She'll kick and scream to the very end and might even make threats against you or herself. This is where things can get really dangerous for your emotional and physical well being.
Labels:

Comments

Post a Comment

Popular posts from this blog

Bitmap index

Bitmap index is one of the index types that is supported by oracle. Unlike B*tree index, this is very compressed index. It means if I create a bitmap index on a column, then the generated index table will be smaller when compared the index table which is generated by the binary index on the same column. The reason is, in bitmap index, ROWIDs won’t be stored in the index table, instead index values will be mapped against bitmaps. Bitmap is nothing but it stores either of this values, 1(Match) or 0(No Match). For each distinct values in the column, a separate index record will be created. Unlike b*tree index, bitmap index can accept NULL and it creates separate index entry for this. Bitmap index will work better if number of distinct values are relatively less when compared to the total number of records. Why is it referred as “relatively less”? this index will work fine if table of 1,000,000,000 records contains 5000 distinct values and if table of 1,000 records contains 5 distinct va...
Post a Comment
Read more

Nested Loop Natural Join

When the optimizer tries to finalize the execution plan of a query, it considers a lot of items. It must take the interrelated decisions based on those items. Most important of those items are, Ø   Access path Ø   Join Order Ø   Join Operation Access path tells how the required data is going to be retrieved from a table. So, this tells nothing but which index scan is imposed on that table like index range, index skip scan and so on. Join Order means, to execute a query that joins more than two tables, Oracle joins two of the tables, and then joins the resulting row source to the next table. This process is continued until all tables are joined into the result. It means oracle can join only two tables at most in a time though more than two tables are referred in a query. Oracle always tries to join the small tables first and then joins with the large tables. The reason behind is, it always tries to lower the number of resultant records formed while in the process of jo...
Post a Comment
Read more

Hash Outer Join

As per the definition of hash outer join, the driving (or parent) table whose rows are being preserved is used to build the hash table, and the driven (or child) table is used to probe the hash table. To perform this hash outer join, Oracle follows these steps (assume, child table has to be outer-joined with parent table): 1.      Oracle chooses parent table as the hash table (otherwise called as driving table). Oracle built the hash table in RAM after applying the hash function on the joining column(s) of the driving table. 2.      Oracle chooses child table as the probe table (otherwise called as driven table or probing table). It traverse through all the records of this probe table, applies the same hash function on the joining column(s) [column(s) used to join these two tables] and will hit the corresponding entry in the hash table. 3.      Oracle returns the output if a record from the driving table is already present in...
Post a Comment
Read more