Graph streams offer valuable insights into real network evolution in the era of big data. Heavy hitters and conditional heavy hitters focus on identifying entities with significant network traffic, revealing network data characteristics. In this paper, we present two methods, BLSketch and MHLSketch, for identifying heavy hitters and conditional heavy hitters in heterogeneous graph streams. BLSketch uses the bidirectional mapper, Bimap, for efficient query response times while retaining candidate information. MHLSketch uses min heap to preserve a minimal set of candidates to minimize storage space, excelling in space efficiency. The two methods can be incorporated with any sketch based graph summarization method, showing excellent adaptability. Experimental results on four real-world heterogeneous datasets of varying scales with the largest dataset containing millions of edges demonstrate our methods significantly improve the quality of query answering, outperforming state-of-the-art methods, with precision close to 1 and average relative error close to 0. We further combine our methods with density clustering to introduce the SDC model, which efficiently identifies hot regions and key users in Location-Based Social Networks (LBSN). In experiments, SDC outperforms traditional clustering by reducing up to 93.1% of cold Points of Interest (POIs) and shows strong potential for practical applications.