Predicate-oriented Database Search Algorithms

a₁ Alg(a ANTICIP(v anticipated nodes AVL trees b₁ b₂ BB(a calculate CERT and SCERT chapter component COUNT algorithm current interior nodes data-image data-retrieval data-structure database management system defined definition deletion commands described DETERMINE(a discussion disjunction sequence E-3 predicate E-7 expressions efficient equal equation example FIND-1 algorithm fully constructed GCAS given Harvard Mathematics Department hashlist implies insertion and deletion insertion or deletion interval leaf lemma Let e(x mainline Nievergelt-Reingold Note NR-DETERMINE(a optimization paragraphs parameters partially constructed patch PENALTY-P subroutine perform pointer preceeding procedure quantifier R₁ reader Reduction-Oriented relational algebra relational calculus relational database renewal nodes retrieval ROTATE subroutine runtime coefficient satisfy e(x SCERT runtimes sequence set of leaves step subroutine-call subset substep subtree SUM-1 algorithm super-B-tree algorithm symbol techniques theorems thesis tree trivial tuples unary predicates universal quantifier update user's verify worst-case hashtime worst-case runtime x.a₁ y-attributes y-records that satisfy y.b₁