Concerned about database performance with ever-increasing data volumes? This survey provides a comprehensive foundation for designing and implementing efficient query execution facilities in modern database management systems. The paper addresses the challenge of accessing and manipulating large datasets effectively, particularly in the context of object-oriented and extensible databases. This report equips database designers with the knowledge needed to optimize query processing for next-generation database systems. The author reviews a wide array of practical query evaluation techniques relevant to both relational and postrelational systems. Topics include iterative execution of complex query evaluation plans, the duality of sort- and hash-based set-matching algorithms, and types of parallel query execution and their implementation. The study also covers special operators designed for emerging database application domains. This survey serves as a valuable resource for database professionals seeking to improve the performance of their systems. This work provides a solid understanding of algorithm and architectural issues essential for designing database management software that can handle large data volumes efficiently.
Published in ACM Computing Surveys, this article is highly relevant to the journal's focus on providing in-depth surveys of computer science topics. ACM Computing Surveys offers comprehensive overviews of key areas in computing. By presenting a wide range of query evaluation techniques, this paper aligns with the journal's mission of providing foundational knowledge to computer science researchers and practitioners.