Abstract: The subject technology tracks a plurality of queries corresponding to a plurality of query plans based on join operations contained in each of the plurality of queries and a previous time of executing each query. The subject technology selects a first query plan among the plurality of query plans. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of a previous query plan. The subject technology attempts to execute a first query using the first query plan. The subject technology determines that a second query plan selected among the plurality of query plans has a second estimated execution time that is less than an estimated execution time of the first query plan. The subject technology executes the first query corresponding to the first query plan at a subsequent time using the second query plan.

Abstract: The subject technology tracks a plurality of queries corresponding to a plurality of query plans based on join operations contained in each of the plurality of queries and a previous time of executing each query. The subject technology selects a first query plan among the plurality of query plans. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of a previous query plan. The subject technology attempts to execute a first query using the first query plan. The subject technology determines that a second query plan selected among the plurality of query plans has a second estimated execution time that is less than an estimated execution time of the first query plan. The subject technology executes the first query corresponding to the first query plan at a subsequent time using the second query plan.

Abstract: The subject technology receives a first query plan corresponding to a first query, the first query plan comprising a new query plan different than a previous query plan for the first query. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of the previous query plan. The subject technology, in response to determining that the value is greater than a threshold value, attempting to execute the first query using the first query plan, the attempting comprising determining that a second query plan selected among a plurality of query plans has a second estimated execution time that is less than an estimated execution time of the first query plan, and executing the first query at a subsequent time using the second query plan.

Abstract: The subject technology receives a first query plan corresponding to a first query, the first query plan comprising a new query plan different than a previous query plan for the first query. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of the previous query plan. The subject technology, in response to determining that the value is greater than a threshold value, attempting to execute the first query using the first query plan, the attempting comprising determining that a second query plan selected among a plurality of query plans has a second estimated execution time that is less than an estimated execution time of the first query plan, and executing the first query at a subsequent time using the second query plan.

Abstract: The subject technology receives a first query plan corresponding to a first query, the first query plan comprising a new query plan different than a previous query plan for the first query. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of the previous query plan. The subject technology determines that the value is greater than a threshold value. The subject technology, in response to the value being greater than the threshold value, executes the first query using the first query plan.

Abstract: A computer implemented method and apparatus for a memory efficient approach for decoding progressive JPEG images. The method comprises (a) accessing a progressive JPEG image, wherein the progressive JPEG image comprises a plurality of compressed scans and wherein each scan in the plurality of scans comprises a plurality of compressed rows of image data; (b) decompressing not more than half of the compressed rows of each scan in the plurality of scans into a memory buffer; (c) copying a remaining plurality of compressed rows of each scan in the plurality of scans into a plurality of small memory buffers; (d) decoding, in place, the decompressed rows in the memory buffer; and (e) repeating steps (b)-(d) until a predefined number of rows are remaining in the plurality of small memory buffers, at which time the remaining rows are decompressed and decoded.

Abstract: A computer implemented method and apparatus for a memory efficient approach for decoding progressive JPEG images. The method comprises (a) accessing a progressive JPEG image, wherein the progressive JPEG image comprises a plurality of compressed scans and wherein each scan in the plurality of scans comprises a plurality of compressed rows of image data; (b) decompressing not more than half of the compressed rows of each scan in the plurality of scans into a memory buffer; (c) copying a remaining plurality of compressed rows of each scan in the plurality of scans into a plurality of small memory buffers; (d) decoding, in place, the decompressed rows in the memory buffer; and (e) repeating steps (b)—(d) until a predefined number of rows are remaining in the plurality of small memory buffers, at which time the remaining rows are decompressed and decoded.