Query evaluation techniques for large databases

Query evaluation techniques for large databases (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Goetz Graefe

Venue:	ACM COMPUTING SURVEYS
Citations:	592 - 7 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	Query evaluation techniques for large databases	INFERENCE
AUTHOR NAME	Goetz Graefe	user correction
AUTHOR AFFIL	Portland State University, Computer Science Department	user correction
AUTHOR ADDR	P.O. Box 751, Portland, Oregon 97207−0751	user correction
ABSTRACT	Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate it: In order to manipulate large sets of complex objects as efficiently as today’s database systems manipulate simple records, query processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software. This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and post-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE	ACM COMPUTING SURVEYS	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	73--170	INFERENCE
VOLUME	25	INFERENCE
CITATIONS	473 found	ParsCit 1.0