q'K      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKKKVLSAlgebraic operations. These operation do not reference their own children directly L they only contain the information that is needed to perform the operation. MNOPQRSTUVWXYZ[\]^_`ab1Information on how to perform a binary operation ; The first element is the function that is to be performed 3 The second element the column name for its result 9 The third element is the left argument for the operator ; The fourth element is the right argument for the operator cdtInformation what column, the first element, to attach to a table and what its content would be, the second element. e+Information for accessing a database table f,Information what to put in a literate table g[Information on how to perform an eq-join. The first element represents the column from the ^ first table that has to be equal to the column in the second table represented by the second  element in the pair. hGInformation that specifies how to select element at a certain position iAInformation that specifies which column contains the conditional j(Information that specifies a projection k>Information that specifies how to perform the rank operation. P its first element is the column where the output of the operation is inserted Q the second element represents the sorting criteria that determine the ranking. lySchema information, represents a table structure, the first element of the tuple is the column name the second its type. mA tuple is a list of values nLProjection information, a list of new attribute names, and their old names. ofSort information, a list (ordered in sorting priority), of pair of columns and their sort direction-- Multiple keys pAKey of a database table, a key consists of multiple column names qaList of table attribute information consisting of (column name, new column name, type of column) rName of a database table sZRight attribute name, used to represent the right argument when applying binary operators tXLeft attribute name, used to represent the left argument when applying binary operators uXSelection attribute name, used to represent the column containing the selection boolean vPOld attribute name, used to represent the old column name when renaming columns wPNew attribute name, used to represent the new column name when renaming columns xzPartition attribute name, used as a synonym where the name for the partitioning column is expected by the rownum operator yOSort attribute name, used as type synonym where a column for sorting is needed zxResult attribute name, used as type synonym where the name for a result column of a computation is needed {Attribute name or column name |Pair of a type and a value }LWrapper around values that can occur in an algebraic plan ~Algebraic types < At this level we do not have any structural types anymore ? those are represented by columns. ASur is used for surrogate & values that occur for nested lists.  Sorting rows in a direction )One table can have multiple columns DThe column data type is used to represent the table structure while . compiling ferry core into an algebraic plan I The col column contains the column number and the type of its contents U The NCol column is used to group columns that together form an element of a record < , its string argument is used to represent the field name. 9Show the values in the way compatible with the xml plan. ;Show the algebraic types in a way that is compatible with  the xml plan. GThe show instance results in values that are accepted in the xml plan. SLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ SL_^]\[ZYXWVUTSRQPONMMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~~   9An algebraic plan is the result of constructing a graph. G | The pair consists of the mapping from nodes to their respective ids % | and the algres from the top node. tAn algebraic solution is a triple consisting of the node id, a description of the database columns and all subplans ?Variable environemtn mapping from variables to compiled nodes. 1Graphs are constructed in a monadic environment. * | The graph constructed has to be a DAG. Y | The reader monad provides access to the variable environment Gamma and the loop table Z | The variable environment is a mapping from variable names to graphnodes that represent  | their compiled form. Y | The state monad gives access to a supply of fresh variables, and maintains a map from Z | nodes to node ids. When a node is inserted and an equal node (equal means, equal node Z | and equal child nodes) already exists in the map the node id for that already existing 2 | node is returned. This allows maximal sharing. !"#$JEvaluate the monadic graph into an algebraic plan, given a loop relation. %Get the current loop table &1Get the current variable environment Get a fresh node id [Check if a node already exists in the graph construction environment, if so return its id. ^Insert a node into the graph construction environment, first check if the node already exists M | if so return its id, otherwise insert it and return its id. WBlindly insert a node, get a fresh id and return that 'iEvaluate the graph construction computation with the current environment extended with a binding n to v. (DEvaluate the graph construction computation with a differnt gamma, X | and loop table. Return within he current computational context. ):Lookup a variable in the environment  !"#$%&'() !"#$%&'()#*Create an algebraic int value +!Create an algebraic string value ,"Create an algebraic boolean value -!Create an algebraic double value "Create an algebraic decimal value .Create an algebraic nat value /0Types of algebraic values 12345$Construct an empty table node with 6 Construct a database table node  The first argument is the e$mph{qualified} name of the database @ table. The second describes the columns in alphabetical order. C The third argument describes the database keys (one table key can  span over multiple columns). !Construct a table with one value 7Attach a column z of type  with value  } in all rows to table  8 Cast column { to type  and give it the name  z afterwards. 9GJoin two plans where the columns n1 of table 1 and columns n2 of table  2 are equal. :.The same as eqJoin but with multiple columns. ;&Assign a number to each row in column z incrementing  sorted by o. The numbering is not dense! <*Compute the difference between two plans. =-Same as rank but provides a dense numbering. >Get'/s the nth element(s) of a (partitioned) table. ?Select rows where the column u contains True. @Remove duplicate rows A"Make cross product from two plans B=Negate the boolen value in column n and store it in column r CUnion between two plans DProject/$rename certain column out of a plan E$Apply aggregate functions to a plan F*Similar to rowrank but this will assign a e mph{unique} number to every row  (even if two rows are equal) GASame as rownum but columns can be assigned an ordering direction H$Apply an operator to the element in t and s,  store the result in z I8Shorthand for the initial loop condition used by Ferry. #*+,-./0123456789:;<=>?@ABCDEFGHI#*+,-./0123456789:;<=>?@ABCDEFGHIeChilds of takes a list of xml elements, and nests them in the xml element given as a second argument uData child of takes some data that can be printed and adds that as child to the xml element given as second argument 1Construct a column with name n, and new status v .XML element representing a type !Construct an xml tag with name n 6Construct an algebraic node with id xId and of kind t Construct a content node HConstruct an attribute for an xml node, attrname = n and its value is v ,Attach list of attributes to an xml element )JCreate an xml distinct node NCreate an xml rownum node *Create an xml boolean not node Create an xml select node !Create an xml table binding node %Create an xml table description node Create an xml table key node =Create an xml node containing multiple table keys )J)JK  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKJC!7D%"FG9;:@=8<E?>6BAH5'(&#).*,-+3/4120    I$      !"#$%%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~TableAlgebra-0.1.5Database.Ferry.AlgebraDatabase.Ferry.Impossible#Database.Ferry.Algebra.Data.Algebra(Database.Ferry.Algebra.Data.GraphBuilder"Database.Ferry.Algebra.Data.Create&Database.Ferry.Algebra.Render.XMLUtils!Database.Ferry.Algebra.Render.XMLAlgNode SchemaInfosKeyInfosATyASurANatADoubleADecABoolAStrAIntAggrTypeDistProdAllCountSumMinMaxAvgSortDirDescAscColumnsColumnNColColAlgPlanAlgResSubPlanGamGraphM emptyPlansubPlangetPlanrunGraphgetLoopgetGamma withBinding withContextfromGamintstringbooldoublenatintTstringTboolTdoubleTnatTsurT emptyTabledbTableattachcasteqJoineqTJoinrank differencerowrank posSelectselectdistinctcrossnotCunionprojaggrrownumrownum'operinitLoop transform impossibleAlgebraAggr FunBoolNotCastFunBinOpAttachTableRef EmptyTableLitTableDistinct Difference DisjUnionEqJoinCrossPosSelSelProjRankRowRankRowNum SemInfAggrSemUnOpSemBinOp SemInfCast SemInfAttachSemInfTableRefSemInfLitTable SemInfEqJoin SemInfPosSel SemInfSel SemInfProj SemInfRank SemInfRowNumTupleProjInfSortInfKeyInfo TableAttrInf TableName RightAttrName LeftAttrName SelAttrName OldAttrName NewAttrName PartAttrName SortAttrName ResAttrNameAttrNameATyValAValVNatVDecVDoubleVBoolVStrVInt $fShowAVal $fShowATy $fShowSortDir getFreshIdfindNode insertNode insertNode'decdecTlitTableXML DictionaryXMLNode GraphNodeGraphColName isDefinedfreshId addNodeTransgetNoderunXMLchildsOf dataChildOfcolumntypeNxmlElemnode contentNodeattrattrsOf planBuilder cssToPropcsToPropserializeAlgebraiterColposCol colsToNodesnilNodealg2XML mkDifferencemkCastmkAggrsmkPosSel mkRowRank mkDistinctmkRowNum mkBoolNotmkSelectmkTable mkTableDescrmkKeymkKeysmkRank mkSortColumnmkCrossmkUnion mkEmptyTablemkColumn mkBinOpNode mkRelFnNodemkFnNode mkEqJoinNode mkProjNode mkAttachNode mkTableNodemkEdge mkQueryPlan mkPlanBundle mkXMLDocument mkProperty