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: 2139
Venue: SIGMOD
Year: 1978
Pagerank: 5.093636e-05
Overall Rank: 13,278 | 8.91%
DOI: 10.1145/509252.509274

Incoming Non-self Citations Over Time

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

Authors

1. Thomas J. Cook (Virginia Polytechnic Institute and State University)

BibTeX Citation

@inproceedings{cook_sigmod78,
        title = {{A Dynamic Address Computation Mechanism for Use in Database Management}},
        author = {Cook, Thomas J.},
        series = {{SIGMOD} '78},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/509252.509274},
        url = {https://dl.acm.org/doi/10.1145/509252.509274},
        year = {1978}
}

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
6,247	A Data Base Management System Design Philosophy	1975	SIGMOD	5.9425753e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,342	Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks	2019	SIGMOD
2	9,502	Towards Adaptive Storage Views in Virtual Memory	2023	CIDR
3	5,888	Clustering Techniques for Minimizing External Path Length	1996	VLDB
4	9,635	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
5	7	Implementation Techniques For Main Memory Database Systems	1984	SIGMOD
6	5,185	A Multikey Hashing Scheme Using Predicate Trees	1984	SIGMOD
7	13,222	An Efficient Implementation of a Relational Data Base	1985	VLDB
8	1,355	Query Processing in Main Memory Database Management Systems	1986	SIGMOD
9	4,075	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD
10	219	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB