The Universality of Data Retrieval Languages.

@inproceedings{DBLP:conf/popl/AhoU79,
  author    = {Alfred V. Aho and
               Jeffrey D. Ullman},
  title     = {The Universality of Data Retrieval Languages},
  booktitle = {POPL},
  year      = {1979},
  pages     = {110-120},
  ee        = {db/conf/popl/AhoU79.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1979 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

POPL Proceedings Compendium

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/Popl or /cdrom

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An4-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Printed Edition

References

[AHU]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX

[ASU]

Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979) BibTeX

[B]

...

[C1]

E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX

[C2]

E. F. Codd: Relational Completeness of Data Base Sublanguages. In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972) BibTeX

[Ch]

...

[CM]

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 BibTeX

[D]

C. J. Date: An Introduction to Database Systems. Addison-Wesley 1975, ISBN 0-201-14452-2
BibTeX

[HU]

...

[P]

Jan Paredaens: On the Expressive Power of the Relational Algebra. Inf. Process. Lett. 7(2): 107-111(1978) BibTeX

[S]

Claus-Peter Schnorr: An Algorithm for Transitive Closure with Linear Expected Time. SIAM J. Comput. 7(2): 127-133(1978) BibTeX

[SC]

John Miles Smith, Philip Yen-Tang Chang: Optimizing the Performance of a Relational Algebra Database Interface. Commun. ACM 18(10): 568-579(1975) BibTeX

[SY]

Yehoshua Sagiv, Mihalis Yannakakis: Equivalence among Relational Expressions with the Union and Difference Operation. VLDB 1978: 535-548 BibTeX

[T]

...

[Z]

Moshé M. Zloof: Query-by-Example: A Data Base Language. IBM Systems Journal 16(4): 324-343(1977) BibTeX

Referenced by

1. Leonid Libkin: Expressive Power of SQL. ICDT 2001: 1-21
2. Guozhu Dong, Jianwen Su: Incremental Maintenance of Recursive Views Using Relational Calculus/SQL. SIGMOD Record 29(1): 44-51(2000)
3. Evgeny Dantsin, Andrei Voronkov: Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS 2000: 157-165
4. Richard T. Snodgrass: Reminiscences on Influential Papers. SIGMOD Record 28(3): 43-48(1999)
5. Stavros S. Cosmadakis: Inherent Complexity of Recursive Queries (Extended Abstract). PODS 1999: 148-154
6. Lejla Rovcanin, John Murphy: Formal Specification of a Safe ALGEBRA - ``A''. ADBIS (Short Papers) 1999: 214-220
7. Marco Cadoli, Thomas Eiter, Georg Gottlob: Default Logic as a Query Language. IEEE Trans. Knowl. Data Eng. 9(3): 448-463(1997)
8. Leonid Libkin, Limsoon Wong: Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions. DBPL 1997: 222-238
9. Leonid Libkin, Limsoon Wong: On the Power of Aggregation in Relational Query Languages. DBPL 1997: 260-280
10. Catriel Beeri, Tova Milo, Paula Ta-Shma: Towards a Language for the Fully Generic Queries. DBPL 1997: 239-259
11. Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan: Magic Conditions. ACM Trans. Database Syst. 21(1): 107-155(1996)
12. Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong: Relational Expressive Power of Constraint Query Languages. PODS 1996: 5-16
13. Catriel Beeri, Tova Milo, Paula Ta-Shma: On Genericity and Parametricity. PODS 1996: 104-116
14. Serge Abiteboul, Catriel Beeri: The Power of Languages for the Manipulation of Complex Values. VLDB J. 4(4): 727-794(1995)
15. Weidong Chen: Declarative Updates of Relational Databases. ACM Trans. Database Syst. 20(1): 42-70(1995)
16. Jan Paredaens, Peter Peelman, Letizia Tanca: G-Log: A Graph-Based Query Language. IEEE Trans. Knowl. Data Eng. 7(3): 436-453(1995)
17. Sang Ho Lee, Lawrence J. Henschen: Evaluation of Recursive Queries with Extended Rules in Deductive Databases. IEEE Trans. Knowl. Data Eng. 7(2): 328-331(1995)
18. Phokion G. Kolaitis: Combinatorial Games In Database Theory. PODS 1995: 231-232
19. Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van den Bussche: Applying an Update Method to a Set of Receivers. PODS 1995: 208-218
20. Phokion G. Kolaitis: Languages for Polynomial-Time Queries - An Ongoing Quest. ICDT 1995: 38-39
21. Serge Abiteboul, Gerd G. Hillebrand: Space Usage in Functional Query Languages. ICDT 1995: 439-454
22. Guozhu Dong, Leonid Libkin, Limsoon Wong: On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL. DBPL 1995: 7
23. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
24. James Clifford, Albert Croker, Alexander Tuzhilin: On Completeness of Historical Relational Query Languages. ACM Trans. Database Syst. 19(1): 64-116(1994)
25. Ke Wang, Li-Yan Yuan: First-Order Logic Characterization of Program Properties. IEEE Trans. Knowl. Data Eng. 6(4): 518-533(1994)
26. Keh-Chang Guh, Clement T. Yu: Efficient Query Processing for a Subset of Linear Recursive Binary Rules. IEEE Trans. Knowl. Data Eng. 6(5): 842-849(1994)
27. Dan Suciu, Jan Paredaens: Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure. PODS 1994: 201-209
28. Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht: Towards a Theory of Spatial Database Queries. PODS 1994: 279-288
29. David Harel: Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). PODS 1994: 1-3
30. Stéphane Grumbach, Jianwen Su: Finitely Representable Databases. PODS 1994: 289-300
31. Surajit Chaudhuri, Moshe Y. Vardi: On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs. PODS 1994: 107-116
32. Surajit Chaudhuri, Phokion G. Kolaitis: Can Datalog be Approximated? PODS 1994: 86-96
33. Gabriel M. Kuper, Moshe Y. Vardi: The Logical Data Model. ACM Trans. Database Syst. 18(3): 379-413(1993)
34. Shaul Dar, Rakesh Agrawal: Extending SQL with Generalized Transitive Closure Functionality. IEEE Trans. Knowl. Data Eng. 5(5): 799-812(1993)
35. Alfs T. Berztiss: The Query Language Vizla. IEEE Trans. Knowl. Data Eng. 5(5): 813-825(1993)
36. Rafiul Ahad, Bing Yao: RQL: A Recursive Query Language. IEEE Trans. Knowl. Data Eng. 5(3): 451-461(1993)
37. Surajit Chaudhuri: Finding Nonrecursive Envelopes for Datalog Predicates. PODS 1993: 135-146
38. Guozhu Dong, Jianwen Su: First-Order Incremental Evaluation of Datalog Queries. DBPL 1993: 295-308
39. Jan Paredaens, Dirk Van Gucht: Converting Nested Algebra Expressions into Flat Algebra Expressions. ACM Trans. Database Syst. 17(1): 65-93(1992)
40. Keh-Chang Guh, Clement T. Yu: Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments. IEEE Trans. Knowl. Data Eng. 4(4): 371-381(1992)
41. Håkan Jakobsson: On Tree-Based Techniques for Query Evaluation. PODS 1992: 380-392
42. Guozhu Dong: Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations. PODS 1992: 81-90
43. Surajit Chaudhuri, Moshe Y. Vardi: On the Equivalence of Recursive and Nonrecursive Datalog Programs. PODS 1992: 55-66
44. Jan Van den Bussche, Dirk Van Gucht: A Hierarchy of Faithful Set Creation in Pure OODB's. ICDT 1992: 326-340
45. Richard Hull, Dean Jacobs: Language Constructs for Programming Active Databases. VLDB 1991: 455-467
46. Karl Denninghoff, Victor Vianu: The Power of Methods With Parallel Semantics. VLDB 1991: 221-232
47. Yuh-Ming Shyy, Stanley Y. W. Su: K: A High-Level Knowledge Base Programming Language for Advanced Database Applications. SIGMOD Conference 1991: 338-347
48. Inderpal Singh Mumick, Hamid Pirahesh: Overbound and Right-Linear Queries. PODS 1991: 127-141
49. Neil Immerman, Sushant Patnaik, David W. Stemple: The Expressiveness of a Family of Finite Set Languages. PODS 1991: 37-52
50. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. PODS 1991: 13-25
51. Ke Wang, Li-Yan Yuan: First-Order Logic Reducible Programs. ICDE 1991: 746-755
52. Keh-Chang Guh, Chengyu Sun, Clement T. Yu: Real Time Retrieval and Update of Materialized Transitive Closure. ICDE 1991: 690-697
53. Sumit Ganguly, Ravi Krishnamurthy, Abraham Silberschatz: An Analysis Technique for Transitive Closure Algorithms: A Statistical Approach. ICDE 1991: 728-735
54. Béatrice Finance, Georges Gardarin: A Rule-Based Query Rewriter in an Extensible DBMS. ICDE 1991: 248-256
55. Shaul Dar, Rakesh Agrawal, H. V. Jagadish: Optimization of Generalized Transitive Closure Queries. ICDE 1991: 345-354
56. Val Tannen, Peter Buneman, Shamim A. Naqvi: Structural Recursion as a Query Language. DBPL 1991: 9-19
57. Sang Ho Lee, Lawrence J. Henschen: Evaluation of Extended Recursive Queries in Deductive Databases. DASFAA 1991: 209-215
58. Michael Kifer, Eliezer L. Lozinskii: On Compile-Time Query Optimization in Deductive Databases by Means of Static Filtering. ACM Trans. Database Syst. 15(3): 385-426(1990)
59. Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Direct Transitive Closure Algorithms: Design and Performance Evaluation. ACM Trans. Database Syst. 15(3): 427-458(1990)
60. Michael V. Mannino, Leonard D. Shapiro: Extensions to Query Languages for Graph Traversal Problems. IEEE Trans. Knowl. Data Eng. 2(3): 353-363(1990)
61. Johann Eder: Extending SQL with General Transitive Closure and Extreme Value Selections. IEEE Trans. Knowl. Data Eng. 2(4): 381-390(1990)
62. Danette Chimenti, Ruben Gamboa, Ravi Krishnamurthy, Shamim A. Naqvi, Shalom Tsur, Carlo Zaniolo: The LDL System Prototype. IEEE Trans. Knowl. Data Eng. 2(1): 76-90(1990)
63. Tiziana Catarci, Giuseppe Santucci: GRASP: A Graphical System for Statistical Databases. SSDBM 1990: 148-162
64. Mihalis Yannakakis: Graph-Theoretic Methods in Database Theory. PODS 1990: 230-242
65. John S. Schlipf: The Expressive Powers of the Logic Programming Semantics. PODS 1990: 196-204
66. Thane E. Plambeck: Semigroup Techniques in Recursive Query Optimization. PODS 1990: 145-153
67. Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990: 61-71
68. Mariano P. Consens, Alberto O. Mendelzon: GraphLog: a Visual Formalism for Real Life Recursion. PODS 1990: 404-416
69. Gabriel M. Kuper: On The Expressive Power of the Relational Calculus with Arithmetic Constraints. ICDT 1990: 202-211
70. Bin Jiang: A Suitable Algorithm for Computing Partial Transitive Closures in Databases. ICDE 1990: 264-271
71. Catriel Beeri, Yoram Kornatzky: The Many Faces of Query Monotonicity. EDBT 1990: 120-135
72. Jiawei Han, Wenyu Lu: Asynchronous Chain Recursions. IEEE Trans. Knowl. Data Eng. 1(2): 185-195(1989)
73. Stefano Ceri, Georg Gottlob, Letizia Tanca: What you Always Wanted to Know About Datalog (And Never Dared to Ask). IEEE Trans. Knowl. Data Eng. 1(1): 146-166(1989)
74. Rakesh Agrawal, Premkumar T. Devanbu: Moving Selections into Linear Least Fixpoint Queries. IEEE Trans. Knowl. Data Eng. 1(4): 424-432(1989)
75. Yannis E. Ioannidis: Commutativity and its Role in the Processing of Linear Recursion. VLDB 1989: 155-163
76. Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242
77. Yannis E. Ioannidis, Timos K. Sellis: Conflict Resolution of Rules Assigning Values to Virtual Attributes. SIGMOD Conference 1989: 205-214
78. Rakesh Agrawal, Narain H. Gehani: ODE (Object Database and Environment): The Language and the Data Model. SIGMOD Conference 1989: 36-45
79. Pratul Dublish, S. N. Maheshwari: Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS 1989: 324-335
80. Stavros S. Cosmadakis: On the First-Order Expressibility of Recursive Queries. PODS 1989: 311-323
81. Victor Vianu, Gottfried Vossen: Goal-Oriented Concurrency Control. MFDBS 1989: 398-414
82. Joachim Biskup, Bernhard Convent: Towards a Schema Design Methodology for Deductive Databases. MFDBS 1989: 37-52
83. Nikolaus Steger, Helmut Schmidt, Ulrich Güntzer, Werner Kießling: Semantics and Efficient Compilation for Quantitative Deductive Databases. ICDE 1989: 660-669
84. Isabel F. Cruz, Theodore S. Norvell: Aggregative Closure: An Extension of Transitive Closure. ICDE 1989: 384-391
85. Xiaolei Qian: On the Expressive Power of the Bounded Iteration Construct. DBPL 1989: 411-421
86. Richard Hull, Jianwen Su: On Bulk Data type Constructors and Manipulation Primitives: A Framework for Analyzing Power and Complexity. DBPL 1989: 396-410
87. Rakesh Agrawal, Narain H. Gehani: Rationale for the Design of Persistence and Query Processing Facilities in the Database Programming Language O++. DBPL 1989: 25-40
88. Jiawei Han, Wenyu Lu: Asynchronous Chain Recursions. DASFAA 1989: 285-292
89. Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
    Contents
90. Michel de Rougemont: Fixed-point semantics and the representation of algorithms on large data. VLDB 1988: 264-272
91. Raja Ramnarayan, Hongjun Lu: A Data/Knowledge Base Management Testbed and Experimental Results on Data/Knowledge Base Query and Update Processing. SIGMOD Conference 1988: 387-395
92. Jeffrey F. Naughton: Compiling Separable Recursions. SIGMOD Conference 1988: 312-319
93. Marc Gyssens, Dirk Van Gucht: The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra. SIGMOD Conference 1988: 225-232
94. Moshe Y. Vardi: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries. PODS 1988: 341-351
95. Seppo Sippu, Eljas Soisalon-Soininen: A Generalized Transitive Closure for Relational Queries. PODS 1988: 325-332
96. Raghu Ramakrishnan, Catriel Beeri, Ravi Krishnamurthy: Optimizing Existential Datalog Queries. PODS 1988: 89-102
97. Jan Paredaens, Dirk Van Gucht: Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions. PODS 1988: 29-38
98. Phokion G. Kolaitis, Christos H. Papadimitriou: Why Not Negation by Fixpoint? PODS 1988: 231-239
99. Richard Hull, Jianwen Su: On the Expressive Power of Database Queries with Intermediate Types. PODS 1988: 39-51
100. Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9
101. Serge Abiteboul, Victor Vianu: Procedural and Declarative Database Update Languages. PODS 1988: 240-250
102. Peter T. Wood, Alberto O. Mendelzon, Paolo Atzeni: Idempotent Single-Predicate Horn Clauses. ICDT 1988: 129-143
103. Catriel Beeri: Data Models and Languages for Databases. ICDT 1988: 19-40
104. Serge Abiteboul: Updates, A New Frontier. ICDT 1988: 1-18
105. Seppo Sippu, Eljas Soisalon-Soininen: An Optimization Strategy for Recursive Queries in Logic Databases. ICDE 1988: 470-477
106. Rakesh Agrawal, Premkumar T. Devanbu: Moving Selections into Linear Least Fixpoint Queries. ICDE 1988: 452-461
107. Ravi Krishnamurthy, Carlo Zaniolo: Optimization in a Logic Based Language for Knowledge and Data Intensive Applications. EDBT 1988: 16-33
108. Jiawei Han, Ghassan Z. Qadah, Chinying Chaou: The Processing and Evaluation of Transitive Closure Queries. EDBT 1988: 49-75
109. Stefano Ceri, Stefano Crespi-Reghizzi, Georg Gottlob, F. Lamperti, Luigi Lavazza, Letizia Tanca, Roberto Zicari: The Algres Project. EDBT 1988: 551-555
110. Malcolm P. Atkinson, Peter Buneman: Types and Persistence in Database Programming Languages. ACM Comput. Surv. 19(2): 105-190(1987)
111. Kyu-Young Whang, Shamkant B. Navathe: An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments. VLDB 1987: 275-287
112. Kazimierz Subieta, Wiktor Rzeczkowski: Query Optimization by Stored Queries. VLDB 1987: 369-380
113. Georges Gardarin: Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs. VLDB 1987: 21-30
114. Stefano Ceri, Letizia Tanca: Optimization of Systems of Algebraic Equations for Evaluating Datalog Queries. VLDB 1987: 31-41
115. Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: A Graphical Query Language Supporting Recursion. SIGMOD Conference 1987: 323-330
116. Jeffrey D. Ullman: Database Theory: Past and Future. PODS 1987: 1-10
117. Jeffrey F. Naughton: One-Sided Recursions. PODS 1987: 340-348
118. Gabriel M. Kuper: Logic Programming With Sets. PODS 1987: 11-20
119. Dirk Van Gucht: On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational Model. PODS 1987: 302-312
120. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. PODS 1987: 284-293
121. Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. PODS 1987: 214-226
122. Serge Abiteboul, Victor Vianu: A Transcation Language Complete for Database Update and Specification. PODS 1987: 260-268
123. Joachim Biskup, Uwe Räsch: The Equivalence Problem For Relational Database Schemes. MFDBS 1987: 42-70
124. Hongjun Lu, Krishna P. Mikkilineni, James P. Richardson: Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation. ICDE 1987: 112-119
125. Volker Linnemann: Non First Normal Form Relations and Recursive Queries: An SQL-Based Approach. ICDE 1987: 591-598
126. Michael Kifer, Eliezer L. Lozinskii: Implementing Logic Programs as a Database System. ICDE 1987: 375-385
127. Ulrich Güntzer, Werner Kießling, Rudolf Bayer: On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration. ICDE 1987: 120-129
128. Rakesh Agrawal: Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. ICDE 1987: 580-590
129. Ravi Krishnamurthy, Carlo Zaniolo: Control and Optimization Strategies in the Implementation of LDL. DBPL 1987: 329-345
130. Sylvia L. Osborn, T. E. Heaven: The Design of a Relational Database System with Abstract Data Types for Domains. ACM Trans. Database Syst. 11(3): 357-373(1986)
131. Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411
132. Stefano Ceri, Georg Gottlob, Luigi Lavazza: Translation and Optimization of Logic Queries: The Algebraic Approach. VLDB 1986: 395-402
133. Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola: Traversal Recursion: A Practical Approach to Supporting Recursive Applications. SIGMOD Conference 1986: 166-176
134. Tomasz Imielinski: Query Processing in Deductive Databases with Incomplete Information. SIGMOD Conference 1986: 268-280
135. Allen Van Gelder: A Message Passing Framework for Logical Query Evaluation. SIGMOD Conference 1986: 155-165
136. Georges Gardarin, Christophe de Maindreville: Evaluation of Database Recursive Logic Programs as Recurrent Function Series. SIGMOD Conference 1986: 177-186
137. François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52
138. Moshe Y. Vardi: On the Integrity of Databases with Incomplete Information. PODS 1986: 252-266
139. Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. PODS 1986: 267-279
140. Stavros S. Cosmadakis, Paris C. Kanellakis: Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293
141. Domenico Saccà, Carlo Zaniolo: The Generalized Counting Method for Recursive Logic Queries. ICDT 1986: 31-53
142. Michael Kifer, Eliezer L. Lozinskii: Filtering Data Flow in Deductive Databases. ICDT 1986: 186-202
143. Paris C. Kanellakis: Logic Programming and Parallel Complexity. ICDT 1986: 1-30
144. Haruo Yokota, Sko Sakai, Hidenori Itoh: Deductive Database System based on Unit Resolution. ICDE 1986: 228-235
145. Motomichi Toyama: Parameterized View Definition and Recursive Relations. ICDE 1986: 707-712
146. Volker Linnemann: Constructorset's Database Support for Knowledge Based Systems. ICDE 1986: 244-251
147. Kazimierz Subieta, Marek Missala: Semantics of Query Languages for the Entity-Relationship Model. ER 1986: 197-216
148. Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases. ACM Trans. Database Syst. 10(3): 289-321(1985)
149. Kazimierz Subieta: Semantics of Query Languages for Network Databases. ACM Trans. Database Syst. 10(3): 347-394(1985)
150. Matthias Jarke, Yannis Vassiliou: A Framework for Choosing a Database Query Language. ACM Comput. Surv. 17(3): 313-340(1985)
151. Carlo Zaniolo: The Representation and Deductive Retrieval of Complex Objects. VLDB 1985: 458-469
152. Matthias Jarke, Volker Linnemann, Joachim W. Schmidt: Data Constructors: On the Integration of Rules and Relations. VLDB 1985: 227-240
153. Sandra Heiler, Arnon Rosenthal: G-WHIZ, a Visual Interface for the Functional Model with Recursion. VLDB 1985: 209-218
154. Timos K. Sellis, Leonard D. Shapiro: Optimization of Extended Database Query Languages. SIGMOD Conference 1985: 424-436
155. Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. PODS 1985: 261-275
156. Hervé Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. ACM Comput. Surv. 16(2): 153-185(1984)
157. Arnon Rosenthal, Sandra Heiler, Frank Manola: An Example of Knowledge-Based Query Processing in a CAD/CAM DBMS. VLDB 1984: 363-370
158. Haruo Yokota, Susumu Kunifuji, Takeo Kakuta, Nobuyoshi Miyazaki, Shigeki Shibayama, Kunio Murakami: An Enhanced Inference Mechanism for Generating Relational Algebra Queries. PODS 1984: 229-238
159. Richard Hull: Relative Information Capacity of Simple Relational Database Schemata. PODS 1984: 97-109
160. Marc H. Graham, Moshe Y. Vardi: On the Complexity and Axiomatizability of Consistent Database States. PODS 1984: 281-289
161. Christine Parent, Stefano Spaccapietra: An Entity-Relationship Algebra. ICDE 1984: 500-507
162. Illka Karasalo, Per Svensson: An Overview of Cantor - A New System for Data Analysis. SSDBM 1983: 315-324
163. David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
     Contents
164. Richard Hull, Chee-Keng Yap: The Format Model: A Theory of Database Organization. PODS 1982: 205-211
165. Ashok K. Chandra, David Harel: Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982: 158-163
166. Eric K. Clemons: Design of an External Schema Facility to Define and Process Recursive Structures. ACM Trans. Database Syst. 6(2): 295-311(1981)
167. Hervé Gallaire: Impacts of Logic and Databases (Invited Paper). VLDB 1981: 248-259
168. David Maier, David Scott Warren: Incorporating Computed Relations in Relational Databases. SIGMOD Conference 1981: 176-187
169. Adrian Walker: On Retrieval from a Small Version of a Large Data Base. VLDB 1980: 47-54
170. Jonathan E. Shopiro: Theseus - A Programming Language for Relational Databases. ACM Trans. Database Syst. 4(4): 493-517(1979)
171. Alain Pirotte: Fundamental and Secondary Issues in the Design of Non-Procedural Relational Languages. VLDB 1979: 239-250