Project: datamanagement
Issue DM-2845: Near Neighbor Optimizations
To optimize near neighbor queries we are maintaining overlap tables and subchunking. It'd be useful to revisit that. Getting rid of subchunks would simplify qserv code. This epic involves * testing speed of in-database near neighbor queries without subchunking, including how sensitive the optimizer is for these types of queries * exploring possibility of precalculating and storing near neighbors, perhaps per subchunk
Story points: 15