| Presentation | 2021-09-16 Approximate query processing using synopses embedded b+trees and preliminary experiments Hiroki Yuasa, Kazuo Goda, Masaru Kitsuregawa, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we propose a new data structure made by incorporating synopses into b+trees, and make use of the incorporated synopsis when processing queries in order to reduce the number of nodes in the b+tree that must be read for exact results. By planting synopses only in the internal nodes, we showed that it is possible to have very small storage overheads, and accelerating processing time by 25x at most. By restricting the number of nodes being read while processing b+trees, it is possible to reduce processing time even more allowing approximate answers with high accuracies. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | B+tree / approximate query processing / synopsis |
| Paper # | DE2021-13 |
| Date of Issue | 2021-09-09 (DE) |
| Conference Information | |
| Committee | DE / IPSJ-DBS / IPSJ-IFAT |
|---|---|
| Conference Date | 2021/9/16(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Management, information retrieval, knowledge acquisition and general for big data |
| Chair | Naofumi Yoshida(Komazawa Univ.) |
| Vice Chair | Akiyoshi Matono(AIST) / Yu Suzuki(Gifu Univ.) |
| Secretary | Akiyoshi Matono(Kanagawa Inst. of Tech.) / Yu Suzuki(Osaka Univ.) |
| Assistant | Ken Honda(Komazawa Univ.) / Hiroki Nomiya(Kyoto Inst. of Tech) |
| Paper Information | |
| Registration To | Technical Committee on Data Engineering / Special Interest Group on Database System / Special Interest Group on Information Fundamentals and Access Technologies |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Approximate query processing using synopses embedded b+trees and preliminary experiments |
| Sub Title (in English) | |
| Keyword(1) | B+tree |
| Keyword(2) | approximate query processing |
| Keyword(3) | synopsis |
| 1st Author's Name | Hiroki Yuasa |
| 1st Author's Affiliation | The University of Tokyo(UT) |
| 2nd Author's Name | Kazuo Goda |
| 2nd Author's Affiliation | The University of Tokyo(UT) |
| 3rd Author's Name | Masaru Kitsuregawa |
| 3rd Author's Affiliation | The University of Tokyo(UT) |
| Date | 2021-09-16 |
| Paper # | DE2021-13 |
| Volume (vol) | vol.121 |
| Number (no) | DE-176 |
| Page | pp.pp.7-12(DE), |
| #Pages | 6 |
| Date of Issue | 2021-09-09 (DE) |