Paper Abstract and Keywords |
Presentation |
2021-09-16 14:45
Approximate query processing using synopses embedded b+trees and preliminary experiments Hiroki Yuasa, Kazuo Goda, Masaru Kitsuregawa (UT) DE2021-13 |
Abstract |
(in Japanese) |
(See Japanese page) |
(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) |
(in English) |
B+tree / approximate query processing / synopsis / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 121, no. 176, DE2021-13, pp. 7-12, Sept. 2021. |
Paper # |
DE2021-13 |
Date of Issue |
2021-09-09 (DE) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
DE2021-13 |
Conference Information |
Committee |
DE IPSJ-DBS IPSJ-IFAT |
Conference Date |
2021-09-16 - 2021-09-17 |
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 |
Paper Information |
Registration To |
DE |
Conference Code |
2021-09-DE-DBS-IFAT |
Language |
Japanese |
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 |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
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) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2021-09-16 14:45:00 |
Presentation Time |
30 minutes |
Registration for |
DE |
Paper # |
DE2021-13 |
Volume (vol) |
vol.121 |
Number (no) |
no.176 |
Page |
pp.7-12 |
#Pages |
6 |
Date of Issue |
2021-09-09 (DE) |
|