Q. The ________ Links pattern provides a simple solution to tree storage but requires multiple queries to retrieve subtrees.

View solution

Q. The _________ References pattern stores each tree node in array the id(s) of the node’s children.

View solution

Q. Point out the wrong statement.

View solution

Q. Which of the following pattern may provide a suitable solution for storing graphs?

View solution

Q. Which of the following pattern is more straightforward to use?

View solution

Q. The Array of Ancestors pattern is slightly slower than the ________________ pattern.

View solution

Q. The ____________ pattern identifies each node in the tree as stops in a round-trip traversal of the tree.

View solution

Q. ____________ pattern requires additional steps of working with strings and regular expressions.

View solution

Q. Which of the following pattern is best for static trees that do not change?

View solution

Q. Point out the correct statement.

View solution

Q. Which of the following operations are atomic on document level?

View solution

Q. ___________ bulk indexes may be more efficient for some kinds of content and workloads in real time.

View solution

Q. Point out the correct statement.

View solution

Q. ________ indexes can include any field whose value is a string or an array of string elements.

View solution

Q. Which of the following is related to document that do not provide a way to weight results?

View solution

Q. Which of the following is related to document that provide support for synonym or related queries in the application layer?

View solution

Q. Which of the following is related to the parsing of document for root?

View solution

Q. To add structures to your document to support keyword-based queries add the keywords as ______ in the array.

View solution

Q. __________ precision multiplies the monetary value by a power of 10.

View solution

Q. Point out the correct statement.

View solution