Conference Proceeding Article
An efficient semantic query optimization algorithm is proposed, in which all possible transformations are tentatively applied to the query. Instead of physically modifying the query, the transformation process classifies the predicates into imperative, optional or redundant. At the end of the transformation process, all the imperative predicates are retained while the redundant predicates are eliminated. Optional predicates are retrained or discarded based on the estimated cost/benefit of retaining them. The issue of the grouping of semantic constraints to reduce the overhead of retrieving constraints and checking whether each constraint is relevant to the current query is also addressed. Based on the proposed algorithm, a prototype semantic query optimizer has been built and preliminary experiments show that the optimizer performs well for large databases.
Computer Sciences | Databases and Information Systems
Data Management and Analytics
Proceedings of the 7th IEEE International Conference on Data Engineering (ICDE): April 8-12, 1991, Kobe, Japan
IEEE Computer Society
City or Country
Los Alamitos, CA
Hwee Hwa PANG; LU, Hongjun; and LU, Beng Chin.
An Efficient Semantic Query Optimization Algorithm. (1991). Proceedings of the 7th IEEE International Conference on Data Engineering (ICDE): April 8-12, 1991, Kobe, Japan. 326-335. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2875
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.