a) Materialized Paths b) Array of Ancestors c) Nested Sets d) None of the mentioned Answer: a
View QuestionThe ____________ pattern identifies each node in the tree as stops in a round-trip traversal of the tree.
a) Materialized Paths b) Array of Ancestors c) Nested Sets d) None of the mentioned Answer: c
View QuestionThe Array of Ancestors pattern is slightly slower than the ________________ pattern.
a) Materialized Paths b) Array of Ancestors c) Nested Sets d) None of the mentioned Answer: a
View QuestionWhich of the following pattern is more straightforward to use?
a) Materialized Paths b) Array of Ancestors c) Nested Sets d) None of the mentioned Answer: b
View QuestionWhich of the following pattern may provide a suitable solution for storing graphs?
a) Child b) Parent c) Root d) None of the mentioned Answer: a Explanation: Node may ...
View QuestionPoint out the wrong statement.
a) You cannot query for a node in the children field to find its parent node only b) ...
View QuestionThe _________ References pattern stores each tree node in array the id(s) of the node’s children.
a) Child b) Parent c) Root d) None of the mentioned Answer: a Explanation: In addition to ...
View QuestionThe ________ Links pattern provides a simple solution to tree storage but requires multiple queries to retrieve subtrees.
a) Child b) Parent c) Root d) All of the mentioned Answer: b Explanation: You can query ...
View QuestionPoint out the correct statement.
a) The query to retrieve the parent of a node is fast and straightforward b) The query to ...
View QuestionThe ________ References pattern stores each tree node in a document; in addition to the tree node, the document stores the id of the node’s parent.
a) Child b) Parent c) Root d) None of the mentioned Answer: b Explanation: Data model that ...
View Question