( en | de | ru )

 

Disambiguation of "Fraser, Campbell"

Author of the publication

copydeleteadd this publication to your clipboard
Smooth Scan: robust access path selection without cardinality estimation.

, , , , and . VLDB J., 27 (4): 521-545 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Otto Fraser

Anke Fraser

Keir Fraser

Julius Fraser

Fraser MacMillan

 

Other publications of authors with the same name

Smooth Scan: Statistics-oblivious access paths., , , , and . ICDE, page 315-326. IEEE Computer Society, (2015)Enhancements to SQL server column stores., , , , , , , , , and 1 other author(s). SIGMOD Conference, page 1159-1168. ACM, (2013)Consistent Subsequences and Supersequences.. Theor. Comput. Sci., 165 (2): 233-246 (1996)Kepler: Robust Learning for Parametric Query Optimization., , , , , , , and . Proc. ACM Manag. Data, 1 (1): 109:1-109:25 (2023)POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance., , , , , , , , , and 1 other author(s). Proc. VLDB Endow., 17 (6): 1350-1363 (February 2024)Two Algorithms for the Longest Common Subsequence of Three (or More) Strings., and . CPM, volume 644 of Lecture Notes in Computer Science, page 214-229. Springer, (1992)On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings., and . CPM, volume 684 of Lecture Notes in Computer Science, page 63-73. Springer, (1993)Maximal Common Subsequences and Minimal Common Supersequences., and . CPM, volume 807 of Lecture Notes in Computer Science, page 173-183. Springer, (1994)E-Learning for ICT Group Work in a Blended Learning Environment., and . Int. J. Qual. Assur. Eng. Technol. Educ., 1 (2): 50-60 (2011)Smooth Scan: robust access path selection without cardinality estimation., , , , and . VLDB J., 27 (4): 521-545 (2018)