Interview Question

Frontline Analyst Developer Interview New York, NY

How does indexing work in a database? How is it

  implemented? what happens when user types ABC?
Tags:
technical, goldman sachs, gs
Answer

Interview Answer

2 Answers

0

Implemented as a tree, When user types ABC, the db will return all matches/subtrees below C - all ABCD's, ABCE's, etc. If there are multiple ABCD's, then the lowermost node-leaf-D-will point to all the ABCD locations.

Interview Candidate on Sep 26, 2012
0

Recursive algorithm for Fibonacci sequence is not nlog(n), it must be ~1.6^n, i.e. very bad, hm..

thexesus on Feb 17, 2013

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up