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 |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79957574902&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49885 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Query transformation for exact cardinality computing
by: Kwanglat P., et al.
Published: (2014) -
An efficient indexing for top-k query answering in location-based recommendation system
by: Sudarat Yawutthi, et al.
Published: (2018) -
Parallel Banding Algorithm to compute exact distance transform with the GPU
by: Cao, T.-T., et al.
Published: (2013) -
MEASURABLE CARDINALS AND SINGULAR CARDINAL HYPOTHESIS FOR ABOVE STRONGLY COMPACT CARDINALS
by: HENG TENG BOON
Published: (2021) -
Pseudocodewords of parity-check codes over fields of prime cardinality
by: Wittawat Kositwattanarerk, et al.
Published: (2018)