The data in that graph doesn't show what your title is inferring. For one, the y-axis is relative, and not absolute. Secondly, your data range is set to the past week so this says nothing about how this method of searching is trending over any useful period of time.
Kalcifer
joined 2 years ago
I don't really understand this reasoning. Some server would still need to receive those requests at some point. Would it not be better if those requests were distributed, rather than pounded onto one server? If you have a server caching all the content for its users, then all of its users are sending all of those requests for content to that one single server. If users fetched content from their source servers, then the load would be distributed. The only real difference that I can think of is that the speed of post retreival. Even then, though, that could be flawed, as perhaps the source server is faster than one's host server.
Assuming you already have rectangle contraints – horizontal, vertical, width, height, etc. – then I’d probably constrain the centers to be coincident.
Yeah, you can see all those constraints in the picture.
Constrain one with height and width equal to parameters, and constrain the other based on 80% of the dimensions.
Ah, okay - this is more or less the way that I usually do it. If its a box, the concentric separation, or "wall thickness" would be the same, so I would set a vertical and horizontal distance constraint between the outer and inner rectangles. This just felt sort of hacky to me, so I was wondering if there was a dedicated constraint so that I could, for example, select the outer rectangle, and the inner rectangle, then click a "Constrain concentric" option. Then I would only need one constraint for the wall thickness.
From what I understand, media (images, videos, etc.) is not cached. Does that not mean that, in the worst case where every post contained an image, the instance would be serving every subscriber, anyways?