HistSFC: Optimization for nD massive spatial points querying

    Research output: Contribution to journalArticleScientific

    2 Downloads (Pure)

    Abstract

    Space Filling Curve (SFC) mapping-based clustering and indexing works effectively for point clouds management and querying. It maps both points and queries into a one-dimensional SFC space so that B+- tree could be utilized. Based on the basic structure, this paper develops a generic HistSFC approach which utilizes a histogram tree recording point distribution for efficient querying. The goal is to resolve the issue of skewed data querying. Besides, the paper proposes an agile method to compute a continuous Level of Detail (cLoD), and integrates it into HistSFC to support smooth rendering of massive points. Results indicate that for range queries, HistSFC decreases the False Positive Rate (FPR) of selection by maximally 80%, compared to previous approaches. It also performs significantly faster than the state-of- the-art Oracle SDO_PC solution. With improved performance on visualization and k Nearest Neighbour (kNN) search, HistSFC can therefore be used as a new standard solution.
    Original languageEnglish
    Pages (from-to)7-28
    Number of pages22
    JournalInternational Journal of Database Management Systems (IJDMS)
    Volume12
    Issue number3
    DOIs
    Publication statusPublished - 2020

    Keywords

    • Point Clouds
    • Histogram
    • Space Filling Curve
    • Benchmark
    • nD

    Fingerprint Dive into the research topics of 'HistSFC: Optimization for nD massive spatial points querying'. Together they form a unique fingerprint.

    Cite this