Query transformation for exact cardinality computing
In general, query optimizers rely on a cost model to choose an appropriate query execution plan for the given queries. An important key parameter of the cost estimation is the cardinality of sub-expressions of the queries. Traditionally, the optimizers may use the estimation cardinality techniques,...
Saved in:
Main Authors: | Kwanglat P., Natwichai J. |
---|---|
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2014
|
在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-79957574902&partnerID=40&md5=60cb0c6c9d02fd4994a90af659ad3df7 http://cmuir.cmu.ac.th/handle/6653943832/1567 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
語言: | English |
相似書籍
-
Query transformation for exact cardinality computing
由: Prariwat Kwanglat, et al.
出版: (2018) -
MEASURABLE CARDINALS AND SINGULAR CARDINAL HYPOTHESIS FOR ABOVE STRONGLY COMPACT CARDINALS
由: HENG TENG BOON
出版: (2021) -
Parallel Banding Algorithm to compute exact distance transform with the GPU
由: Cao, T.-T., et al.
出版: (2013) -
Interview with Cardinal Sin
由: Abacan, Jose Mari, et al.
出版: (1986) -
Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
由: Yuan, Ganzhao, et al.
出版: (2017)