scholarly journals Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

2014 ◽  
Vol 22 (1) ◽  
pp. 31 ◽  
Author(s):  
Serhiy Morozov ◽  
Hossein Saiedian ◽  
Hanzhang Wang
Keyword(s):  
Prime Number ◽  
Relational Databases ◽  
Data Representation ◽  
Hierarchical Data ◽  
Labeling Scheme ◽  
Hierarchical Data Representation

Information Transfer

2010 ◽  
pp. 247-261
Author(s):  
Manjunath Ramachandra
Keyword(s):  
Supply Chain ◽  
Packet Loss ◽  
Information Transfer ◽  
Data Representation ◽  
Multimedia Data ◽  
Data Streaming ◽  
Hierarchical Data ◽  
Hierarchical Data Representation

The transfer of live data over the supply chain is challenging. The problem is compounded if multimedia data is involved. The delay in the transmission, packet loss etc will be the cause for concern. In this chapter hierarchical data representation is introduced towards data streaming and better performance.

Hybridation of Labeling Schemes for Efficient Dynamic Updates

2016 ◽  
Vol 4 (1) ◽  
pp. 184 ◽  
Author(s):  
Su Cheng Haw ◽  
Samini Subramaniam ◽  
Wei Siang Lim ◽  
Fang Fang Chua
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Data Representation ◽  
Xml Database ◽  
Extended Range ◽  
Database Technology ◽  
Wise Choice ◽  
Labeling Scheme ◽  
Dynamic Updates ◽  
Mapping Scheme

<p>With XML as the leading standard for data representation over the Web, it is crucial to store and query XML data. However, relational databases are the dominant database technology in most organizations. Thus, replacing relational database with a pure XML database is not a wise choice. One most prominent solution is to map XML into relational database. This paper introduces a robust labeling scheme which is a hybrid labeling scheme combining the beauty features of extended range and ORDPATH schemes to supports dynamic updates. In addition, we also proposed a mapping scheme based on the hybrid labeling scheme. Our proposed approach is evaluated in terms of (i) loading time, (ii) storage size, (iii) query retrieval time, and (iv) dynamic updates time, as compared to ORDPATH and ME schemes. The experimental evaluation results shows that our proposed approach is scalable to support huge datasets and dynamic updates.</p>

Information Storage

2010 ◽  
pp. 139-151
Author(s):  
Manjunath Ramachandra
Keyword(s):  
Data Warehouse ◽  
Information Transfer ◽  
Cost Effective ◽  
Data Representation ◽  
Information Storage ◽  
Hierarchical Data ◽  
Hierarchical Data Representation

The success of information transfer from the suppliers depends largely up on the organization of the data to cater for different categories of the users. It calls for quick, competitive and cost effective solutions. To meet the same, hierarchical data representation is introduced in this chapter. The example of Data warehouse is considered to explain the concept.

SQL-based semantics for path expressions over hierarchical data in relational databases

2014 ◽  
Vol 40 (3) ◽  
pp. 293-312 ◽  
Author(s):  
Johanna Vainio ◽  
Marko Junkkari
Keyword(s):  
Relational Databases ◽  
Hierarchical Data

scholarly journals Depicting More Information in Enriched Squarified Treemaps with Layered Glyphs

Information ◽  
2020 ◽  
Vol 11 (2) ◽  
pp. 123
Author(s):  
Anderson Gregório Marques Soares ◽  
Elvis Thermo Carvalho Miranda ◽  
Rodrigo Santos do Amor Divino Lima ◽  
Carlos Gustavo Resque dos Santos ◽  
Bianchi Serique Meiguins
Keyword(s):  
Information Visualization ◽  
Data Structures ◽  
User Study ◽  
Relevant Information ◽  
Data Representation ◽  
High Dimensional ◽  
Hierarchical Data ◽  
Visual Data ◽  
Visual Variable ◽  
Data Clusters

The Treemap is one of the most relevant information visualization (InfoVis) techniques to support the analysis of large hierarchical data structures or data clusters. Despite that, Treemap still presents some challenges for data representation, such as the few options for visual data mappings and the inability to represent zero and negative values. Additionally, visualizing high dimensional data requires many hierarchies, which can impair data visualization. Thus, this paper proposes to add layered glyphs to Treemap’s items to mitigate these issues. Layered glyphs are composed of N partially visible layers, and each layer maps one data dimension to a visual variable. Since the area of the upper layers is always smaller than the bottom ones, the layers can be stacked to compose a multidimensional glyph. To validate this proposal, we conducted a user study to compare three scenarios of visual data mappings for Treemaps: only Glyphs (G), Glyphs and Hierarchy (GH), and only Hierarchy (H). Thirty-six volunteers with a background in InfoVis techniques, organized into three groups of twelve (one group per scenario), performed 8 InfoVis tasks using only one of the proposed scenarios. The results point that scenario GH presented the best accuracy while having a task-solving time similar to scenario H, which suggests that representing more data in Treemaps with layered glyphs enriched the Treemap visualization capabilities without impairing the data readability.

Sign in / Sign up

Export Citation Format

Share Document