Benchmark small cone search on big catalog

[delucchi-cmu]

Provide rough timing breakdowns for a process like:

• load PanStarrs catalog (just the hipscat catalog, not the LSDB one)
• create pixel tree
• perform small cone search that will return 1-4 tiles

It may be enough to just write down what these timings are, but adding to the list of always-run benchmarks would be ideal (if we can figure out our benchmark data situation).