Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarACM SIGMOD Anthology, Volume 5, Number 2: Selected Material from Journal of the ACM (JACM)
Volume 47, 2000
Volume 46, 1999
Paolo Ferragina, Roberto Grossi:
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. 236-280- Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard Weikum:
An Optimality Proof of the LRU-K Page Replacement Algorithm. 92-112
Volume 45, 1998
- Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. 1-34 - Michael Kifer:
On the Decidability and Axiomatization of Query Finiteness in Deductive Databases. 588-633 - Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu:
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. 891-923
Volume 44, 1997
- Serge Abiteboul, Moshe Y. Vardi, Victor Vianu:
Fixpoint logics, relational machines, and computational complexity. 30-56 - Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
On the completeness of object-creating database transformation languages. 272-319
Volume 43, 1996
Volume 42, 1995
- Michael Kifer, Georg Lausen, James Wu:
Logical Foundations of Object-Oriented and Frame-Based Languages. 741-843
Volume 41, 1994
- Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian:
Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases. 1178-1215 - Kenneth A. Ross:
Modular Stratification and Magic Sets for Datalog Programs with Negation. 1216-1266
Volume 36, 1989
- William McCune, Lawrence J. Henschen:
Maintaining state constraints in relational databases: a proof theoretic basis. 46-68 - Catriel Beeri, Philip A. Bernstein, Nathan Goodman:
A model for concurrency in nested transactions systems. 230-269 - Serge Abiteboul, Victor Vianu:
A transaction-based approach to relational database specification. 758-789 - Marc Gyssens, Jan Paredaens, Dirk Van Gucht:
A uniform approach toward handling atomic and structured information in the nested relational database model. 790-825
Volume 35, 1988
- Jeffrey D. Ullman, Allen Van Gelder:
Efficient tests for top-down termination of logical rules. 345-373
Volume 34, 1987
- Edward P. F. Chan, Alberto O. Mendelzon:
Answering queries on embedded-complete database schemes. 349-375 - Catriel Beeri, Michael Kifer:
A theory of intersection anomalies in relational database schemes. 544-577
Volume 33, 1986
- Raymond Reiter:
A sound and sometimes complete query evaluation algorithm for relational databases with null values. 349-370
Volume 32, 1985
- Michael J. Fischer, Nancy A. Lynch, Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process. 374-382 - Y. C. Tay, Rajan Suri, Nathan Goodman:
A Mean Value Performance Model for Locking in Databases: The No-Waiting Case. 618-651
Volume 31, 1984
- Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies. 30-46 - Lawrence J. Henschen, Shamim A. Naqvi:
On compiling queries in recursive first-order databases. 47-85 - Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time. 538-544 - Debasis Mitra, Peter J. Weinberger:
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics. 855-878
Volume 30, 1983
- Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis:
On the Desirability of Acyclic Database Schemes. 479-513 - Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Graph Algorithms for Functional Dependency Manipulation. 752-766
Volume 29, 1982
- Yehoshua Sagiv, Scott F. Walecka:
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies. 103-117 - Fereidoon Sadri, Jeffrey D. Ullman:
Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. 363-372 - Anthony C. Klug:
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. 699-717
Volume 28, 1981
- Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin:
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. 435-453 - David Maier, Yehoshua Sagiv, Mihalis Yannakakis:
On the Complexity of Testing Implications of Functional and Join Dependencies. 680-695
Volume 27, 1980
- Marshall C. Pease, Robert E. Shostak, Leslie Lamport:
Reaching Agreement in the Presence of Faults. 228-234 - Yehoshua Sagiv:
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. 250-262 - Yehoshua Sagiv, Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators. 633-655
Volume 26, 1979
Volume 23, 1976
- Mark J. Eisner, Dennis G. Severance:
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases. 619-635 - Maarten H. van Emden, Robert A. Kowalski:
The Semantics of Predicate Logic as a Programming Language. 733-742
Volume 22, 1975
Volume 20, 1973
- C. L. Liu, James W. Layland:
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. 46-61
Volume 18, 1971
Volume 17, 1970
- Chittoor V. Ramamoorthy, K. Mani Chandy:
Optimization of Memory Hierarchies in Multiprogrammed Systems. 426-445
Volume 16, 1969
- Robert A. Di Paola:
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas. 324-327 - Sakti P. Ghosh, Michael E. Senko:
File Organization: On the Selection of Random Access Index Points for Sequential Files. 569-579
Volume 15, 1968
- Donald R. Morrison:
PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. 514-534 - Thomas C. Lowe:
The Influence of Data Base Characteristics and Usage on Direct Access File Organization. 535-548
Volume 12, 1965
Volume 9, 1962
last updated on 2019-06-17 23:19 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
