Last Updated：2025/11/23
Sentence
階層データのクエリを最適化する際、関連するすべてのノードを含む、他の木に完全に含まれる最小の部分木を特定することで、計算量を大幅に削減できます。
Quizzes for review
When optimizing queries on hierarchical data, identifying the smallest subtree that contains all relevant nodes can significantly reduce computation.
See correct answer
When optimizing queries on hierarchical data, identifying the smallest subtree that contains all relevant nodes can significantly reduce computation.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
