An Implementation Of Impure Surrogates

Summary: Proposes impure surrogates for fast primary-key access with storage independence, via key compression, hashing, and PK-ordered data pages. A hash-tree index stores surrogates in PK order for fast sequential access, robust at 90% load and schema evolution. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7555
Venue: VLDB
Year: 1982
Pagerank: 4.1945683e-05
Overall Rank: 13,067 | 9.10%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. S. M. Deen

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
8	Extending the Data Base Relational Model to Capture More Meaning	1979	SIGMOD	0.0015385917
730	Trie Hashing	1981	SIGMOD	0.00017483181

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,809	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	0.00010483957
531	Improving Index Performance through Prefetching	2001	SIGMOD	0.00020790058
3,346	Efficiently Supporting Procedures In Relational Database Systems	1987	SIGMOD	7.1924206e-05
11,822	Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries	2016	PODS	4.1945683e-05
4,086	External Perfect Hashing	1985	SIGMOD	6.4608969e-05
9,498	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD	4.3341665e-05
5,596	Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps	2006	VLDB	5.4181535e-05
5,587	Practical Prefetching via Data Compression (extended abstract)	1993	SIGMOD	5.4218484e-05
5,835	Order-Preserving Key Compression for In-Memory Search Trees	2020	SIGMOD	5.30905e-05
12,893	Fast Search In Main Memory Databases	1992	SIGMOD	4.1945683e-05