AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Efficient Top/Bottom-k Fraction Estimation in Spatial Databases Using Bounded Main Memory

School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
Computer Science Department, James Madison University, Harrisonburg, VA 22807, USA
Show Author Information

Abstract

Spatial databases store objects with their locations and certain types of attached items. A variety of modern applications have been developed by leveraging the utilization of locations and items in spatial objects, such as searching points of interest, hot topics, or users’ attitude in specified spatial regions. In many scenarios, the high and low-frequency items in a spatial region are worth noticing, considering they represent the majority’s interest or eccentric users’ opinion. However, existing works have yet to identify such items in an interactive manner, despite the significance of the endeavor in decision-making systems. This study recognizes a novel type of analytical query, called top/bottom- k fraction query, to discover such items in spatial databases. To achieve fast query response, we propose a multilayered data summary that is spread out across the main memory and external memory. A memory-based estimation method for top/bottom- k fraction queries is proposed. To maximize the use of the main memory space, we design a data summary tuning method to dynamically allocate memory space among different spatial partitions. The proposed approach is evaluated with real-life datasets and synthetic datasets in terms of estimation accuracy. Evaluation results demonstrate the effectiveness of the proposed data summary and corresponding estimation and tuning algorithms.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 223-234

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wang J, Duan Z, Han X, et al. Efficient Top/Bottom-k Fraction Estimation in Spatial Databases Using Bounded Main Memory. Tsinghua Science and Technology, 2022, 27(2): 223-234. https://doi.org/10.26599/TST.2021.9010020

1437

Views

158

Downloads

3

Crossref

2

Web of Science

4

Scopus

0

CSCD

Received: 25 December 2020
Revised: 21 February 2021
Accepted: 12 March 2021
Published: 29 September 2021
© The author(s) 2022

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).