Unit test for BTreeInternalPage.getParentId()

@return the record id of this entry, representing the location of this entry in a BTreeFile. May be null if this entry is not stored on any page in th

@return a String array of length len populated with the (possibly null) strings in val, and an appended increasing integer at the end (val1, val2, etc

@return the table associated with this PageId

Given a table alias, return id of the table object (this id can be supplied to {@link Catalog#getDatabaseFile(int)}). Aliases are added as bas

@see simpledb.TupleDesc#merge(TupleDesc, TupleDesc) for possible implementation logic.

Generic unit test structure to grab an additional lock in a new thread. @param tid the transaction Id @param pid the first page to lock over @param p

Handle the case when an internal page becomes less than half full due to deletions. If one of its siblings has extra entries, redistribute those entri

Handle the case when a leaf page becomes less than half full due to deletions. If one of its siblings has extra tuples, redistribute those tuples. Oth

@return true if there are more tuples remaining.

Return best iterator for computing a given logical join, given the specified statistics, and the provided left and right subplans. Note that there is

Reads the schema from a file and creates the appropriate tables in the database. @param catalogFile

Write a commit record to disk for the specified tid, and force the log to disk. @param tid The committing transaction.

Truncate any unneeded portion of the log to reduce its space consumption

Write a BEGIN record for the specified transaction @param tid The transaction that is beginning

Open this iterator by getting an iterator on the first leaf page

Open this iterator by getting an iterator on the first leaf page applicable for the given predicate operation

Print out a human readable represenation of the log

@return a byte array containing the contents of the file 'path'

Read child pointers from the source file.

Read keys from the source file.

Suck up tuples from the source file.

Read tuples from the source file.

Recover the database system by ensuring that the updates of committed transactions are installed and that the updates of uncommitted t

Reset the tableid, and tableAlias of this operator. @param tableid the table to scan. @param tableAlias the alias of this table

Rollback the specified transaction, setting the state of any of pages it updated to their pre-updated state. To preserve transaction

Return a representation of this page id object as a collection of integers (used for logging) This class MUST have a constructor that

Recursive function to set all the parent pointers @param bf - the BTreeFile @param pid - id of the page to update with the parent pointer @param pare

Set all the right sibling pointers by following the left sibling pointers @param bf - the BTreeFile @param pid - the id of the page to update with th

Helper method to clean up the syntax of starting a BTreeDeleter thread. The parameters pass through to the BTreeDeleter constructor.

Return a new LogicalJoinNode with the inner and outer (t1.f1 and t2.f2) tables swapped.

Tests the scan operator for a table with the specified dimensions.

Tests the scan operator for a table with the specified dimensions.

Constructor. Implementation hint: depending on the type of afield, you will want to construct an {@link IntegerAggregator} or {@link StringAggregator

@param bf the B+ tree file from which we want to delete the tuple(s) @param the list of tuples to delete

Constructor to create a new BTreeEntry @param key - the key @param leftChild - page id of the left child @param rightChild - page id of the right chil

Constructs a B+ tree file backed by the specified file. @param f - the file that stores the on-disk backing store for this B+ tree file. @

Constructor for this iterator @param f - the BTreeFile containing the tuples @param tid - the transaction id

Create a BTreeHeaderPage from a set of bytes of data read from disk. The format of a BTreeHeaderPage is two pointers to the next and previous header p

@param bf the B+ tree file into which we want to insert the tuple @param tupdata the data of the tuple to insert @param the list of tuples that were s

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

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

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

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

@param tid the transaction on whose behalf we want to search for the tuple(s) @param bf the B+ tree file containing the tuple(s) @param f the field to

Constructor. Construct the BTreeRootPtrPage from a set of bytes of data read from disk. The format of an BTreeRootPtrPage is an integer for the page n

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

Constructor for this iterator @param f - the BTreeFile containing the tuples @param tid - the transaction id @param ipred - the predicate to filter on

@param tid the transaction on whose behalf we want to insert the tuple @param bf the B+ tree file into which we want to insert the tuple @param item t

Creates a BufferPool that caches up to numPages pages. @param numPages maximum number of pages in this buffer pool.

Constructor. Creates a new, empty catalog.

Constructor specifying the transaction that this delete belongs to as well as the child to read from. @param t The transaction this delete

Constructor accepts a predicate to apply and a child operator to read tuples to filter from. @param p The predicate to filter tuples with

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

Constructs a heap file backed by the specified file. @param f the file that stores the on-disk backing store for this heap file