Extended SQL Trace

Oracle traces 2 types of events - database calls (eg EXEC, PARSE, FETCH etc)  and OS calls made. 

Database call entry - name of the calll, cursor handle id, c = cpu time in usec, e =2.718 elapsed time, p = bin of oracle block, cr + consistent mode call made,  cu = current mode call made, ms = no of misses from the lib cache, r = no row returned, dep = depth of the call (is the call a child of another call), og = optimised goal number (all, first, rule, choose), plh = plan hash value, tim = timestamp of the entry ( made at end of the call).

System call always identified by the word WAIT and follow by the cursor handle id, nam = descriptive name of the syscall, ela = elapsed time of the call, file #, block #, blocks = number of blocks returned, obj # = oracle object number, tim = timestamp when this entry is logged (when the call conpleted. 

Tabula Recta

Substation cipher encrypt a message by substituting a character with another this mixing up the original message. A polyalphabetic substitution replace the same character by more than 1 alphabets so making it harder to break. Tabula recta uses a matrix of alphabets and a key phrase. To encrypt, the message is aligned with the secret key which is used an index to look up from the aplhabet matrix the corresponding character to substitute with. The key shorter than the message is repeatedly used. Another trick is to expand the key. The key can be an excerpt of text from a book that is as long as the message. 

Random surfer algorithm

In a search engine, a query will identify a group of pages. The pages are ranked by many factors. One of them is how many hyperlinks reference this page indicating the popularity and thus the relevance. 

Another consideration is if the page linking to the target page is more authoritative than other page pointing to another target page. In other words, not all links are equal weigh.  Computer is not able to discern which referencing page is more authoritative  

The random surfer algorithm use to assign an authoritative score for each page to be further use in the ranking stage. It is simulating a person surfing by following a random link on a page to another page.  He surf a random number of page and then restart the process from the base page again. The random behaviour reduce the effect of loop and also simulating the popularity of a page.

Diffe-Hellman Key Exchange

Each party choose a separate secret number for themselves 

Both parties agreed on a common base number and a modulus.  The modulus must be a large prime number  the base must be a primitive root of the modulus (when the base is raised to a certain power successively, the reminder will cover all numbers within the modulus boundary.   

Each party calculate base raise to the power of their secret number then derive the modulus. Each party send the result to the other. 

Each party raise the reminder from the other party to the power of their secret number. The reminder is calculated and thus become the share secret.  

Search Engine Indexing

Each word on a web page is placed on an index. In addition, the relative position of the word on a page is also stored (for example, first word is 1 and the second word is a 2). 

The word location can be used to support phrase searching (mult-word sequence). It also allow the search engine to estimate the relevance of a page to the query. The closer the distance between words on a page, the more relevant is the page to the query. 

Beside the content, search engine also index html tags to support search for specific part of document like “cat in the title”

Lossy Compression (image and audio)

Lossy compression works by ignoring details in the original file. The image is divided into a smaller block (say 8x8 bytes). The content in each block is analyzed and replaced by a smaller format. For example, if the block contain the same color, it is replaced by one number. If the block is dominant by a certain color, it is replaced by that color. If there is a gradient, it is replaced by a range. 

Lossless Compression

General rule is to replace a long pattern with shorter pattern. It could be replacing a long repeating string with instruction to copy from the previous position with length  or it could be replacing most frequent character from 2 bytes to 1 byte encoding but rare characters either more encoding bytes.