Query Execution Techniques for Caching Expensive Methods

Summary: Evaluates caching of unary methods in OR/O-O queries with duplicates; compares memoization, sorting, and Hybrid Cache. Hybrid Cache dominates memoization and often beats sorting; adds unary-hash optimizations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h76a3002ab84e1700
Venue: SIGMOD
Year: 1996
Pagerank: 0.00013655214
Overall Rank: 821 | 94.49%
DOI: 10.1145/233269.233359

Incoming Non-self Citations Over Time

Authors

1. Joseph M. Hellerstein (University of California Berkeley; University of Wisconsin)
2. Jeffrey E. Naughton (University of Wisconsin)

BibTeX Citation

@inproceedings{hellerstein_sigmod96,
        title = {{Query Execution Techniques for Caching Expensive Methods}},
        author = {Hellerstein, Joseph M. and Naughton, Jeffrey E.},
        series = {{SIGMOD} '96},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/233269.233359},
        url = {https://dl.acm.org/doi/10.1145/233269.233359},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 24 of 24 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9	Online Aggregation	1997	SIGMOD	0.00076265429
92	CrowdDB: Answering Queries with Crowdsourcing	2011	SIGMOD	0.00034670735
112	TelegraphCQ: Continuous Dataflow Processing for an Uncertain World	2003	CIDR	0.00032445088
135	Ripple Joins for Online Aggregation	1999	SIGMOD	0.00029858107
870	Query Optimization in the Presence of Limited Access Patterns	1999	SIGMOD	0.00013342453
1,131	WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web*	2000	SIGMOD	0.00011896556
1,285	SQL/MapReduce: A practical approach to self-describing, polymorphic, and parallelizable user-defined functions	2009	VLDB	0.0001119616
1,378	Execution Strategies for SQL Subqueries	2007	SIGMOD	0.00010859556
1,703	Online Dynamic Reordering for Interactive Data Processing	1999	VLDB	9.8269486e-05
1,801	Hash joins and hash teams in Microsoft SQL Server	1998	VLDB	9.604827e-05
2,115	Reusing Invariants: A New Strategy for Correlated Queries	1998	SIGMOD	9.0119103e-05
2,285	A Platform for Scalable One-Pass Analytics using MapReduce	2011	SIGMOD	8.6924793e-05
2,660	The Complexity of Transformation-Based Join Enumeration	1997	VLDB	8.1574087e-05
3,088	On Parallel Processing of Aggregate and Scalar Functions in Object-Relational DBMS	1998	SIGMOD	7.6593918e-05
3,985	Data Canopy: Accelerating Exploratory Statistical Analysis	2017	SIGMOD	6.8708857e-05
4,378	Optimization of Run-time Management of Data Intensive Web Sites	1999	VLDB	6.6254986e-05
4,728	User-Defined Table Operators: Enhancing Extensibility for ORDBMS	1999	VLDB	6.4446427e-05
8,136	Client-Site Query Extensions	1999	SIGMOD	5.3912113e-05
8,322	Adaptive Execution of Variable-Accuracy Functions	2006	VLDB	5.3534332e-05
9,700	The UDFBench Benchmark for General-purpose UDF Queries	2025	VLDB	5.1372261e-05
12,915	XClean in Action: A Demonstration of Declarative XML Data Cleaning	2007	CIDR	4.9769913e-05
13,015	Action-Oriented Query Processing for Pervasive Computing	2005	CIDR	4.9769913e-05
13,024	Predicate Result Range Caching for Continuous Queries	2005	SIGMOD	4.9769913e-05
13,164	HyperQueries: Dynamic Distributed Query Processing on the Internet	2001	VLDB	4.9769913e-05

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
1	Access Path Selection in a Relational Database Management System	1979	SIGMOD	0.0023943337
7	Implementation Techniques For Main Memory Database Systems	1984	SIGMOD	0.00081971778
58	Statistical Estimators for Relational Algebra Expressions	1988	PODS	0.00040025054
77	Sampling-Based Estimation of the Number of Distinct Values of an Attribute	1995	VLDB	0.00036817139
82	Hashing Methods and Relational Algebra Operations	1984	VLDB	0.00036042975
125	Predicate Migration: Optimizing Queries with Expensive Predicates	1993	SIGMOD	0.00030462671
853	Hash-Partitioned Join Method Using Dynamic Destaging Strategy	1988	VLDB	0.00013439366
1,032	Cost-Based Optimization for Magic: Algebra and Implementation	1996	SIGMOD	0.00012396854
1,076	Towards an Open Architecture for LDL	1989	VLDB	0.00012154177
1,439	Magic is Relevant	1990	SIGMOD	0.000106437
1,860	Optimizing Disjunctive Queries with Expensive Predicates	1994	SIGMOD	9.4862912e-05
2,035	Practical Predicate Placement	1994	SIGMOD	9.1519324e-05
3,530	Extended User-Defined Indexing with Application to Textual Databases	1988	VLDB	7.2243276e-05
3,722	Bypassing Joins in Disjunctive Queries	1995	VLDB	7.0684532e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,846	Query Processing in Tertiary Memory Databases	1995	VLDB
2	4,221	Efficiently Supporting Procedures In Relational Database Systems	1987	SIGMOD
3	4,834	ReCache: Reactive Caching for Fast Analytics over Heterogeneous Data	2018	VLDB
4	1,041	Generic Database Cost Models for Hierarchical Memory Systems	2002	VLDB
5	76	Cache Conscious Algorithms for Relational Query Processing	1994	VLDB
6	3,062	Design and Evaluation of Parallel Pipelined Join Algorithms	1987	SIGMOD
7	1,596	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB
8	7,920	Cache-Oblivious Query Processing	2007	CIDR
9	4,883	Loading a Cache with Query Results	1999	VLDB
10	2,245	Cache-Efficient Aggregation: Hashing Is Sorting	2015	SIGMOD