A Dynamic Address Computation Mechanism for Use in Database Management

Summary: Dynamic address computation for tree data with no pointers; supports arbitrary branching and leaf payloads. Compact, address-free tree description enables direct access at any level, enabling a hybrid architecture blending associative and Von Neumann styles. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2077
Venue: SIGMOD
Year: 1978
Pagerank: 4.1945683e-05
Overall Rank: 13,077 | 9.03%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Thomas J. Cook

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
4,325	A Data Base Management System Design Philosophy	1975	SIGMOD	6.2885419e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,852	Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks	2019	SIGMOD	0.00010322492
9,447	Towards Adaptive Storage Views in Virtual Memory	2023	CIDR	4.3402941e-05
5,196	Clustering Techniques for Minimizing External Path Length	1996	VLDB	5.6365164e-05
9,498	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD	4.3341665e-05
9	Implementation Techniques For Main Memory Database Systems	1984	SIGMOD	0.0014279444
4,952	A Multikey Hashing Scheme Using Predicate Trees	1984	SIGMOD	5.8091931e-05
13,023	An Efficient Implementation Of A Relational Data Base	1985	VLDB	4.1945683e-05
1,309	Query Processing in Main Memory Database Management Systems	1986	SIGMOD	0.00012660929
3,804	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD	6.7525564e-05
233	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB	0.00032021526