| Citation: | Andreas Blass, Yuri Gurevich, and Jan Van den Bussche, "Abstract state machines and computationally complete query languages". Microsoft Research Technical Report MSR-TR-99-95, December 1999. |
|---|---|
| Summary: | The use of the choiceless polynomial-time variant of ASMs as a query language for relational databases is explored. |
| Subjects: | Databases |
| Download: | PostScript, PDF, Compressed PostScript |
| Notes: | Official version appears in Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, eds., Abstract State Machines: Theory and Applications, Springer LNCS 1912, 2000, 22-33. Also appears in TIK-Report 87, Swiss Federal Institute of Technology (ETH) Zurich, March 2000, 40--65. |
[an error occurred while processing this directive]
URL:
http://web.eecs.umich.edu/gasm/papers/query.html (page only)
last update: Wednesday, 14-Aug-2013 18:19:19 EDT