Relational transducers for electronic commerce

Journal of Computer and System Sciences

Volumn 61, Issue 2, 2000, Pages 236-269

  Abiteboul, Serge ^a   Vianu, Victor ^b   Fordham, Brad ^c   Yesha, Yelena ^d  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c ORACLE CORPORATION   (United States)

^d NASA GODDARD SPACE FLIGHT CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; INFORMATION SCIENCE; LINGUISTICS; RELATIONAL DATABASE SYSTEMS; WORLD WIDE WEB;

RELATIONAL TRANSDUCERS; SPOCUS TRANSDUCERS;

ELECTRONIC COMMERCE;

EID: 0034294212     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1708     Document Type: Article

References (22)

1. Abiteboul S., Duschka O. Complexity of answering queries using materialized views. Proc. ACM Symp. on Principles of Database Systems. 1998;. p. 254-263.
2. Abiteboul S., Hull R., Vianu V. Foundations of Databases. 1995;Addison-Wesley, Reading.
3. Börger E., Grädel E., Gurevich Y. The Classical Decision Problem. 1997;Springer-Verlag, Berlin.
4. Bernays P., Schönfinkel M. Zum Entscheidungsproblem der mathematischen Logik. Math. Ann. 99:1928;342-372.
5. Chandra A. K., Vardi M. Y. The implication problem for functional and inclusion dependencies is undecidable. SIAM J. Comput. 14:1985;671-677.
6. Emerson E. A. Temporal and modal logic. Van Leeuwen J. Handbook of Theoretical Computer Science. 1991;997-1072 Elsevier, Amsterdam.
7. B. Fordham, S. Abiteboul, and, Y. Yesha, Evolving databases: An application to electronic commerce, in, International Database Engineering and Applications Symposium (IDEAS), Montreal, 1977.
8. Gurevich Y. Börger E. Evolving Algebras 1993: Lipari Guide, Specification and Validation Methods. 1994;Oxford University Press, Oxford.
9. Hull R., Llirbat F., Simon E., Su J., Dong G., Kumar B., Zhou G. Declarative workflows that support easy modification and dynamic browsing. Int'l. Joint conference on Work Activities Coordination and Collaboration (WACC), San Francisco. 1999;. p. 69-78.
10. Lewis H. Complexity results for classes of quantificational formulas. J. comput. System Sci. 21:1980;317-353.
11. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science. 92:1980;Springer-Verlag, Berlin/New York.
12. Milner R. Van Leeuwen J. Handbook of Theoretical Computer Science. Operational and algebraic semantics of concurrent processes. 1991;1201-1242 Elsevier, Amsterdam.
13. Mitchell J. C. Inference rules for functional and inclusion dependencies. Proc. ACM Symp. on Principles of Database Systems. 1983;. p. 58-69.
14. Park D. Concurrency and automata on infinite sequences. Theoret. Comput. Sci. 104:1981;167-183.
15. Picouet P., Vianu V. Semantics and expressiveness issues in active databases. J. Comput. System Sci. 57:1998;325-355.
16. Ramsey F. On a problem in formal logic. Proc. London Math. Soc. (2(. 30:1930;264-286.
17. Reisig W. Petri nets. EACTS Monograph on Theoretical Computer Science. 1983;Springer-Verlag, Berlin.
18. Stonebraker M., Rowe L. The design of Postgres. Proc. AMC SIGMOD Int'l. Conf. on the Management of Data. 1986;. p. 340-355.
19. Ullman J. D. Bottom-up beats top-down for datalog. Proc. ACM Symp. on Principles of Database Systems. 1989;. p. 140-149.
20. Widom J., Ceri S. Active Database Systems: Triggers and Rules for Advanced Database Processing. 1995;Morgan-Kaufmann, San Francisco.
21. Data Engineering Bull. 16:1993.
22. Yesha Y., Adam N. Electronic commerce: an overview. Adam N., Yesha Y. Electronic commerce. Lecture Notes in Computer Science. 1996;Springer-Verlag, Berlin/New York.