Database Paper Browser

Back to papers

A Superjoin Algorithm for Deductive Databases

Summary: Introduces a Superjoin algorithm for in-memory deductive and relational databases. Multi-key hashing with buffering enables scalable, faster joins on very large relations; fits naturally with top-down Prolog and allows flexible Prolog extensions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7746
Venue
VLDB
Year
1986
Pagerank
5.2760277e-05
Overall Rank
5,912 | 58.88%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,249 Fractals for Secondary Key Retrieval 1989 PODS 0.00013044758
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
9 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.0014279444
30 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00078672446
Previous Page 1 / 1 Next

Semantically Similar Papers