Lazy Structure Sharing for Query Optimization (1993)
BibTeX
@MISC{Buchsbaum93lazystructure,
author = {Adam L. Buchsbaum and Rajamani Sundar and Robert E. Tarjan},
title = {Lazy Structure Sharing for Query Optimization},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types. We investigate a number of strategies for a restricted case of the problem and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. 1 Supported by a Fannie and John Hertz Foundation fellowship, National Science Foundation Grant No. CCR-8920505, and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) under NSF-STC88-09648. 2 Dept. of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India. Work completed while at Princeton University and DIMACS and supported by DIMACS under NSF-STC88-09648. 3 Also affiliated with NEC Research Institute, 4 Independence Way, Princeton, NJ 08540. Research at Princeton University partially sup...
