Efficient Query Indexing for Short Interval Query


The KIPS Transactions:PartD, Vol. 16, No. 4, pp. 507-516, Aug. 2009
10.3745/KIPSTD.2009.16.4.507,   PDF Download:

Abstract

In stream data processing system, generally the interval queries are in advance registered in the system. When a data is input to the system continuously, for realtime processing, a query indexing method is used to quickly search queries. Thus, a main memory-based query index with a small storage cost and a fast search time is needed for searching queries. In this paper, we propose a LVC-based(Limited Virtual Construct-based) query index method using a hashing to meet the both needs. In LVC-based query index, we divide the range of a stream into limited virtual construct, or LVC. We map each interval query to its corresponding LVC and the query ID is stored on each LVC. We have compared with the CEI-based query indexing method through the simulation experiment. When the range of values of input stream is broad and there are many short interval queries, the LVC-based indexing method have shown the performance enhancement for the storage cost and search time.


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. I. Kim, M. J. Song, D. Y. Han, D. I. Kim, B. H. Hwang, "Efficient Query Indexing for Short Interval Query," The KIPS Transactions:PartD, vol. 16, no. 4, pp. 507-516, 2009. DOI: 10.3745/KIPSTD.2009.16.4.507.

[ACM Style]
Jae In Kim, Myung Jin Song, Dae Young Han, Dae In Kim, and Bu Hyun Hwang. 2009. Efficient Query Indexing for Short Interval Query. The KIPS Transactions:PartD, 16, 4, (2009), 507-516. DOI: 10.3745/KIPSTD.2009.16.4.507.