article · 2000

Design and Implementation of Algorithms for Star Query Optimization

P. Chakrabarti, Pinaki Chakrabarti, To The, Dr. Sumit Ganguly

Cited by 0Abstract and details only

Abstract

In this thesis, we consider the problem of computing optimal join order sequence for star queries, a subclass of tree queries. A join is allowed to be computed using both nested-loop and sort-merge join methods and the use of Cartesian products is avoided. This thesis extends the scope of the problem studied by Ibaraki and Kameda [IK84] and by Krishnamurthy, Boral and Zaniolo [KBZ86].

Cite this paper

APA 7

Chakrabarti, P., Chakrabarti, P., The, T., & Ganguly, D. S. (2000). Design and Implementation of Algorithms for Star Query Optimization.

MLA 9

Chakrabarti, P., et al. “Design and Implementation of Algorithms for Star Query Optimization.” 2000.

Chicago

Chakrabarti, P., Pinaki Chakrabarti, To The, and Dr. Sumit Ganguly. 2000. “Design and Implementation of Algorithms for Star Query Optimization.”

Harvard

Chakrabarti, P. et al. (2000) ‘Design and Implementation of Algorithms for Star Query Optimization’.

BibTeX

@article{chakrabarti2000design,
  title = {{Design and Implementation of Algorithms for Star Query Optimization}},
  author = {Chakrabarti, P. and Chakrabarti, Pinaki and The, To and Ganguly, Dr. Sumit},
  year = {2000}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.