Create a HeapPage from a set of bytes of data read from disk. The format of a HeapPage is a set of header bytes indicating the slots of the page that

Constructor. Create a page id structure for a specific page of a specific table. @param tableId The table that is being referenced @param pgNo The pa

Constructor. @param fvalue The value that the predicate compares against. @param op The operation to apply (as defined in Predicate.Op); either Pre

Constructor. @param t The transaction running the insert. @param child The child operator from which to read tuples to be inser

Constructor. @param i The value of this field.

Create a new IntHistogram. This IntHistogram should maintain a histogram of integer values that it receives. It should split the histogram into "buck

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

Constructor. Accepts two children to join and the predicate to join them on @param p The predicate to use to join the children @param chil

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 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

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

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

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

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

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 converting each Stri

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

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

Construct a TupleComparator @param keyField - the index of the field the tuples are keyed on

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

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.

Unit test for BTreeInternalPage.addEntry()

Add a new cost, cardinality and ordering for a particular join set. Does not verify that the new cost is less than any previously added cost

Set up initial resources for each unit test.

Set up initial resources for each unit test.

Set up initial resources for each unit test.

Set up initial resources for each unit test.

Set up initial resources for each unit test.

Unit test for HeapPage.addTuple()

Unit test for HeapFile.addTuple()

Unit test for BTreeLeafPage.addTuple()

Add a new value to thte histogram

@return the aggregate field

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

@return the average selectivity of this histogram. This is not an indispensable method to implement the basic join optimization. It m

@return the average selectivity of this histogram. This is not an indispensable method to implement the basic join optimization. It may b

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

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

Closes the iterator.