Trinder, P.W. and Wadler, P. List comprehensions and the Relational Calculus Proceedings of the Glasgow 1988 Workshop on functional programming, Rothesay , August 1988, pp 115-123.  Home/Search   Document Not in Database   Summary   Related Articles

....will effectively overwrite the old values. The function divorce 1 returns the value of the transaction, which is either aborted, Reason or atomic, Value depending on whether the transaction was aborted or not. Queries in Mnesia are expressed with a so called list comprehension syntax [15]. A query to find the names of all persons with more than X children is formulated as: query [P.name P table(person) length(P.children) X] end This should be read as: construct the list of P.name s such that P is taken from the table of persons, and length of the children list is ....

....changes in table layout or network topology. Since an optimizing compiler is used to decide the execution order of the query, O M code can also become more efficient. The Mnesia query language is based on list comprehensions. This idea has been exploited in several other functional DBMSs such as [15]. The syntax of list comprehensions blend perfectly with the Erlang programming language. 3.8 Schema alteration The Erlang programming language has extensive support to change the code of executing processes without stopping the process. It is possible to change the layout or organization of ....

Trinder, P.W. and Wadler, P. List comprehensions and the Relational Calculus Proceedings of the Glasgow 1988 Workshop on functional programming, Rothesay , August 1988, pp 115-123.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC