Good Afternoon Kathleen: You may have noticed this discussion of the bin index mechanism:
http://genomewiki.ucsc.edu/index.php/Bin_indexing_system You can use the test program in the source tree: src/hg/lib/tests/binTest.sh and binTest.c built into a binary command to see what the SQL select statements look like for any particular item. --Hiram [email protected] wrote: > Dear UCSC development team, > > I am writing to ask about the internal bin index mechanism. > Given a (start, end) chromosome coordinate, a bin number will be assigned > to it first. Then a range goes into the smallest bin it will fit in. Now > all the bins with the same number of the last step can be selected as set > A. > What I want ask here is what will do for the next query step? Are there > other mechanisms to use for the final result index? Or just compare the > coordinates of set A with the query range one by one using > and < logic > identifiers? > > Thank you in advance! > > Kathleen > 11-05-08 > > _______________________________________________ > Genome maillist - [email protected] > https://lists.soe.ucsc.edu/mailman/listinfo/genome > _______________________________________________ Genome maillist - [email protected] https://lists.soe.ucsc.edu/mailman/listinfo/genome
