Next Article in Journal
Nanostructured Composites of Sodium Montmorillonite Clay and PEO Used in Dissolution Improvement of Aprepitant Drug by Melt Mixing
Previous Article in Journal
Generation of Ultrashort Optical Pulses in the Deep-Ultraviolet Region Based on Four-Wave Raman Mixing
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle
Appl. Sci. 2018, 8(5), 785; https://doi.org/10.3390/app8050785

Efficiently Answering Reachability Queries for Tree-Structured Data in Repetitive Prime Number Labeling Schemes

1
Department of Management Information Systems, Jeju National University, Jeju 63243, Korea
2
Smart Data Research Group, Electronics and Telecommunications Research Institute, Daejeon 34130, Korea
3
Department of Computer and Information Engineering, Hoseo University, Asan 31499, Korea
*
Author to whom correspondence should be addressed.
Received: 29 March 2018 / Revised: 8 May 2018 / Accepted: 12 May 2018 / Published: 15 May 2018
(This article belongs to the Section Computer Science and Electrical Engineering)
Full-Text   |   PDF [793 KB, uploaded 15 May 2018]   |  

Abstract

Reachability queries plays a crucial role in accessing relationships between nodes in tree-structured data. Previous studies have proposed prime number labeling schemes that answer reachability queries using arithmetic operations. However, the prime numbers in these schemes can become very large when a tree contains a considerable number of nodes; thus, it is not scalable. Recently, a repetitive prime number labeling scheme that reduces space requirements was proposed. Unfortunately, it suffers from slow query processing, owing to the complexity of its reachability test. In this paper, we propose a more efficient method for answering reachability queries in a repetitive prime number labeling scheme. The results of experiments using real-world XML datasets show that our approach reduces reachability query processing times. View Full-Text
Keywords: reachability; prime number labeling; tree; XML reachability; prime number labeling; tree; XML
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Ahn, J.; Lee, T.; Im, D.-H. Efficiently Answering Reachability Queries for Tree-Structured Data in Repetitive Prime Number Labeling Schemes. Appl. Sci. 2018, 8, 785.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top