A Superjoin Algorithm for Deductive Databases.
James A. Thom, Kotagiri Ramamohanarao, Lee Naish:
A Superjoin Algorithm for Deductive Databases.
VLDB 1986: 189-196@inproceedings{DBLP:conf/vldb/ThomRN86,
author = {James A. Thom and
Kotagiri Ramamohanarao and
Lee Naish},
editor = {Wesley W. Chu and
Georges Gardarin and
Setsuo Ohsuga and
Yahiko Kambayashi},
title = {A Superjoin Algorithm for Deductive Databases},
booktitle = {VLDB'86 Twelfth International Conference on Very Large Data Bases,
August 25-28, 1986, Kyoto, Japan, Proceedings},
publisher = {Morgan Kaufmann},
year = {1986},
isbn = {0-934613-18-4},
pages = {189-196},
ee = {db/conf/vldb/ThomRN86.html},
crossref = {DBLP:conf/vldb/86},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
This paper describes a join algorithm suitable for deductive and
relational databases which are accessed by computers with large
main memories. Using multi-key hashing and appropriate
buffering, joins can be performed on very large relations more
efficiently than with existing methods. Furthermore, this algorithm
fits naturally into top-down Prolog computations and can be made
very flexible by incorporating additional Prolog features.
Copyright © 1986 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Wesley W. Chu, Georges Gardarin, Setsuo Ohsuga, Yahiko Kambayashi (Eds.):
VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings.
Morgan Kaufmann 1986, ISBN 0-934613-18-4
Contents BibTeX
References
- [Aho 79]
- Alfred V. Aho, Jeffrey D. Ullman:
Optimal Partial-Match Retrieval When Fields Are Independently Specified.
ACM Trans. Database Syst. 4(2): 168-179(1979) BibTeX
- [Bratbergsengen 84]
- Kjell Bratbergsengen:
Hashing Methods and Relational Algebra Operations.
VLDB 1984: 323-333 BibTeX
- [Clark 78]
- Keith L. Clark:
Negation as Failure.
Logic and Data Bases 1977: 293-322 BibTeX
- [Clocksin 81]
- ...
- [DeWitt 84]
- David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood:
Implementation Techniques for Main Memory Database Systems.
SIGMOD Conference 1984: 1-8 BibTeX
- [Jarke 84]
- Matthias Jarke, Jürgen Koch:
Query Optimization in Database Systems.
ACM Comput. Surv. 16(2): 111-152(1984) BibTeX
- [Lloyd 80]
- ...
- [Lloyd 82]
- John W. Lloyd, Kotagiri Ramamohanarao:
Partial Match Retrieval for Dynamic Files.
BIT 22(2): 150-168(1982) BibTeX
- [Naish 83]
- ...
- [Naish 85a]
- ...
- [Naish 85b]
- Lee Naish:
Negation and Quantifiers in NU-Prolog.
ICLP 1986: 624-634 BibTeX
- [Naish 85c]
- ...
- [Ramamohanarao 83]
- Kotagiri Ramamohanarao, John W. Lloyd:
Partial-Match Retrieval Using Hashing and Descriptors.
ACM Trans. Database Syst. 8(4): 552-576(1983) BibTeX
- [Ramamohanarao 85a]
- Kotagiri Ramamohanarao, Ron Sacks-Davis:
Partial Match Retrieval Using Recursive Linear Hashing.
BIT 25(3): 477-484(1985) BibTeX
- [Ramamohanarao 85b]
- Kotagiri Ramamohanarao, John Shepherd:
A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases.
ICLP 1986: 569-576 BibTeX
- [Reiter 78]
- Raymond Reiter:
On Closed World Data Bases.
Logic and Data Bases 1977: 55-76 BibTeX
- [Rivest 76]
- Ronald L. Rivest:
Partial-Match Retrieval Algorithms.
SIAM J. Comput. 5(1): 19-50(1976) BibTeX
- [Ullman 82]
- Jeffrey D. Ullman:
Principles of Database Systems, 2nd Edition.
Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX
- [Warren 81]
- David H. D. Warren:
Efficient Processing of Interactive Relational Data Base Queries expressed in Logic.
VLDB 1981: 272-281 BibTeX
- [Wong 76]
- Eugene Wong, Karel Youssefi:
Decomposition - A Strategy for Query Processing.
ACM Trans. Database Syst. 1(3): 223-241(1976) BibTeX
Referenced by
- Sang-Wook Kim, Wan-Sup Cho, Min-Jae Lee, Kyu-Young Whang:
A New Algorithm for Processing Joins Using the Multilevel Grid File.
DASFAA 1995: 115-123
- Ludger Becker, Klaus Hinrichs, Ulrich Finke:
A New Algorithm for Computing Joins with Grid Files.
ICDE 1993: 190-197
- Priti Mishra, Margaret H. Eich:
Join Processing in Relational Databases.
ACM Comput. Surv. 24(1): 63-113(1992)
- Aris M. Ouksel, Otto Mayer:
The Nested Interpolation Based Grid File.
MFDBS 1991: 173-187
- Christos Faloutsos, Shari Roseman:
Fractals for Secondary Key Retrieval.
PODS 1989: 247-252
- Masaru Kitsuregawa, Lilian Harada, Mikio Takagi:
Join Strategies on KB-Tree Indexed Relations.
ICDE 1989: 85-93
- Kotagiri Ramamohanarao, John Shepherd, Ron Sacks-Davis:
Partial-match Retrieval using Multiple-Key Hashing with Multiple File Copies.
DASFAA 1989: 225-232
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:45:29 2009