Add a new table to the catalog. This table's contents are stored in the specified DbFile. @param file the contents of the table to add; file.getId()

Checks if the sequence represents approximately a fixed sequence (c,c,c,c,..) ret[0] is true if the sequence is linear ret[1] is the constant of the s

Interface to access operations by a string containing an integer index for command-line convenience. @param s a string containing a valid integer Op

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

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

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

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

Finish the transaction

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

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

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 the log file of the static Database instance

@return the page id this RecordId references.

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

Convert this LogicalPlan into a physicalPlan represented by a {@link DbIterator}. Attempts to find the optimal plan by using {@link JoinOptimizer#o

Print out a human readable represenation of the log

Read the specified page from disk. @throws IllegalArgumentException if the page does not exist in this file.

Releases the lock on a page. Calling this is very risky, and may result in wrong behavior. Think hard about who needs to call this and why, and why th

Handle the details of transaction commit / abort

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

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

Delete all tables from the catalog

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

Flushes a certain page to disk @param pid an ID indicating the page to flush

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

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

@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#getDbFile} and {@link Cat

Returns number of bytes of RAM used by JVM after calling System.gc many times. @return amount of RAM (in bytes) used by JVM

Retrieve the number of tuples on this page. @return the number of tuples on this page

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

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 the query text associated with this plan via {@link #setQuery}.

@return a Type array of length len populated with Type.INT_TYPE

Returns the tid of the transaction that last dirtied this page, or null if the page is not dirty

@return true if level is being logged.

Create a DbIterator over group aggregate results. @return a DbIterator whose tuples are the pair (groupVal, aggregateVal) if using group, or a sing

Merge a new tuple into the aggregate, grouping as indicated in the constructor @param tup the Tuple containing an aggregate field and a group-by field

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

Reads the next tuple from the underlying source. @return the next Tuple in the iterator, null if the iteration is finished.

Set the text of the query representing this logical plan. Does NOT parse the specified query -- this method is just used so that the object c

Abstraction to fill or clear a slot on this page.

Common unit test code for BufferPool.transactionComplete() covering commit and abort. Verify that commit persists changes to disk, and that abort reve

@return the tuple number this RecordId references.

Optional hook for validating database state after applyPredicate.

Add an aggregate over the field with the specified grouping to the query. SimpleDb only supports a single aggregate expression and GR

Add an ORDER BY expression in the specified order on the specified field. SimpleDb only supports a single ORDER BY field. @param fiel

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

Add a new value to thte histogram

Should apply the predicate to table. This will be executed in transaction tid.