Block-wise Skipping for Embedded Database System


The KIPS Transactions:PartD, Vol. 16, No. 6, pp. 835-844, Dec. 2009
10.3745/KIPSTD.2009.16.6.835,   PDF Download:

Abstract

Today, most of all the query processors in the world generally use the 'Pipelining' method to acquire fast response time (first record latency) and less memory usage. Each of the operator nodes in the Query Execution Plan (QEP) provides Open(), Next(), and Close() functions for their interface to facilitate the iterator mechanism. However, the embedded database systems for the mobile devices, based on the FLASH memory, usually require a function like Previous(), which returns the previous records from current position. It is because that, in the embedded environment, the mobile devices cannot fully provide it main memory to store all the query results. So, whenever needed the previously read records the user (program) should re-fetch the previous records using the Previous() function: the BACKWARD data fetch. In this paper, I introduce the 'Direction Switching Problem' caused by the Previous() function and suggest 'Block-wise Skipping' method to fully utilize the benefits of the block-based data transfer mechanism, which is widely accepted by most of the today's relational database management systems.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Chong, H. M. Park, S. J. Hong, K. S. Shim, "Block-wise Skipping for Embedded Database System," The KIPS Transactions:PartD, vol. 16, no. 6, pp. 835-844, 2009. DOI: 10.3745/KIPSTD.2009.16.6.835.

[ACM Style]
Jae Hyok Chong, Hyoung Min Park, Seok Jin Hong, and Kyu Seok Shim. 2009. Block-wise Skipping for Embedded Database System. The KIPS Transactions:PartD, 16, 6, (2009), 835-844. DOI: 10.3745/KIPSTD.2009.16.6.835.