Storage structures for efficient query processing in a stock recommendation system

You Min Ha, Sang Wook Kim, Sanghyun Park, Seung Hwan Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Rule discovery is an operation that uncovers useful rules from a given database. By using the rule discovery process in a stock database, we can recommend buying and selling points to stock investors. In this paper, we discuss storage structures for efficient processing of queries in system that recommends stock investment types. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure performs best in query processing and improves the performance of other ones in orders of magnitude.

Original languageEnglish
Title of host publication1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008
Pages275-280
Number of pages6
DOIs
Publication statusPublished - 2008 Dec 30
Event1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008 - Ostrava, Czech Republic
Duration: 2008 Aug 42008 Aug 6

Publication series

Name1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008

Other

Other1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008
CountryCzech Republic
CityOstrava
Period08/8/408/8/6

Fingerprint

Query processing
Recommender systems
Sales
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Ha, Y. M., Kim, S. W., Park, S., & Lim, S. H. (2008). Storage structures for efficient query processing in a stock recommendation system. In 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008 (pp. 275-280). [4664358] (1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008). https://doi.org/10.1109/ICADIWT.2008.4664358
Ha, You Min ; Kim, Sang Wook ; Park, Sanghyun ; Lim, Seung Hwan. / Storage structures for efficient query processing in a stock recommendation system. 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008. 2008. pp. 275-280 (1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008).
@inproceedings{482e797c8ed44ec59906914b165625de,
title = "Storage structures for efficient query processing in a stock recommendation system",
abstract = "Rule discovery is an operation that uncovers useful rules from a given database. By using the rule discovery process in a stock database, we can recommend buying and selling points to stock investors. In this paper, we discuss storage structures for efficient processing of queries in system that recommends stock investment types. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure performs best in query processing and improves the performance of other ones in orders of magnitude.",
author = "Ha, {You Min} and Kim, {Sang Wook} and Sanghyun Park and Lim, {Seung Hwan}",
year = "2008",
month = "12",
day = "30",
doi = "10.1109/ICADIWT.2008.4664358",
language = "English",
isbn = "9781424426249",
series = "1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008",
pages = "275--280",
booktitle = "1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008",

}

Ha, YM, Kim, SW, Park, S & Lim, SH 2008, Storage structures for efficient query processing in a stock recommendation system. in 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008., 4664358, 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008, pp. 275-280, 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008, Ostrava, Czech Republic, 08/8/4. https://doi.org/10.1109/ICADIWT.2008.4664358

Storage structures for efficient query processing in a stock recommendation system. / Ha, You Min; Kim, Sang Wook; Park, Sanghyun; Lim, Seung Hwan.

1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008. 2008. p. 275-280 4664358 (1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Storage structures for efficient query processing in a stock recommendation system

AU - Ha, You Min

AU - Kim, Sang Wook

AU - Park, Sanghyun

AU - Lim, Seung Hwan

PY - 2008/12/30

Y1 - 2008/12/30

N2 - Rule discovery is an operation that uncovers useful rules from a given database. By using the rule discovery process in a stock database, we can recommend buying and selling points to stock investors. In this paper, we discuss storage structures for efficient processing of queries in system that recommends stock investment types. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure performs best in query processing and improves the performance of other ones in orders of magnitude.

AB - Rule discovery is an operation that uncovers useful rules from a given database. By using the rule discovery process in a stock database, we can recommend buying and selling points to stock investors. In this paper, we discuss storage structures for efficient processing of queries in system that recommends stock investment types. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure performs best in query processing and improves the performance of other ones in orders of magnitude.

UR - http://www.scopus.com/inward/record.url?scp=57949101752&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57949101752&partnerID=8YFLogxK

U2 - 10.1109/ICADIWT.2008.4664358

DO - 10.1109/ICADIWT.2008.4664358

M3 - Conference contribution

AN - SCOPUS:57949101752

SN - 9781424426249

T3 - 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008

SP - 275

EP - 280

BT - 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008

ER -

Ha YM, Kim SW, Park S, Lim SH. Storage structures for efficient query processing in a stock recommendation system. In 1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008. 2008. p. 275-280. 4664358. (1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008). https://doi.org/10.1109/ICADIWT.2008.4664358