Recursive function which finds and locks the leaf page in the B+ tree corresponding to the left-most page possibly containing the key field f. It lock

protected method used by the iterator to get the ith child page id out of this page @param i - the index of the child page id @return the ith child pa

Returns the File backing this HeapFile on disk. @return the File backing this HeapFile on disk.

Get the id of the first header page, or null if none exists @return the id of the first header page

Get the page id of the next header page @return the page id of the next header page

Generates a byte array representing the contents of this page. Used to serialize this page to disk. <p> The invariant here is that it should be possib

Get a read lock on the root pointer page. Create the root pointer page and root page if necessary. @param tid - the transaction id @param dirtypages

Adds the specified tuple to the page; the tuple should be updated to reflect that it is now stored on this page. @throws DbException if the page is

Get the id of the transaction that last dirtied this page, or null if the page is clean.. @return The id of the transaction that last dirtied this pa

@return an iterator over all tuples on this page (calling remove on this iterator throws an UnsupportedOperationException) (note that this iterator sh

Abstraction to fill or clear a slot on this page.

Merge two TupleDescs into one, with td1.numFields + td2.numFields fields, with the first td1.numFields coming from td1 and the remaining from td2. @p

Returns the next tuple, or throws NoSuchElementException if the iterator is closed. @return The next tuple in the iterator @throws DbException

Opens a BTreeFile and adds it to the catalog. @param cols number of columns in the table. @param f location of the file storing the table. @param key

Compute a logical, reasonably efficient join on the specified tables. See PS4 for hints on how this should be implemented. @param stats St

Set the page id of the first header page @param id - the id of the first header page @throws DbException if the id is invalid

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

Steal tuples from a sibling and copy them to the given page so that both pages are at least half full. Update the parent's entry so that the key matc

Convert a string to an integer, with the property that if the return value(s1) < return value(s2), then s1 < s2

Handle the details of transaction commit / abort

Add a specified field/aggregate combination to the select list of the query. Fields are output by the query such that the rightmost field is t

Add a scan to the plan. One scan node needs to be added for each alias of a table accessed by the plan. @param table the id of the tab

Ensures that combined's field names = td1's field names + td2's field names

A utility method to create a new HeapFile with a single empty page, assuming the path does not already exist. If the path exists, the file will be ove

Static method to generate a byte array corresponding to an empty BTreeRootPtrPage. Used to add new, empty pages to the file. Passing the results of th

Estimate the cardinality of a join. The cardinality of a join is the number of tuples produced by the join. @param j A LogicalJoinNode rep

Estimate the cost of a join. The cost of the join should be calculated based on the join algorithm (or algorithms) that you implemented for Lab 2. It

Estimate the join cardinality of two tables.

@return Return the alias of the table this operator scans.

@return a BTreeEntry with an IntField with value n and with RecordId(BTreePageId(1,2, BTreePageId.INTERNAL), 3)

@return return the children DbIterators of this operator. If there is only one child, return an array of only one element. For join op

Method to encapsulate the process of creating a new page. It reuses old pages if possible, and creates a new page if none are available. It wipes th

Get the page number of the first empty page in this BTreeFile. Creates a new page if none of the existing pages are empty. @param tid - the transacti

@return the PageId associated with this page.

Unit test for BTreeLeafPage.getParentId()

Checkpoint the log and write a checkpoint record.

Marks this page as dirty/not dirty and record that transaction that did the dirtying

@return the maximum value indexed by the histogram

Merge two internal pages by moving all entries from the right page to the left page and "pulling down" the corresponding key from the parent entry. De

Merge two leaf pages by moving all tuples from the right page to the left page. Delete the corresponding key and right child pointer from the parent,

@return the minimum value indexed by the histogram

@return a reverse iterator over all tuples on this page (calling remove on this iterator throws an UnsupportedOperationException) (note that this iter

Set the page id of the next header page @param id - the page id of the next header page @throws DbException

Set the page id of the previous header page @param id - the page id of the previous header page @throws DbException

set the record id for this entry @param rid - the new record id

Split a leaf page to make room for new tuples and recursively split the parent node as needed to accommodate a new entry. The new entry should have a

Recursive function to update the entries by adding a new Entry at a particular level @param entries - the list of entries @param bf - the BTreefile @

Finish the transaction

Add a new filter to the logical plan @param field The name of the over which the filter applies; this can be a fully qualified field (tablename.fi

Add a join between two fields of two different tables. @param joinField1 The name of the first join field; this can be a fully qualified name (e.g.,

@return return the name of the aggregate field in the <b>OUTPUT</b> tuples

@return return the aggregate operator

Checks if the sequence represents a quadratic sequence (approximately) ret[0] is true if the sequence is quadratic ret[1] is the common difference of

Encode the file using the BTreeFile's Insert method. @param tuples - list of tuples to add to the file @param hFile - the file to temporarily store t

Create a byte array in the format of a BTreeRootPtrPage @param root - the page number of the root page @param rootCategory - the category of the root

creates a non random B+ tree file for testing @param columns - number of columns @param rows - number of rows @param columnSpecification - optional co

Static method to generate a byte array corresponding to an empty BTreePage. Used to add new, empty pages to the file. Passing the results of this meth

Delete the specified entry (key + 1 child pointer) from the page. The recordId is used to find the specified entry, so it must not be null. After dele

Return true if the specified table is in the list of joins, false otherwise

Returns the next Tuple in the iterator, or null if the iteration is finished. Operator uses this method to implement both <code>next</code> and <code>

Generate a random set of tuples for testing @param columns - number of columns @param rows - number of rows @param maxValue - the maximum random value

Find the cardinality of the best join order in the cache for the specified plan @param s the set of joins to look up the best cardinality for

Find the cost of the best join order in the cache for the specified plan @param s the set of joins to look up the best cost for @retu

@return an Exception instance if one occurred while inserting the tuple; null otherwise

Computes the number of bytes in the header while saving room for pointers

@return the PageId associated with this page.

@return the PageId associated with this page.

Returns a unique ID used to identify this DbFile in the Catalog. This id can be used to look up the table via {@link Catalog#getDatabaseFile} and {@li

@return the field name of join field1. Should be quantified by alias or table name.