Consider a document database wherein the documents have large static text and small volatile tags.

Which architectural choice would be most efficient for collecting summary statistics on the tag?

1. sharding
2. horizontal partitioning
3. data striping
4. vertical partitioning

step-by-step explanation:

hi there!

the answer will be d: 2

see attached

step-by-step explanation:

given the function as;

write the equation replacing f(x) with y

form   and fill a table containing values of y with corresponding values of x

you can take a range for   values of x as -3≤x≤3

solving for x=-3

for x=-2

repeat the same procedure to get the values of y for the remaining ,x=-1 to x=3

plot the values of y against values   of x and obtain the following graph

no oblique asymptote

step-by-step explanation:

to find the oblique asymptote of f(x)

here numerator has degree 1 and denomintor degree 2

degree of numerator < degree of denominator

hence there is no oblique asymptote

when the degree of the denominator > that of the numerator, we saw that the value in the denominator got so much bigger, so quickly,   giving us a horizontal asymptote of the x-axis. or we can write

f(x) = a polynomial of x + a proper fraction.

in this case only we have oblique asymptotes but not when numerator has less degree.