San Diego, California
Feb. 28, 2000 to Mar. 3, 2000
Ivan T. Bowman , Sybase, Inc.
G.N. Paulley , Sybase, Inc.
In today's computing environment, database technology can be found on virtually any device, from traditional mainframes to cellular phones. Sophisticated applications, whether enterprise information portals or sales force automation systems, can `push' much of their complexity into the database itself---indeed, this represents one of the main benefits of database technology. The challenge, however, is to support these complex applications, and the queries they generate, on small computing devices.In this paper, we describe a deterministic join enumeration algorithm for left-deep processing trees, currently implemented in Sybase SQL Anywhere, a small-footprint relational database system whose target market ranges from workgroup servers to small hand-held devices. The algorithm is able to efficiently optimize complex queries with high join degree by employing a novel approach to cost-based pruning of the search space. We present some empirical performance results on several production queries obtained from SQL Anywhere customers, and show that our approach requires significantly less memory than other deterministic join enumeration algorithms which have been described in the literature.
Query optimization, join enumeration, relational databases, branch-and-bound techniques, Sybase SQL Anywhere, left-deep processing tree
Ivan T. Bowman, G.N. Paulley, "Join Enumeration in a Memory-Constrained Environment", ICDE, 2000, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2000, pp. 645, doi:10.1109/ICDE.2000.839482