Berkeley COMPSCI 262A - Grammer-like Functional Rules for Representing Query Optimization Alternative (10 pages)

Previewing pages 1, 2, 3 of 10 page document View the full content.
View Full Document

Grammer-like Functional Rules for Representing Query Optimization Alternative



Previewing pages 1, 2, 3 of actual document.

View the full content.
View Full Document
View Full Document

Grammer-like Functional Rules for Representing Query Optimization Alternative

29 views


Pages:
10
School:
University of California, Berkeley
Course:
Compsci 262a - Advanced Topics in Computer Systems

Unformatted text preview:

Grammar like Functional Rules for Representing Query Optimization Alternatives Guy M L man IBM Almaden Research Center San Jose CA 95120 BERN 811 BloomJoms BABB 79 MACK 861 parallel on fragments CWONG 831 Jam mdexes CHAER 78 VALD 871 dynanuc creauon of mdexes h4ACK 861 and many other vanatlons of tradmonal processmgstrateges The recent surge m mterest 111extensible database systems CSTON 86 CARE 86 SCHW 86 BAT0 861 has only exacerbated the burden on optlnuzers addmg the need to custonuze a database system for a part cuhu class of appbcations such as geograptuc CLOHM 831 CAD CAM or expert systems Now optmuzen must adapt to new access methods storage managers data types user defmed functions etc all combmed m novel ways Clearly the titlonal speclficatlon of aU feasible strateges m the optmuzer code cannot support such flu y Abstract S IIUJOUIS JOUB Extensible query optmuxahon reqmres that the repertoue of alternatIve strate esfor executmg quenes be represented as data not embedded m the optumzer code Recogmzmg that query optmuzers are essentlaliy expert systems several researchers have suggested usmg strategy rules to transform query execution plans into alternatlve or better plans Though extremely flexrble these systemscan be very mefflclent at any step m the processmg many rules may be ehable for apphcatlon and comphcated cond ons must be tested to detemune that ehgbtity dunng umfuzatlon We present a constructwe buddmg blocks approach to defmmg alternative plans m which the rules defmmg alternatives are an extension of the productlons of a grammar to resemblethe defuution of a funcuon m mathematics The extensions pernut each token of the grammar to be parametnzed and each of its alternative deflmtlons to have a complex con tlon The termmals of the grammar are base level database operations on tables that are mterpreted at run me The non termmals are defined declaratively by productlon rules that combme those operauons mto meamngful plans for executton Each producuon



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Grammer-like Functional Rules for Representing Query Optimization Alternative and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Grammer-like Functional Rules for Representing Query Optimization Alternative and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?