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: | Prariwat Kwanglat, Juggapong Natwichai |
---|---|
格式: | Conference Proceeding |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79957574902&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49885 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Query transformation for exact cardinality computing
由: Kwanglat P., et al.
出版: (2014) -
An efficient indexing for top-k query answering in location-based recommendation system
由: Sudarat Yawutthi, et al.
出版: (2018) -
Parallel Banding Algorithm to compute exact distance transform with the GPU
由: Cao, T.-T., et al.
出版: (2013) -
MEASURABLE CARDINALS AND SINGULAR CARDINAL HYPOTHESIS FOR ABOVE STRONGLY COMPACT CARDINALS
由: HENG TENG BOON
出版: (2021) -
Pseudocodewords of parity-check codes over fields of prime cardinality
由: Wittawat Kositwattanarerk, et al.
出版: (2018)