Filters








10 Hits in 7.5 sec

A rule engine for query transformation in Starburst and IBM DB2 C/S DBMS

H. Pirahesh, T.Y.C. Leung, W. Hasan
Proceedings 13th International Conference on Data Engineering  
The rule engine and a suite of query rewrite rules have been implemented in Starburst relational DBMS prototype and a significant portion of this technology has been integrated into IBM DB2 Common Server  ...  In this paper we describe the design and implementation of a rule engine for query rewrite optimization.  ...  Hellerstein and I. Mumick for his help on the implementation of rule engine and rule classes, B. Lindsay for his comments on the paper, and 13. Cochrane for her OO implementation of QGM.  ... 
doi:10.1109/icde.1997.581945 dblp:conf/icde/PiraheskLH97 fatcat:dknh2nfnjvgkhioa24bawqtn6a

Starburst mid-flight: as the dust clears (database project)

L.M. Haas, W. Chang, G.M. Lohman, J. McPherson, P.F. Wilms, G. Lapis, B. Lindsay, H. Pirahesh, M.J. Carey, E. Shekita
1990 IEEE Transactions on Knowledge and Data Engineering  
support nontraditional applications (such as engineering, geographic, office, etc.), and to serve as a testbed for future improvements in database technology.  ...  As of November 1989, we have an initial prototype of our system up and running. In this paper, we reflect on the design and implementation of the Starburst system to date.  ...  There are two types of rules for a customizer to understand, two rule engines to maintain and enhance.  ... 
doi:10.1109/69.50910 fatcat:ehxdg66lvrcinhbxysgoebfl6i

Cost-based optimization for magic

Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
1996 Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96  
The order of complexity of the optimization process is preserved by limiting the search space in a reasonable manner. We have implemented this technique in IBM's DB2 C/S V2 database system.  ...  There can be many variants of this rewriting even for a single query, which differ greatly in execution performance.  ...  We implemented our solution in the DB2 C/S V2 database system (which is based on the Starburst system [HCL+90]) which has support for magic sets rewriting as a query-to-query transformation.  ... 
doi:10.1145/233269.233360 dblp:conf/sigmod/SeshadriHPLRSSS96 fatcat:rxl7xlftf5evbis43ayszorjjq

Cost-based optimization for magic

Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
1996 SIGMOD record  
The order of complexity of the optimization process is preserved by limiting the search space in a reasonable manner. We have implemented this technique in IBM's DB2 C/S V2 database system.  ...  There can be many variants of this rewriting even for a single query, which differ greatly in execution performance.  ...  We implemented our solution in the DB2 C/S V2 database system (which is based on the Starburst system [HCL+90]) which has support for magic sets rewriting as a query-to-query transformation.  ... 
doi:10.1145/235968.233360 fatcat:z2muaq5aw5au3nbbzwlpr6dpg4

Cost-based optimization in DB2 XML

A. Balmin, T. Eliaz, J. Hornibrook, L. Lim, G. M. Lohman, D. Simmen, M. Wang, C. Zhang
2006 IBM Systems Journal  
DB2 XML augments DB2t UDB with a native XML store, XML indexes, and query processing capabilities for both XQuery and SQL/XML that are integrated with those of SQL.  ...  This paper presents the extensions made to the DB2 UDB compiler, and especially its costbased query optimizer, to support XQuery and SQL/XML queries, using much of the same infrastructure developed for  ...  ACKNOWLEDGMENT We would like to thank the entire DB2 XML team for their support of this work.  ... 
doi:10.1147/sj.452.0299 fatcat:ac232lw4z5bnjibsqfjua55xv4

Improving Query Evaluation with Approximate Functional Dependency Based Decompositions [chapter]

Chris M. Giannella, Mehmet M. Dalkilic, Dennis P. Groth, Edward L. Robertson
2002 Lecture Notes in Computer Science  
We present experimental results leading to a characterization of a well-de ned class of queries for which improved processing time is observed.  ...  We use approximate functional dependencies as the conceptual basis for this decomposition and develop query rewriting techniques to exploit it.  ...  One such rule allows sub-queries to be merged into the outer block thereby eliminating the sub-query. The use of rewrite rules in this fashion has been implemented in Starburst and IBM DB2 27, 28 .  ... 
doi:10.1007/3-540-45495-0_3 fatcat:aygzsrx22jfdblpgwhxtkzbrvm

Page 580 of IBM Systems Journal Vol. 42, Issue 4 [page]

IBM Systems Journal  
Hasan, “A Rule Engine for Query Transformation in Starburst and IBM DB2 C/S DBMS,” Proceedings of the 1997 IEEE International Confer- ence on Data Engineering, IEEE Press, New York (1997), pp. 391-400.  ...  Schiefer, and Y. Wang, “Query Optimization in the IBM DB2 Family,” JEEE Data Engineering Bulletin 16, No. 4, 4-18 (1993). 5 Accepted for publication May 30, 2003.  ... 

A framework for testing query transformation rules

Hicham G. Elmongui, Vivek Narasayya, Ravishankar Ramamurthy
2009 Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09  
In this paper we present a framework for testing query transformation rules which enables: (a) efficient generation of queries that exercise a particular transformation rule or a set of rules and (b) efficient  ...  In order to enable extensibility, modern query optimizers typically leverage a transformation rule based framework.  ...  The constrained set multicover problem takes as input a set U, a number m e for each e ∈ U, and a set of subsets S of elements in U. Each s ∈ S has a cost C(s).  ... 
doi:10.1145/1559845.1559874 dblp:conf/sigmod/ElmonguiNR09 fatcat:7w4akn4v3nachlon23chpu5s4i

Exploiting uniqueness in query optimization

G. N. Paulley, Per-Åke Larson
2010 CASCON First Decade High Impact Papers on - CASCON '10  
ansi sql query expressions, including outer joins, and a useful set of declarative constraints for ansi sql base tables, including unique, table, and referential integrity constraints.  ...  We develop and prove a sound set of inference axioms for this set of combined constraints, and formalize the set of constraints that hold in the result of each sql algebraic operator.  ...  from query predicates. starburst and its production version, db2 Common Server, implement these transformations using a rule-based implementation where the transformation is expressed as a condition-action  ... 
doi:10.1145/1925805.1925812 fatcat:fl3ei33mbjf7dgt7m7y3tr4kre

Ontoloby-based semantic query processing in database systems

Chokri Ben Necib, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
Moreover, we propose a set of semantic rules for transforming queries using terms derived from the ontology. We classify the rules and demonstrate their usefulness using practical examples.  ...  We use ontologies to transform a user query into another query that may provide a more meaningful answer to the user.  ...  On a more personal note, his patience and more significantly his perseverance in difficult circumstances were a bright beacon for which I am very grateful.  ... 
doi:10.18452/15691 fatcat:6wtbo22atjg7pc2jjvie5mzbie