Constructor @param p the logical plan being optimized @param joins the list of joins being performed

Constructor -- create a new predicate over two fields of two tuples. @param field1 The field index into the first tuple in the predicate @param field

@param tid the transaction on whose behalf we want to acquire the lock @param pid the page over which we want to acquire the lock @param perm the desi

Constructor. Initialize and back the log file with the specified file. We're not sure yet whether the caller is creating a brand new D

Constructor -- generate an empty logical plan

Creates a fake SeqScan that returns tuples sequentially with 'width' fields, each with the same value, that increases from low (inclusive) and high (e

Creates a new OrderBy node over the tuples from the iterator. @param orderbyField the field to which the sort is applied. @param asc true if the sort

Constructor. @param field field number of passed in tuples to compare against. @param op operation to use for comparison @param operand field value t

Constructor accepts a child operator to read tuples to apply projection to and a list of fields in output tuple @param fieldList The ids of the field

Creates a new RecordId refering to the specified PageId and tuple number. @param pid the pageid of the page on which the tuple resides @param tupleno

Creates a sequential scan over the specified table as a part of the specified transaction. @param tid The transaction this scan is running as a part

Aggregate constructor @param gbfield the 0-based index of the group-by field in the tuple, or NO_GROUPING if there is no grouping @param gbfieldtype t

Constructor. @param s The value of this field. @param maxSize The maximum size of this string

Create a new StringHistogram with a specified number of buckets. <p> Our implementation is written in terms of an IntHistogram by conv

Create a new TableStats object, that keeps track of statistics on each column of a table @param tableid The table over which to compute statistics @p

Create a new tuple with the specified schema (type). @param td the schema of this tuple. It must be a valid TupleDesc instance with at least one fiel

Create a new TupleDesc with typeAr.length fields with fields of the specified types, with associated named fields. @param typeAr array specifying the

Constructs an iterator from the specified Iterable, and the specified descriptor. @param tuples The set of tuples to iterate over

Unit test for BufferPool.transactionComplete() assuming abort. Verify that a tuple inserted during a committed transaction is durable

Unit test for BufferPool.getPage() assuming locking. Acquires two read locks on the same page.

Unit test for BufferPool.getPage() assuming locking. Acquires read locks on different pages.

Unit test for BufferPool.getPage() assuming locking. Acquires a read lock and a write lock on the same page, in that order.

Unit test for BufferPool.getPage() assuming locking. Acquires a read lock and a write lock on different pages.

Unit test for BufferPool.getPage() and BufferPool.releasePage() assuming locking. Acquires read locks on different pages.

Unit test for BufferPool.getPage() assuming locking. A single transaction should be able to acquire a read lock after it already has a write lock.

Unit test for BufferPool.getPage() assuming locking. Acquires write locks on different pages.

Unit test for BufferPool.getPage() assuming locking. Acquires a write lock and a read lock on the same page, in that order.

Set up initial resources for each unit test.

Unit test for HeapPage.addTuple()

Unit test for HeapFile.addTuple()

Unit test for BufferPool.transactionComplete(). Try to acquire locks that would conflict if old locks aren't released during transactionComplete().

Unit test for Aggregate.getNext() using an avg aggregate

Test a much-larger join ordering, to confirm that it executes in a reasonable amount of time

Closes this iterator. If overridden by a subclass, they should call super.close() in order for AbstractDbIterator's internal state to be cons

If subclasses override this, they should call super.close().

Closes the iterator.

Unit test for TupleDesc.combine()

Unit test for BufferPool.transactionComplete() assuing commit. Verify that a tuple inserted during a committed transaction is durable

Compare the specified field to the value of this Field. Return semantics are as specified by Field.compare @throws IllegalCastException if val is not

Compare the specified field to the value of this Field. Return semantics are as specified by Field.compare @throws IllegalCastException if val is not

Unit test for Aggregate.getNext() using a count aggregate with string types

Given a matrix of tuples from SystemTestUtil.createRandomHeapFile, create an identical HeapFile table @param tuples Tuples to create a HeapFile from @

Initialize each unit test

Initialize each unit test

Initialize each unit test

Initialize each unit test

Unit test for HeapPage.deleteTuple() with false tuples

Unit test for HeapPage.deleteTuple()

Removes the specifed tuple from the file on behalf of the specified transaction. This method will acquire a lock on the affected pages of the file, an

Unit test for Join.getNext() using an = predicate

Unit test for HeapPageId.equals()

Unit test for RecordId.equals()

Compares one PageId to another. @param o The object to compare against (must be a PageId) @return true if the objects are equal (e.g., page numbers a

Two RecordId objects are considered equal if they represent the same tuple. @return True if this and o represent the same tuple

Verify that the join cardinalities produced by estimateJoinCardinality() are reasonable

Verify that the estimated join costs from estimateJoinCost() are reasonable we check various order requirements for the output of estimateJoinCost.

Verify the cost estimates of scanning various numbers of pages from a HeapFile This test checks that the estimateScanCost is: +linear in numPages wh

Verify that selectivity estimates do something reasonable. Don't bother splitting this into N different functions for each possible Op because we will