Generating high dimensional data and query sets
- Authors
- Kim, Sang-Wook; Yoon, Seok-Ho; Lee, Sang-Cheo; Lee, Junghoon; Shin, Miyoung
- Issue Date
- Jan-2007
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4362 LNCS, pp.357 - 366
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 4362 LNCS
- Start Page
- 357
- End Page
- 366
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/180538
- DOI
- 10.1007/978-3-540-69507-3_30
- ISSN
- 0302-9743
- Abstract
- Previous researches on multidimensional indexes typically have used synthetic data sets distributed uniformly or normally over multidimensional space for performance evaluation. These kinds of data sets hardly reflect the characteristics of multimedia database applications. In this paper, we discuss issues on generating high dimensional data and query sets for resolving the problem. We first identify the requirements of the data and query sets for fair performance evaluation of multidimensional indexes, and then propose HDDQ.Gen (High-Dimensional Data and Query Generator) that satisfies such requirements. HDDQ-Gen has the following features: (1) clustered distribution, (2) various object distribution in each cluster, (3) various cluster distribution, (4) various correlations among different dimensions, and (5) query distribution depending on data distribution. Using these features, users are able to control the distribution characteristics of data and query sets appropriate for their target applications.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/180538)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.