Relationale Datenbanken - Relationenorientierte Programmierung (2)

  • Herbert Stoyan
Chapter
Part of the Studienreihe Informatik book series (STUDIENREIHE)

Zusammenfassung

Im vorigen Kapitel hatten wir gesehen, daß man durch Verarbeitung von relationalen Ausdrücken interessante Ergebnisse erreichen kann. Nun hatten diese Ausdrücke eine ganz simple Struktur, waren es doch nur Konjunktionen, d.h. durch logisches “und” verknüpfte Literale (dies sind einfache Prädikate mit Term-Argumenten; wir hatten aber nur Variable als Argumente zugelassen). Wenn man mit solch einfachen Ausdrücken soviel erreichen kann, dann sollte man klarzustellen versuchen, was mit Ausdrücken, die Relationen beschreiben, überhaupt berechnet werden kann. Dies ist in der KI bisher noch nicht in ausreichendem Maße geschehen - es gibt aber Ansätze aus dem Datenbankbereich, das Relationenverarbeitungsmodell in die Diskussion zu bringen und relationen-basierte Sprachen für Kl-Probleme einzusetzen.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    J. Adiba: Derived Relations - A Unified Mechanism for Views, Snapshots, and Distributed Data. Proc. 7th Intl. Conf. VLDB 1981Google Scholar
  2. [2]
    A.V. Aho, J.D. Ullman: Universality of Data Retrieval Languages. 6.P0PL, ACM, 1979Google Scholar
  3. A.H. Aho, C. Beeri, J. Ullman: The Theory of Joins in Relational Databases. Proc. 1. IEEE Symp. on Foundations of Computer ScienceGoogle Scholar
  4. [4]
    L. Aiello, C. Cecchi: Adding a Closure Operator to the Extended Relational Algebra - A Further Step Towards the Integration of Data Base Techniques and Logic Progranmiing. Proc. Workshop on KBMS, Crete, 1985Google Scholar
  5. [5]
    A.V. Aho, Y. Sagiv, J.D. Ullman: Equivalence of Relational Expressions. SIAM J. Comput., Vol. 8 (1979), No. 2, S. 218–246MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    A.V. Aho, Y. Sagiv, J.D. Ullman: Efficient Optimization of a Class of Relational Expressions. ACM ToDS, Vol. 4 (1979), No. 4, S. 435–454CrossRefGoogle Scholar
  7. [7]
    S. Alagic: relational Database Technology. Springer, New York etc., 1986MATHCrossRefGoogle Scholar
  8. [8]
    W. Ash, E.H. Sibley: TRAMP - An Interpretive Associative Processor with Deductive Capabihties. In: Proc. ACM 23rd Nat. Conf., Brandon Systems Press, Princeton, 1968, S. 143–156Google Scholar
  9. [9]
    M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin, K.P. Eswaran, J.N. Gray, P.P. Griffiths, W.F. King, R.A. Lorie, P.R. McJones, J.W. Mehl, G.R. Putzolu, I.L. Traiger, B.W. Wade, V. Watson: System R - Relational Approach to Database Management. ACM ToDS, Vol. 1 (1976), No.2Google Scholar
  10. [10]
    M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin, J.N. Gray, W.F. King, B.C. Lindsay, R.A. Lorie, J.W. Mehl, T.G. Price, G.R. Putzolu, P.G. Selinger, M. Schkolnik, D.R. Slutz, I.L. Traiger, B.W. Wade, R.A. Yost: A History and Evaluation of System R. IBM Res. Rep. RJ2843 (36129), San Jose, 1980 (Comm. ACM, Vol. 24 (1981), No. 10, S. 633–644)Google Scholar
  11. [11]
    M.M. Astrahan, D.D. Chamberhn: Implementation of a Structured Enghsh Query Language. Comm. ACM Vol. 18(1975), No.10Google Scholar
  12. [12]
    J. Baibin, K. Ramamohanarao: A Differential Approach to Query Optimization in Recursive Deductive Databases. Univ. of Melbourne, Dept. of Comp. Sci., Tech. Rep. 86/7, Melbourne, 1986Google Scholar
  13. [13]
    F. Bancilhon: On the Completeness of Query Languages for Relational Databases. Proc. 7th MFCS, LNCS, Springer, Berlin etc., 1978Google Scholar
  14. [14]
    F. Bancilhon, R. Ramakrishan: An Amateurs Introduction to Recursive Query Processing Strategies. Proc. ACM SIGMOD, Washington, 1986Google Scholar
  15. [15]
    R. Bayer: Database Technology for Expert Systems. GI-Kongreß 1985 Wissensbasierte Systeme. IFB 112, Springer, Berlin etc., 1985Google Scholar
  16. [16]
    R. Bayer: Query Evaluation and Recursion in Deductive Database Systems. TU München, Institut f. Informatik, Rep. No. TUM-I8503, München, 1985Google Scholar
  17. [17]
    R. Bayer, K. Güntzer, W. Kiessling, J.K. Obermaier, W. Strauss: Deduktions- und Datenbankunterstützung für Expertensysteme. GI-Konferenz BTW’87, Darmstadt, 1987Google Scholar
  18. [18]
    C.J. Bell: A Relational Model for Information Retrieval and the Processing of Linguistic Data. IBM Res.Rep. RC1705, Yorktown Heights, 1966Google Scholar
  19. [19]
    W. Benn: Dynamische nicht-normalisierte Relationen und symbolische Bildbeschreibung. Springer IFB 128, Berlin etc., 1986MATHCrossRefGoogle Scholar
  20. [20]
    H. Biskup: A Foundation of Codds Relational Maybe-Operations. ToDS, Vol. 8 (1983), No. 4, S. 608–636MathSciNetMATHCrossRefGoogle Scholar
  21. [21]
    M.W. Blasgen, K.P. Eswaran: On the Evalutaion of Queries in a Relational Data Base System. IBM Res.Rep., RJ 1745, San Jose, 1976Google Scholar
  22. [22]
    J. Bocca: EDUCE - A Marriage of Convenience - PROLOG and a Relational DBMS. Proc. Symp. on Logic Programming. Salt Lake City, 1986Google Scholar
  23. [23]
    G. Bracchi, A. Fedeli, P. Paolini: A Relational Data Base Management System. Int. Rep. No. 72–5, Lab. di Calcolatori, Instituto di Elettrotecnica ed Elettronica, Polytechnico di Milano, 1972Google Scholar
  24. M. Brodie, M. Jarke: Logic Progranmiing and Databstses. l.Intl. Worksh. Exp. Database Systems, IIMTP, University of South Carolina, Columbia, SC 29208Google Scholar
  25. [25]
    U.S. Chakravarthy, D.H. Fishman, J. Minker: Semantic Query Optimization in Expert Systems and Database Systems. Proc. First Intl. Workshop on Expert Database Systems. Kiawah Island, 1984Google Scholar
  26. [26]
    D.D. Chamberlin, M.M. Astrahan, K.P. Eswaran, P.P. Griffiths, R.A. Lorie, J.W. Mehl, P. Reiser, B.W. Wade: SEQUEL2 - An Unified Approach to Data Definition, Manipulation, and Control. IBM Res. Rep. RJ 1798, San Jose, 1976 IBM Journ. of Res. and Devel., Vol.20(1976), S. 560–575MATHGoogle Scholar
  27. [27]
    D.D. Chamberlin, R.F. Boyce: SEQUEL - A Structured English Query Language. Proc. ACM-SIGFIDET Workshop, Ann Arbor, 1974Google Scholar
  28. [28]
    A.K. Chandra, D. Harel: Computable Queries for Relational Databases. Proc. llth Annual ACM Symposium on the Theory of Computing, 1979Google Scholar
  29. [29]
    A.K. Chandra, P.M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Databases. Proc. 9th Annual ACM Symposium on the Theory of Computing, 1976Google Scholar
  30. [30]
    C. Chang: On Evaluation of Queries Containing Derived Relations in a Relational Database. In: H. Gallaire, J. Minker, J.-M. Nicolas (eds.): Advances in Databases, Vol. 1, 1981Google Scholar
  31. [48]
    S.M. Deen: A Relational Language with Deductions, Functions and Recursions. Date & Knowledge Engineering. Vol. 1 (1985), North Holland, S. 139–154CrossRefGoogle Scholar
  32. [49]
    P. Dell’Orco, V.N. Spadavecchio, M. King: Using Knowledge of a Data Base Wolrd in Interpreting Natural Language Queries. Proc. 1977 IFIP Congress, North Holland, Amsterdam, 1977, S. 139–144Google Scholar
  33. [50]
    M.H. van Emden: Quantitative Deduction and its Fixpoint Theory. Journ. of Logic Programming, Vol. 1(1986), No. 1, S. 37–53CrossRefGoogle Scholar
  34. [51]
    J.A. Feldman, P.D. Rovner: An Algol-Based Associative Language. Comm.ACM, Vol.12 (1969), No.8, S. 439–449CrossRefGoogle Scholar
  35. J.C. Freytag: A Rule-based View of Query Optimization.Google Scholar
  36. [53]
    J.C. Freytag, N. Goodman: On the Translation of Relational Queries into Iterative Programs. ACM ToDS, Vol. 14 (1989), No. 1, S. 1–27CrossRefGoogle Scholar
  37. [54]
    J.C. Freytag, N. Goodman: Rule-based Translation of Relational Queries into Iterative Programs. ACM-SIGMOD Conference on Management of Data, Washington, 1986Google Scholar
  38. [55]
    A.L. Furtado: Formal Aspects of the Relational Model. Information Systems. Vol. 3 (1978), No. 2, S. 131–140CrossRefGoogle Scholar
  39. [56]
    H. Gallaire, J. Minker, J.-M. Nicolas: Logic and Databases - A Deductive Approach. ACM Computing Surveys, Vol. 16 (1984), No. 2, S. 153–186MathSciNetMATHCrossRefGoogle Scholar
  40. [57]
    R.C. Goldstein, A.L. Strnad: The MacAIMS Data Management System. 1970 ACM SICFIDET Workshop on Data Description and Access, Houston, 1970Google Scholar
  41. [58]
    L. Gottlieb: Computing Joins of Relations. Proc. ACM SIGMOD Conference, San Jose, 1975Google Scholar
  42. [59]
    G. Graefe, D.J. DeWitt: The Exodus Optimizer Generator. ACM-SIGMOD Conference on Management of Data, San Francisco, 1987 (SIGMOD Record. Vol. 16 (1987), No. 3)Google Scholar
  43. [60]
    M.H. Graham, A.O. Mendelzon: Strong Equivalence of Relational Expressions under Dependencies. Inf. Proc. Letters, Vol. 14 (1982), No. 2, S. 57–62MATHCrossRefGoogle Scholar
  44. [61]
    D. Greenblatt, J. Waxman: A Study of Three Database Query Languages. In: B. Shneiderman (ed.): Databctses - Improving Usability and Responsiveness. Academic Press, New York, 1978Google Scholar
  45. [62]
    P.P. Griffiths, M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, T.G. Price: Access Path Selection in a Relational Database Management System. IBM Res. Rep. RJ2429, San Jose, 1979Google Scholar
  46. [63]
    R.W. Grossman: Some Data Base Applications of Constraint Expressions. MIT Lab.Comp.Sci, TR 158, Cambridge, 1976Google Scholar
  47. [64]
    U. Güntzer, W. Kiessling, R. Bayer: Evaluation Paradigms for Deductive Databases - From Systolic to As-You-Please. TU München, Institut f. Informatik, Rep. No. TUM-I8605, München, 1986Google Scholar
  48. [65]
    U. Güntzer, W. Kiessling, R. Bayer: On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration. TU München, Institut f. Informatik, Rep. No. TUM-I8603, München, 1986Google Scholar
  49. [66]
    U. Güntzer, R. Bayer: Control for Iterative Evaluation of Recursive Rules in Database Systems. TU München, Institut f. Informatik, Rep. No. TUM-18513, München, 1985Google Scholar
  50. [67]
    L.M. Haas, J.C. Freytag, G.M. Lohman, H. Pirahesh: Extensible Query Processing in Starburst. ACM-SIGMOD Conference on Management of Data, Portland, 1989 (SIGMOD Record, Vol. 18(1989), No. 2)Google Scholar
  51. [68]
    P.A.V. Hall: Optimization of a Single Relational Expression in a Relational Database. IBM UK Scientific Centre Report, UKSC 0076, June 1975 (IBM Journal of Research, Vol. 20 (1976), No. 3, S. 244–257)MATHGoogle Scholar
  52. [69]
    M. Hanmier, S.B. Zdonik: Knowledge Based Query Processing. Proc. 6th Intl. Conf. VLDB, 1980Google Scholar
  53. [70]
    W. Hasen, H. Pirahesh: A Rule System for Query Rewrite Optimization in Starburst. IBM Res. Rep. RJ6367, San Jose, 1988Google Scholar
  54. [71]
    T. Härder: Implementing a Generalized Access Path Structure for a Relational Data Base System. ACM ToDS, Vol. 3 (1978), No. 3, S. 285–298CrossRefGoogle Scholar
  55. [72]
    T. Härder: Implementierung von Datenbanksystemen. Hanser, München, Wien, 1978MATHGoogle Scholar
  56. [73]
    J. Heigert: Effiziente Algorithmen für relationale Datenbanksysteme mit Rekursion. TU München, Dissertation TUM-I8613, München, 1986MATHGoogle Scholar
  57. [74]
    G.D. Held, M.R. Stonebraker, E. Wong: INGRES - A Relational Data Base System. Proc. AFIPS National Computer Conference, Anaheim, 1975Google Scholar
  58. [75]
    L.J. Henschen, S.A. Naqvi: Compiling Queries in Recursive First-Order Databases. Journal ACM, Vol. 31(1984), No. 1, S. 47–85MathSciNetMATHCrossRefGoogle Scholar
  59. [76]
    B.E. Jacobs: On Queries Definable in Database Structures. TR 757, Dept. of Computer Science, University of Maryland, 1979Google Scholar
  60. [77]
    M. Jarke: Common Subexpression Isolation in Multiple Query Optimization. In: Kim etal. (eds.): Query Processing in Database Systems. Springer, Berlin etc., 1985Google Scholar
  61. [78]
    M. Jarke: External Semantic Query Simplification - A Graph-Theoretic Approach and its Implementation in PROLOG. Proc. First Intl. Workshop on Expert Database Systems. 1984Google Scholar
  62. [79]
    M. Jarke, J. Koch: Query Optimization in Database Systems. ACM Computing Surveys, Vol. 16 (1984), No. 2, S. 111–152MathSciNetMATHCrossRefGoogle Scholar
  63. [80]
    M. Jarke, C. Clifford, Y. Vassiliou: An Optimizing PROLOG Front-End to a Relational Query System. Proc. ACM SIGMOD 1984Google Scholar
  64. [81]
    D.E. Jordan: Implementing Production Systems with Relational Data Bases. Proc. ACM Pacific Conf., San Francisco, 1975Google Scholar
  65. [82]
    W. Kiessling: Datenbanksysteme für Rechenanlagen mit intelligenten Subsystemen - Architektur, Algorithmen, Optimierung. TU München, Dissertation TUM-I83007, München, 1983Google Scholar
  66. [83]
    W. Kiessling, H. Schmidt: Towards AI/DB Integration - Relational and Logic Programming Extensions to CommonLISP. AI Europa, 1987Google Scholar
  67. [84]
    J.J. King: QUIST - A System for Semantic Query Optimization in Relational Databases. 7th Intl. Conf. VLDB, Sept. 1981, S. 272–281Google Scholar
  68. [85]
    J.L. Kuhns: Answering Questions by Computer - A Logical Study. Rand Corp., RM-5428-pr, Santa Monica, 1967Google Scholar
  69. [86]
    M. Lacroix, A. Pirotte: Generalized Joins. SIGMOD Record, Vol. 8 (1976), No. 3, S. 14–15CrossRefGoogle Scholar
  70. [87]
    E. Lehmann: ISAR - Ein experimentelles deutschsprachliches Faktenabfragesystem. In: J.W. Schmidt: Sprachen für Datenbanken. Gl Jahrestagung, Okt. 1983 Hamburg, Springer IFB 72, Berlin etc., 1983Google Scholar
  71. [88]
    R.E. Levin, M.E. Maron: A Computer System for Inference Calculus Execution and Data Retrieval. Comm. ACM, Vol. 10(1967), No. 11, S. 715–721CrossRefGoogle Scholar
  72. [89]
    V. Linnemann, J.W. Schnudt, M. Jarke: Integrated Fact and Rule Management Based on Relational Technology. Proc. Workshop on KBMS, Crete, 1985Google Scholar
  73. [90]
    W. Lipsky Jr.: On Databases with Incomplete Information. Unpubl. Memorandum, University of Illinois, 1978Google Scholar
  74. [91]
    P.C. Lockemann, J.W. Schmidt (Hrsg.): Datenbank-Handbuch. Springer, Berlin etc., 1987MATHCrossRefGoogle Scholar
  75. [92]
    P. Lorenzen: Differential und Integral. Akad. Verlagsgesellschaft, Frankfurt/M., 1965Google Scholar
  76. [93]
    D. Maier: The Theory of Relational Databases. Computer Science Press, Rockville, 1983MATHGoogle Scholar
  77. [94]
    J. Minker: Performing Inferences over Relational Databases. TR363, Departement of Computer Science, University of Maryland, 1975Google Scholar
  78. [95]
    S. Naqvi, L.J. Henschen: Synthesizing Least Fixed Point Queries into Non-recursive Iterative Programs. Proc. 8th IJCAI 1983Google Scholar
  79. [96]
    M.G. Notley: The Peterlee IS/1 System. IBM Sci. Rep. UKSC-0018, London, 1972Google Scholar
  80. [97]
    T.W. Olle: A Non-procedural Language for Retrieving Information from Data Bases. IFIP Congress Edinburgh 1968, North Holland, Amsterdam, 1968Google Scholar
  81. [98]
    F.F. Palermo: A Database Search Problem. In: J.T. Tou (ed.): Information Systems COINS IV, Plenum Press, New York, 1974Google Scholar
  82. [99]
    J. Paredaens: On the Expressive Power of Relational Algebra. Information Processing Letters, Vol. 7 (1978), No. 2, S. 107–111MathSciNetMATHCrossRefGoogle Scholar
  83. [100]
    R.M. Pecherer: Efficient Evaluation of Expressions in a Relational Algebra. Proc. ACM Pacific Conference, 1975, S. 44–49Google Scholar
  84. [101]
    A. Pirotte: High Level Data Base Query Languages. In: H. Gallaire, J. Minker (eds.): Logic and Databases. Plenum Press, New York, 1978, S. 409–436Google Scholar
  85. [102]
    P. Reisner: Use of Psychological Experimentation as an Aid to Development of a Query Language. IBM Res. Rep. RJ1707, San Jose, 1976Google Scholar
  86. [103]
    P. Reisner, R.F. Boyce, D.D. Chamberlin: Human Factors Evaluation of Two Database Query Languages - SQUARE and SEQUEL. Proc. AFIPS National Computer Conference, Anaheim, 1975Google Scholar
  87. [104]
    J. Rissanen, C. Delobel: Decomposition of Files - A Basis for Data Storage and Retrieval. IBM Rep., San Jose, 1971Google Scholar
  88. [105]
    A. Rosenthal, D. Reiner: An Architecture for Query Optimization. ACM-SIGMOD Conference on Management of Data, Orlando, 1982Google Scholar
  89. [106]
    Y. Sagiv, M. Yannakakis: Equivalence among Relational Expressions with the Union and Difference Operators. Journal ACM, Vol. 27 (1980), No. 4, S. 633–655MathSciNetMATHCrossRefGoogle Scholar
  90. [107]
    H.A. Schmid, J.R. Swenson: On the Semantics of the Relational Model. ACM-SIGMOD International Symposim on Management of Data, 1979Google Scholar
  91. [108]
    H. Schmidt, W. Kiessling, U. Güntzer, R. Bayer: Compiling Exploratory or Goal-directed Deduction into Sloppy Delta-Iteration. Proc. Symp. Logic Programming, San Francisco, 1987Google Scholar
  92. [109]
    J.C. Schwabel, B. McCormick: Consistent Properties of Composite Formation Under a Binary Relation. Inform.Sci. Vol.2 (1970), S. 179–209CrossRefGoogle Scholar
  93. [110]
    E. Scoire: Improving Semantic Specification in the Database Relational Model. ACM-SIGMOD International Symposim on Management of Data, 1979Google Scholar
  94. [111]
    J. Smith, P. Chang: Optimizing the Performance of a Relational Algebra Database Interface. Comm. ACM, Vol. 18 (1975), No. 10, S. 568–579MATHCrossRefGoogle Scholar
  95. [112]
    J.M. Smith, D.C.P. Smith: Database Abstractions - Aggregation and Generalization. ACM ToDS, Vol. 2 (1977), No. 2, S. 105–133CrossRefGoogle Scholar
  96. [113]
    M. Stonebraker, L.A. Rowe: The Design of Postgres. Proc. ACM SIGMOD 1986, WashingtonGoogle Scholar
  97. [114]
    M. Stonebraker (ed.): The INGRES-Papers. Addison-Wesley, Reading, etc., 1986Google Scholar
  98. [115]
    M. Stonebraker, E. Wong, P. Kreps, G. Held: The Design and Implementation of INGRES. ACM Trans. on Database Systems, Vol.1 (1976), No.3CrossRefGoogle Scholar
  99. [116]
    S.J.P. Todd: The Peterlee Relational Test Vehicle. IBM Systems J., Vol.15 (1976), No.4Google Scholar
  100. [117]
    J.B. Ullman: Implementations of Logical Query Languages for Databases. ACM ToDS, Vol. 10 (1985), No. 3CrossRefGoogle Scholar
  101. [118]
    J.B. Ullman: Princilples of Database Systems. Computer Science Press, Rockville, 1980Google Scholar
  102. [119]
    Y. Vassiliou: Null Values in Database Management - A Denotational Semantics Approach. ACM/SIGMOD International Symposium on Management of Data. 1979Google Scholar
  103. [120]
    D.H.D. Warren: Efficient Processing of Interactive Relational Database Queries in Logic. 7th Intl. Conf. VLDB, Sept. 1981, S. 272–281Google Scholar
  104. [121]
    H. Wedekind: Nullwerte in Datenbanken aus modallogischer Sicht. Gl-Softwaretechnik-Trends. Mitteilungen der Fachgruppe “Software-Engineering”, Heft 3–3, Dezember 1983, S. 44–55Google Scholar
  105. [122]
    H. Wedekind: Stand der Entwicklung von Datenbanken. In: J. Nagler-Breitenbach, H. Schauer (Hrsg.): Datenbanksysteme. Physica Verl., Wien-Würzburg, 1977Google Scholar
  106. [123]
    V.K.M. Whitney: RDMS - A Relational Data Management System. Proc. 4th Int. Symp. on Comput. and Inform. Sciences Miami, Plenum Press, 1972Google Scholar
  107. [124]
    E. Wong, K. Youssefi: Decomposition - A Strategy for Query Processing. ACM ToDS, Vol. 1 (1976), No. 3, S. 223–241CrossRefGoogle Scholar
  108. [125]
    S.B. Yao: Optimization of Query Evaluation Algorithms. ACM ToDS, Vol. 4 (1979), No. 2, S. 133–155CrossRefGoogle Scholar
  109. [126]
    C. Zaniolo: PROLOG - A Database Query Language for All Seasons. l.Intl. Worksh. Exp. Database Systems, IIMTP, University of South Carolina, Columbia, SC 29208, 198?Google Scholar
  110. C. Zaniolo: Relational Views in a Database System Support for Queries. Proc. IEEE COMPSAC 77Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Herbert Stoyan
    • 1
  1. 1.Institut für Mathematische Maschinen und Datenverarbeitung (IMMD) VIIIUniversität Erlangen-NürnbergErlangenDeutschland

Personalised recommendations