BIND 10 #2054: make sure RBTree nodeFission() preserves the name of the original node
BIND 10 Development
do-not-reply at isc.org
Tue Jun 19 16:14:30 UTC 2012
#2054: make sure RBTree nodeFission() preserves the name of the original node
-------------------------------------+-------------------------------------
Reporter: | Owner:
jinmei | Status: new
Type: | Milestone: Next-Sprint-
defect | Proposed
Priority: | Resolution:
medium | Sensitive: 0
Component: data | Sub-Project: DNS
source | Estimated Difficulty: 0
Keywords: | Total Hours: 0
Defect Severity: N/A |
Feature Depending on Ticket: |
Add Hours to Ticket: 0 |
Internal?: 0 |
-------------------------------------+-------------------------------------
Comment (by jinmei):
Replying to [comment:1 vorner]:
> Do we really want to have a red-black tree in the redesigned version?
The use of red-black tree(-based tree) is not a given condition. If
we have a better option we can switch. However:
> In my understanding, there are better options, like AVL tree (the update
takes slightly longer, but it is better balanced, therefore faster to
search).
- I personally think it makes more sense to complete this version
basically just by making it more memory-efficient rather than also
revising the algorithm more fundamentally.
- The performance tradeoff between search and update does not seem to
be very obvious to me. We're basically trying to improve query
processing performance by reducing the number of looks, and the
smaller number (maybe even one) of tree lookup won't be a dominant
part in the entire query processing. Meanwhile, now that our
in-memory data source is going to be more dynamic, update
performance may matter much than before.
--
Ticket URL: <https://bind10.isc.org/ticket/2054#comment:4>
BIND 10 Development <http://bind10.isc.org>
BIND 10 Development
More information about the bind10-tickets
mailing list