Expressiveness and complexity of generic graph machines

Theory of Computing Systems

Volumn 31, Issue 3, 1998, Pages 231-249

  Gemis, M ^a   Paredaens, J ^a   Peelman, P ^a   Van Den Bussche, J ^a,b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

COMPUTATION MODEL; GENERIC COMPLEXITY; GRAPH MACHINE; GRAPH STRUCTURES; INPUT-OUTPUT;

TURING MACHINES;

EID: 0039449548     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000087     Document Type: Article

References (16)

1. S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In J. Clifford, B. Lindsay, and D. Maier, editors. Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, volume 18:2 of SIGMOD Record, pages 159-173. ACM Press, New York, 1989.
2. S. Abiteboul and V. Vianu. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41(2):181-229, 1990.
3. S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 209-219, 1991.
4. A.V. Aho and J.D. Ullman. Universality of data retrieval languages. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 110-120, 1979.
5. M. Andries, M. Gemis, J. Paredaens, I. Thyssens, and J. Van den Bussche. Concepts for graph-oriented object manipulation. In A. Pirotte, C. Delobel, and G. Gottlob, editors, Advances in Database Technology - EDBT '92, volume 580 of Lecture Notes in Computer Science, pages 21-38. Springer-Verlag, Berlin, 1992.
6. M. Andries and J. Paredaens. On instance-completeness of database query languages involving object creation. Journal of Computer and System Sciences, 52(2):357-373, 1996.
7. F. Bancilhon. On the completeness of query languages for relational data bases. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science, volume 64 of Lecture Notes in Computer Science, pages 112-123. Springer-Verlag, Berlin, 1978.
8. A. Chandra and D. Harel. Computable queries for relational data bases. Journal of Computer and System Sciences, 21(2):156-178, 1980.
9. K. Denninghoff and V. Vianu. The power of methods with parallel semantics. In Proceedings of the 17th International Conference on Very Large Data Bases, pages 221-232, 1991.
10. M. Gemis, P. Peelman, J. Paredaens, and J. Van den Bussche. A computational model for generic graph functions. In H.J. Schneider and H. Ehrig, editors, Graph Transformations in Computer Science, volume 776 of Lecture Notes in Computer Science, pages 170-187. Springer-Verlag, Berlin, 1994.
11. M. Gyssens, J. Paredaens, J. Van den Bussche, and D. Van Gucht. A graph-oriented object database model. IEEE Transactions on Knowledge and Data Engineering, 6(4):572-586, August 1994.
12. R. Hull and C.K. Yap. The format model, a theory of database organization. Journal of the Association for Computing Machinery, 31(3):518-537, 1984.
13. H.T. Kung. Why systolic architectures? Computer, 15(1):37-46, 1982.
14. J. Paredaens. On the expressive power of the relational algebra. Information Processing Letters, 7(2):107-111, 1978.
15. J. Van den Bussche. Formal aspects of object identity in database manipulation. Doctor's thesis, University of Antwerp (UIA), 1993.
16. J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the completeness of object-creating database transformation languages. Journal of the ACM, 44(2):272-319, 1997.