ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Lazy structure sharing for query optimization

Buchsbaum, Adam L and Sundar, Rajamani and Tarjan, Robert E (1995) Lazy structure sharing for query optimization. In: Acta Informatica , 32 (3). pp. 255-270.

[img] PDF
Lazy_structure_sharing....pdf - Published Version
Restricted to Registered users only

Download (947Kb) | Request a copy
Official URL: http://www.springerlink.com/content/g325w0971j27h5...

Abstract

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 31 May 2011 07:24
Last Modified: 31 May 2011 07:24
URI: http://eprints.iisc.ernet.in/id/eprint/38069

Actions (login required)

View Item View Item